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/phases_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:56,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:56,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:56,998 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:56,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:56,999 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:57,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:57,003 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:57,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:57,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:57,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:57,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:57,007 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:57,008 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:57,013 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:57,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:57,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:57,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:57,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:57,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:57,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:57,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:57,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:57,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:57,026 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:57,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:57,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:57,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:57,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:57,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:57,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:57,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:57,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:57,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:57,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:57,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:57,033 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:04:57,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:57,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:57,050 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:57,050 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:57,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:57,051 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:57,051 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:57,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:57,051 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:57,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:57,052 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:57,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:57,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:57,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:57,052 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:57,052 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:57,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:57,053 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:57,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:57,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:57,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:57,054 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:57,054 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:57,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:57,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:57,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:57,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:57,055 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:57,055 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:57,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:57,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:57,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:57,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:57,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:57,131 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:57,131 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:57,132 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_false-unreach-call1.i [2018-11-23 13:04:57,190 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601129e6f/6dda4dfea810429c86f0334d970e1deb/FLAGb7bc7b962 [2018-11-23 13:04:57,617 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:57,617 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_false-unreach-call1.i [2018-11-23 13:04:57,623 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601129e6f/6dda4dfea810429c86f0334d970e1deb/FLAGb7bc7b962 [2018-11-23 13:04:58,019 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601129e6f/6dda4dfea810429c86f0334d970e1deb [2018-11-23 13:04:58,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:58,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:58,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:58,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:58,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:58,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2feb0d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58, skipping insertion in model container [2018-11-23 13:04:58,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:58,079 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:58,322 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:58,327 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:58,354 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:58,372 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:58,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58 WrapperNode [2018-11-23 13:04:58,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:58,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:58,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:58,374 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:58,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:58,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:58,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:58,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:58,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... [2018-11-23 13:04:58,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:58,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:58,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:58,418 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:58,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:58,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:58,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:58,954 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:58,954 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:58,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:58 BoogieIcfgContainer [2018-11-23 13:04:58,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:58,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:58,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:58,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:58,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:58" (1/3) ... [2018-11-23 13:04:58,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f71ad00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:58, skipping insertion in model container [2018-11-23 13:04:58,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:58" (2/3) ... [2018-11-23 13:04:58,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f71ad00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:58, skipping insertion in model container [2018-11-23 13:04:58,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:58" (3/3) ... [2018-11-23 13:04:58,963 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_false-unreach-call1.i [2018-11-23 13:04:58,973 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:58,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:58,997 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:59,031 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:59,032 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:59,032 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:59,033 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:59,033 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:59,033 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:59,033 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:59,034 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:59,034 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:04:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:04:59,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:59,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:59,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:59,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:04:59,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:59,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 13:04:59,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 13:04:59,195 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #37#return; {21#true} is VALID [2018-11-23 13:04:59,195 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-23 13:04:59,196 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0; {21#true} is VALID [2018-11-23 13:04:59,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 13:04:59,197 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#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)); {22#false} is VALID [2018-11-23 13:04:59,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 13:04:59,198 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-23 13:04:59,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 13:04:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:59,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:59,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:59,209 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:04:59,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:59,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:59,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:59,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:59,283 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:04:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,357 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:04:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:59,357 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:04:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:04:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:04:59,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-23 13:04:59,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:59,613 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:04:59,613 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:04:59,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:04:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:04:59,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:59,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:59,747 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:59,748 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,751 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:04:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:04:59,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,752 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:59,752 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,756 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:04:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:04:59,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:59,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 13:04:59,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 13:04:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:59,761 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 13:04:59,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:04:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:04:59,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:59,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:59,763 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:59,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:59,763 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2018-11-23 13:04:59,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:59,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-23 13:05:00,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-23 13:05:00,196 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #37#return; {106#true} is VALID [2018-11-23 13:05:00,196 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret1 := main(); {106#true} is VALID [2018-11-23 13:05:00,197 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 0; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {107#false} is VALID [2018-11-23 13:05:00,198 INFO L256 TraceCheckUtils]: 6: Hoare triple {107#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)); {107#false} is VALID [2018-11-23 13:05:00,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-23 13:05:00,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} assume 0 == ~cond; {107#false} is VALID [2018-11-23 13:05:00,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-23 13:05:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:05:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:05:00,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:05:00,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:00,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:05:00,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:00,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:05:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:05:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:05:00,252 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 13:05:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,444 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:05:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:05:00,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:05:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:05:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:05:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:05:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:05:00,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 13:05:00,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:00,597 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:05:00,597 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:05:00,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:05:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:05:00,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:05:00,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:00,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:00,613 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:00,614 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,615 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:05:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:05:00,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,617 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:00,617 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,619 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:05:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:05:00,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:00,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:05:00,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 13:05:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:00,622 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:05:00,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:05:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:05:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:05:00,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:00,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:00,624 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:00,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2018-11-23 13:05:00,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:00,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:05:00,841 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:05:00,842 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #37#return; {193#true} is VALID [2018-11-23 13:05:00,842 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2018-11-23 13:05:00,844 INFO L273 TraceCheckUtils]: 4: Hoare triple {193#true} ~x~0 := 0; {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {196#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:00,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {194#false} is VALID [2018-11-23 13:05:00,859 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#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)); {194#false} is VALID [2018-11-23 13:05:00,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 13:05:00,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:05:00,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:05:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:00,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:00,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:00,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:01,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:05:01,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:05:01,299 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #37#return; {193#true} is VALID [2018-11-23 13:05:01,299 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2018-11-23 13:05:01,308 INFO L273 TraceCheckUtils]: 4: Hoare triple {193#true} ~x~0 := 0; {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:01,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:01,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {218#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:01,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {194#false} is VALID [2018-11-23 13:05:01,348 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#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)); {194#false} is VALID [2018-11-23 13:05:01,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 13:05:01,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:05:01,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:05:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:01,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:01,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:05:01,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:05:01,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:01,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:05:01,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:01,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:05:01,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:05:01,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:05:01,473 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-23 13:05:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,733 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:05:01,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:05:01,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:05:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:05:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 13:05:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:05:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 13:05:01,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-23 13:05:01,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:01,800 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:05:01,800 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:05:01,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:05:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:05:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:05:01,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:01,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:01,817 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:01,817 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,819 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:05:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:05:01,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,820 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:01,820 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,822 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:05:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:05:01,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:01,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 13:05:01,825 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-23 13:05:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:01,825 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 13:05:01,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:05:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:05:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:05:01,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:01,827 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:01,827 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:01,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:01,828 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2018-11-23 13:05:01,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:01,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-23 13:05:02,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-23 13:05:02,037 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #37#return; {325#true} is VALID [2018-11-23 13:05:02,037 INFO L256 TraceCheckUtils]: 3: Hoare triple {325#true} call #t~ret1 := main(); {325#true} is VALID [2018-11-23 13:05:02,038 INFO L273 TraceCheckUtils]: 4: Hoare triple {325#true} ~x~0 := 0; {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:02,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:02,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:02,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:02,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {329#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:02,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {326#false} is VALID [2018-11-23 13:05:02,050 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#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)); {326#false} is VALID [2018-11-23 13:05:02,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#false} ~cond := #in~cond; {326#false} is VALID [2018-11-23 13:05:02,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#false} assume 0 == ~cond; {326#false} is VALID [2018-11-23 13:05:02,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2018-11-23 13:05:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:02,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:02,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:02,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:02,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:02,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:02,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-23 13:05:02,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-23 13:05:02,271 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #37#return; {325#true} is VALID [2018-11-23 13:05:02,272 INFO L256 TraceCheckUtils]: 3: Hoare triple {325#true} call #t~ret1 := main(); {325#true} is VALID [2018-11-23 13:05:02,276 INFO L273 TraceCheckUtils]: 4: Hoare triple {325#true} ~x~0 := 0; {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:02,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:02,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:02,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:02,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {357#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:02,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {326#false} is VALID [2018-11-23 13:05:02,297 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#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)); {326#false} is VALID [2018-11-23 13:05:02,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#false} ~cond := #in~cond; {326#false} is VALID [2018-11-23 13:05:02,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#false} assume 0 == ~cond; {326#false} is VALID [2018-11-23 13:05:02,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2018-11-23 13:05:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:02,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:02,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:05:02,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:02,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:02,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:05:02,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:05:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:05:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:02,346 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2018-11-23 13:05:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,539 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:05:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:05:02,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:05:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:05:02,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2018-11-23 13:05:02,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:02,587 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:05:02,587 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:05:02,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:05:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:05:02,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:02,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:02,604 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:02,604 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,607 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:05:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:05:02,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,608 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:02,608 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,610 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:05:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:05:02,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:02,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:05:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 13:05:02,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-11-23 13:05:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:02,613 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 13:05:02,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:05:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:05:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:05:02,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:02,614 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:02,615 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:02,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:02,615 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2018-11-23 13:05:02,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:02,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:02,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:02,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:05:02,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:05:02,814 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #37#return; {474#true} is VALID [2018-11-23 13:05:02,815 INFO L256 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret1 := main(); {474#true} is VALID [2018-11-23 13:05:02,815 INFO L273 TraceCheckUtils]: 4: Hoare triple {474#true} ~x~0 := 0; {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:02,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:02,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:02,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:02,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:02,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:02,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {479#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:02,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {479#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {475#false} is VALID [2018-11-23 13:05:02,852 INFO L256 TraceCheckUtils]: 12: Hoare triple {475#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)); {475#false} is VALID [2018-11-23 13:05:02,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 13:05:02,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:05:02,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:05:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:02,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:02,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:02,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:02,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:05:02,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:02,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:05:02,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:05:02,928 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #37#return; {474#true} is VALID [2018-11-23 13:05:02,928 INFO L256 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret1 := main(); {474#true} is VALID [2018-11-23 13:05:02,928 INFO L273 TraceCheckUtils]: 4: Hoare triple {474#true} ~x~0 := 0; {474#true} is VALID [2018-11-23 13:05:02,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 268435455); {474#true} is VALID [2018-11-23 13:05:02,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {474#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {474#true} is VALID [2018-11-23 13:05:02,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 268435455); {474#true} is VALID [2018-11-23 13:05:02,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {474#true} is VALID [2018-11-23 13:05:02,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 268435455); {474#true} is VALID [2018-11-23 13:05:02,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {474#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {513#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2018-11-23 13:05:02,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {475#false} is VALID [2018-11-23 13:05:02,935 INFO L256 TraceCheckUtils]: 12: Hoare triple {475#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)); {475#false} is VALID [2018-11-23 13:05:02,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 13:05:02,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:05:02,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:05:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:05:02,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:05:02,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 13:05:02,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:05:02,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:02,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:05:02,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:02,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:05:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:05:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:05:03,000 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2018-11-23 13:05:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,241 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 13:05:03,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:05:03,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:05:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:05:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:05:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:05:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:05:03,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2018-11-23 13:05:03,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:03,327 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:05:03,327 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:05:03,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:05:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:05:03,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:03,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:05:03,359 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:05:03,359 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:05:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,361 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:05:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:05:03,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,362 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:05:03,362 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:05:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,364 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:05:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:05:03,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:03,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:05:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 13:05:03,367 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2018-11-23 13:05:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:03,367 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 13:05:03,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:05:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 13:05:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:05:03,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:03,368 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:03,369 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:03,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1988642215, now seen corresponding path program 1 times [2018-11-23 13:05:03,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:03,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:03,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,862 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:05:03,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:05:03,863 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #37#return; {651#true} is VALID [2018-11-23 13:05:03,864 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := main(); {651#true} is VALID [2018-11-23 13:05:03,869 INFO L273 TraceCheckUtils]: 4: Hoare triple {651#true} ~x~0 := 0; {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:03,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:03,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:03,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:03,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:03,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:03,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {658#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:03,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {658#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {652#false} is VALID [2018-11-23 13:05:03,881 INFO L256 TraceCheckUtils]: 16: Hoare triple {652#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)); {652#false} is VALID [2018-11-23 13:05:03,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:05:03,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:05:03,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:05:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:03,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:03,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:04,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:05:04,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:05:04,095 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #37#return; {651#true} is VALID [2018-11-23 13:05:04,095 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := main(); {651#true} is VALID [2018-11-23 13:05:04,100 INFO L273 TraceCheckUtils]: 4: Hoare triple {651#true} ~x~0 := 0; {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:04,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:04,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:04,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:04,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:04,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:04,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:04,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:04,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:04,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:04,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {652#false} is VALID [2018-11-23 13:05:04,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {652#false} assume !(~x~0 % 4294967296 < 268435455); {652#false} is VALID [2018-11-23 13:05:04,112 INFO L256 TraceCheckUtils]: 16: Hoare triple {652#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)); {652#false} is VALID [2018-11-23 13:05:04,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:05:04,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:05:04,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:05:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:04,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:04,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-11-23 13:05:04,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:05:04,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:04,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:05:04,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:04,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:05:04,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:05:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:04,177 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-11-23 13:05:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,632 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:05:04,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:05:04,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:05:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 13:05:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 13:05:04,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2018-11-23 13:05:04,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:04,699 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:05:04,699 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:05:04,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:05:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:05:04,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:04,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:04,729 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:04,730 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,732 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:05:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:05:04,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,733 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:04,733 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,735 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:05:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:05:04,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:04,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:05:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 13:05:04,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2018-11-23 13:05:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:04,738 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 13:05:04,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:05:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:05:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:05:04,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:04,739 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:04,740 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:04,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:04,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1105955487, now seen corresponding path program 2 times [2018-11-23 13:05:04,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:04,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:04,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:04,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:05,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2018-11-23 13:05:05,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {858#true} assume true; {858#true} is VALID [2018-11-23 13:05:05,438 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {858#true} {858#true} #37#return; {858#true} is VALID [2018-11-23 13:05:05,438 INFO L256 TraceCheckUtils]: 3: Hoare triple {858#true} call #t~ret1 := main(); {858#true} is VALID [2018-11-23 13:05:05,439 INFO L273 TraceCheckUtils]: 4: Hoare triple {858#true} ~x~0 := 0; {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:05,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:05,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:05,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:05,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:05,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:05,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:05,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:05,447 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:05,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:05,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:05,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:05,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:05,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:05,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {867#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:05,454 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {859#false} is VALID [2018-11-23 13:05:05,455 INFO L256 TraceCheckUtils]: 20: Hoare triple {859#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)); {859#false} is VALID [2018-11-23 13:05:05,455 INFO L273 TraceCheckUtils]: 21: Hoare triple {859#false} ~cond := #in~cond; {859#false} is VALID [2018-11-23 13:05:05,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {859#false} assume 0 == ~cond; {859#false} is VALID [2018-11-23 13:05:05,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {859#false} assume !false; {859#false} is VALID [2018-11-23 13:05:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:05,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:05,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:05,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:05,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:05,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:05,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:05,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2018-11-23 13:05:05,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {858#true} assume true; {858#true} is VALID [2018-11-23 13:05:05,601 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {858#true} {858#true} #37#return; {858#true} is VALID [2018-11-23 13:05:05,602 INFO L256 TraceCheckUtils]: 3: Hoare triple {858#true} call #t~ret1 := main(); {858#true} is VALID [2018-11-23 13:05:05,602 INFO L273 TraceCheckUtils]: 4: Hoare triple {858#true} ~x~0 := 0; {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:05,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:05,603 INFO L273 TraceCheckUtils]: 6: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:05,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:05,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:05,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:05,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:05,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:05,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:05,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:05,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:05,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:05,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:05,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:05,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {925#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:05,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {925#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 268435455); {859#false} is VALID [2018-11-23 13:05:05,619 INFO L256 TraceCheckUtils]: 20: Hoare triple {859#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)); {859#false} is VALID [2018-11-23 13:05:05,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {859#false} ~cond := #in~cond; {859#false} is VALID [2018-11-23 13:05:05,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {859#false} assume 0 == ~cond; {859#false} is VALID [2018-11-23 13:05:05,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {859#false} assume !false; {859#false} is VALID [2018-11-23 13:05:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:05,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:05,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:05:05,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:05:05,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:05,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:05:05,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:05,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:05:05,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:05:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:05,710 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-11-23 13:05:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,263 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:05:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:05:06,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:05:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 13:05:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 13:05:06,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 13:05:06,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:06,335 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:05:06,335 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:05:06,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:05:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:05:06,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:06,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:05:06,376 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:05:06,377 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:05:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,379 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:05:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:05:06,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:06,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:06,380 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:05:06,380 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:05:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,382 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:05:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:05:06,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:06,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:06,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:06,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 13:05:06,384 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-23 13:05:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:06,385 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 13:05:06,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:05:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:05:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:05:06,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:06,386 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:06,386 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:06,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash 3029019, now seen corresponding path program 3 times [2018-11-23 13:05:06,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:06,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:06,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:06,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:06,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2018-11-23 13:05:07,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2018-11-23 13:05:07,001 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #37#return; {1100#true} is VALID [2018-11-23 13:05:07,001 INFO L256 TraceCheckUtils]: 3: Hoare triple {1100#true} call #t~ret1 := main(); {1100#true} is VALID [2018-11-23 13:05:07,002 INFO L273 TraceCheckUtils]: 4: Hoare triple {1100#true} ~x~0 := 0; {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:07,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:07,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:07,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:07,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:07,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:07,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:07,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:07,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:07,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:07,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:07,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:07,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:07,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:07,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:07,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:07,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:07,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:07,032 INFO L273 TraceCheckUtils]: 22: Hoare triple {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1111#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:07,032 INFO L273 TraceCheckUtils]: 23: Hoare triple {1111#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1101#false} is VALID [2018-11-23 13:05:07,033 INFO L256 TraceCheckUtils]: 24: Hoare triple {1101#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)); {1101#false} is VALID [2018-11-23 13:05:07,033 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2018-11-23 13:05:07,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2018-11-23 13:05:07,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2018-11-23 13:05:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:07,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:07,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:07,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:07,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:05:07,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:07,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2018-11-23 13:05:07,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2018-11-23 13:05:07,169 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #37#return; {1100#true} is VALID [2018-11-23 13:05:07,169 INFO L256 TraceCheckUtils]: 3: Hoare triple {1100#true} call #t~ret1 := main(); {1100#true} is VALID [2018-11-23 13:05:07,169 INFO L273 TraceCheckUtils]: 4: Hoare triple {1100#true} ~x~0 := 0; {1100#true} is VALID [2018-11-23 13:05:07,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:05:07,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:05:07,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:05:07,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:05:07,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:05:07,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:05:07,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:05:07,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:05:07,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:05:07,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:05:07,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:05:07,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:05:07,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:05:07,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:05:07,173 INFO L273 TraceCheckUtils]: 19: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:05:07,174 INFO L273 TraceCheckUtils]: 20: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2018-11-23 13:05:07,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2018-11-23 13:05:07,175 INFO L273 TraceCheckUtils]: 22: Hoare triple {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1182#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2018-11-23 13:05:07,176 INFO L273 TraceCheckUtils]: 23: Hoare triple {1182#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {1101#false} is VALID [2018-11-23 13:05:07,176 INFO L256 TraceCheckUtils]: 24: Hoare triple {1101#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)); {1101#false} is VALID [2018-11-23 13:05:07,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2018-11-23 13:05:07,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2018-11-23 13:05:07,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2018-11-23 13:05:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 13:05:07,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:07,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-11-23 13:05:07,199 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:05:07,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:07,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:05:07,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:07,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:05:07,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:05:07,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:07,275 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2018-11-23 13:05:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,566 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 13:05:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:05:08,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:05:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2018-11-23 13:05:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2018-11-23 13:05:08,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 53 transitions. [2018-11-23 13:05:10,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:10,809 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:05:10,809 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:05:10,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:05:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-23 13:05:10,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:10,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-23 13:05:10,892 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-23 13:05:10,893 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-23 13:05:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,898 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 13:05:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:05:10,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:10,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:10,899 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-23 13:05:10,899 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-23 13:05:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,901 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 13:05:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:05:10,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:10,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:10,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:10,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:05:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 13:05:10,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2018-11-23 13:05:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:10,905 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 13:05:10,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:05:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:05:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:05:10,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:10,906 INFO L402 BasicCegarLoop]: trace histogram [12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:10,907 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:10,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:10,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1686757776, now seen corresponding path program 4 times [2018-11-23 13:05:10,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:10,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {1401#true} call ULTIMATE.init(); {1401#true} is VALID [2018-11-23 13:05:12,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2018-11-23 13:05:12,327 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #37#return; {1401#true} is VALID [2018-11-23 13:05:12,327 INFO L256 TraceCheckUtils]: 3: Hoare triple {1401#true} call #t~ret1 := main(); {1401#true} is VALID [2018-11-23 13:05:12,330 INFO L273 TraceCheckUtils]: 4: Hoare triple {1401#true} ~x~0 := 0; {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:12,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:12,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:12,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:12,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:12,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:12,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:12,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:12,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:12,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:12,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:12,343 INFO L273 TraceCheckUtils]: 15: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:12,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:12,344 INFO L273 TraceCheckUtils]: 17: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:12,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:12,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:12,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:12,393 INFO L273 TraceCheckUtils]: 21: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:12,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:12,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:12,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:12,439 INFO L273 TraceCheckUtils]: 25: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:12,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:12,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:12,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1415#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:12,487 INFO L273 TraceCheckUtils]: 29: Hoare triple {1415#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1402#false} is VALID [2018-11-23 13:05:12,487 INFO L256 TraceCheckUtils]: 30: Hoare triple {1402#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)); {1402#false} is VALID [2018-11-23 13:05:12,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {1402#false} ~cond := #in~cond; {1402#false} is VALID [2018-11-23 13:05:12,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {1402#false} assume 0 == ~cond; {1402#false} is VALID [2018-11-23 13:05:12,488 INFO L273 TraceCheckUtils]: 33: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2018-11-23 13:05:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:12,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:12,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:12,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:12,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:12,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:12,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {1401#true} call ULTIMATE.init(); {1401#true} is VALID [2018-11-23 13:05:12,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2018-11-23 13:05:12,676 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #37#return; {1401#true} is VALID [2018-11-23 13:05:12,676 INFO L256 TraceCheckUtils]: 3: Hoare triple {1401#true} call #t~ret1 := main(); {1401#true} is VALID [2018-11-23 13:05:12,677 INFO L273 TraceCheckUtils]: 4: Hoare triple {1401#true} ~x~0 := 0; {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:12,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:12,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:12,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:12,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:12,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:12,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:12,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:12,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:12,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:12,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:12,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:12,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:12,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:12,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:12,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:12,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:12,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:12,690 INFO L273 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:12,691 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:12,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:12,694 INFO L273 TraceCheckUtils]: 25: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:12,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1402#false} is VALID [2018-11-23 13:05:12,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {1402#false} assume !!(~x~0 % 4294967296 < 268435455); {1402#false} is VALID [2018-11-23 13:05:12,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {1402#false} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1402#false} is VALID [2018-11-23 13:05:12,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {1402#false} assume !(~x~0 % 4294967296 < 268435455); {1402#false} is VALID [2018-11-23 13:05:12,697 INFO L256 TraceCheckUtils]: 30: Hoare triple {1402#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)); {1402#false} is VALID [2018-11-23 13:05:12,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {1402#false} ~cond := #in~cond; {1402#false} is VALID [2018-11-23 13:05:12,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {1402#false} assume 0 == ~cond; {1402#false} is VALID [2018-11-23 13:05:12,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2018-11-23 13:05:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:05:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:12,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 15 [2018-11-23 13:05:12,728 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:05:12,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:12,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:05:12,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:12,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:05:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:05:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:12,796 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 15 states. [2018-11-23 13:05:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,764 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 13:05:13,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:05:13,764 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:05:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2018-11-23 13:05:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2018-11-23 13:05:13,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2018-11-23 13:05:13,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:13,819 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:05:13,819 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:05:13,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:05:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:05:13,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:13,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 13:05:13,861 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:05:13,862 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:05:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,863 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:05:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:05:13,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,864 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:05:13,864 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:05:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,866 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:05:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:05:13,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:13,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:05:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 13:05:13,868 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2018-11-23 13:05:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:13,869 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 13:05:13,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:05:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:05:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:05:13,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:13,870 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:13,870 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:13,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:13,871 INFO L82 PathProgramCache]: Analyzing trace with hash 419627978, now seen corresponding path program 5 times [2018-11-23 13:05:13,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:13,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:13,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:13,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1730#true} is VALID [2018-11-23 13:05:14,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {1730#true} assume true; {1730#true} is VALID [2018-11-23 13:05:14,623 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1730#true} {1730#true} #37#return; {1730#true} is VALID [2018-11-23 13:05:14,623 INFO L256 TraceCheckUtils]: 3: Hoare triple {1730#true} call #t~ret1 := main(); {1730#true} is VALID [2018-11-23 13:05:14,624 INFO L273 TraceCheckUtils]: 4: Hoare triple {1730#true} ~x~0 := 0; {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:14,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:14,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,629 INFO L273 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:14,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:14,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:14,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:14,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,636 INFO L273 TraceCheckUtils]: 18: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:14,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:14,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:14,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:14,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:14,660 INFO L273 TraceCheckUtils]: 27: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:14,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,662 INFO L273 TraceCheckUtils]: 29: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,662 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:14,663 INFO L273 TraceCheckUtils]: 31: Hoare triple {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:14,663 INFO L273 TraceCheckUtils]: 32: Hoare triple {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1746#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:14,664 INFO L273 TraceCheckUtils]: 33: Hoare triple {1746#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1731#false} is VALID [2018-11-23 13:05:14,664 INFO L256 TraceCheckUtils]: 34: Hoare triple {1731#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)); {1731#false} is VALID [2018-11-23 13:05:14,664 INFO L273 TraceCheckUtils]: 35: Hoare triple {1731#false} ~cond := #in~cond; {1731#false} is VALID [2018-11-23 13:05:14,664 INFO L273 TraceCheckUtils]: 36: Hoare triple {1731#false} assume 0 == ~cond; {1731#false} is VALID [2018-11-23 13:05:14,665 INFO L273 TraceCheckUtils]: 37: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2018-11-23 13:05:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:14,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:14,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:14,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:29,494 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-23 13:06:29,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:30,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:31,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1730#true} is VALID [2018-11-23 13:06:31,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {1730#true} assume true; {1730#true} is VALID [2018-11-23 13:06:31,149 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1730#true} {1730#true} #37#return; {1730#true} is VALID [2018-11-23 13:06:31,150 INFO L256 TraceCheckUtils]: 3: Hoare triple {1730#true} call #t~ret1 := main(); {1730#true} is VALID [2018-11-23 13:06:31,150 INFO L273 TraceCheckUtils]: 4: Hoare triple {1730#true} ~x~0 := 0; {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:31,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:31,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:31,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:31,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:31,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:31,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:31,155 INFO L273 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:31,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:31,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:31,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:31,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:31,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:31,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:31,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:31,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:31,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:31,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:31,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:31,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:31,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:31,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:31,170 INFO L273 TraceCheckUtils]: 26: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:31,171 INFO L273 TraceCheckUtils]: 27: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:31,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:31,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:31,175 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1731#false} is VALID [2018-11-23 13:06:31,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {1731#false} assume !!(~x~0 % 4294967296 < 268435455); {1731#false} is VALID [2018-11-23 13:06:31,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {1731#false} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1731#false} is VALID [2018-11-23 13:06:31,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {1731#false} assume !(~x~0 % 4294967296 < 268435455); {1731#false} is VALID [2018-11-23 13:06:31,176 INFO L256 TraceCheckUtils]: 34: Hoare triple {1731#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)); {1731#false} is VALID [2018-11-23 13:06:31,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {1731#false} ~cond := #in~cond; {1731#false} is VALID [2018-11-23 13:06:31,176 INFO L273 TraceCheckUtils]: 36: Hoare triple {1731#false} assume 0 == ~cond; {1731#false} is VALID [2018-11-23 13:06:31,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2018-11-23 13:06:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:06:31,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:31,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 17 [2018-11-23 13:06:31,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:06:31,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:31,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:06:31,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:31,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:06:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:06:31,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:06:31,240 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 17 states. [2018-11-23 13:06:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:32,509 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-23 13:06:32,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:06:32,509 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:06:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2018-11-23 13:06:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2018-11-23 13:06:32,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 51 transitions. [2018-11-23 13:06:32,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:32,571 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:06:32,571 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:06:32,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:06:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:06:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 13:06:32,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:32,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 13:06:32,619 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 13:06:32,620 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 13:06:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:32,622 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:06:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:06:32,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:32,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:32,623 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 13:06:32,623 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 13:06:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:32,624 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:06:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:06:32,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:32,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:32,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:32,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:06:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 13:06:32,627 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2018-11-23 13:06:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:32,627 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 13:06:32,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:06:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:06:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:06:32,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:32,628 INFO L402 BasicCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:32,628 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:32,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash -884180732, now seen corresponding path program 6 times [2018-11-23 13:06:32,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:32,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:32,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:33,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2018-11-23 13:06:33,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {2093#true} assume true; {2093#true} is VALID [2018-11-23 13:06:33,180 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2093#true} {2093#true} #37#return; {2093#true} is VALID [2018-11-23 13:06:33,180 INFO L256 TraceCheckUtils]: 3: Hoare triple {2093#true} call #t~ret1 := main(); {2093#true} is VALID [2018-11-23 13:06:33,180 INFO L273 TraceCheckUtils]: 4: Hoare triple {2093#true} ~x~0 := 0; {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:33,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:33,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:33,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:33,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:33,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:33,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:33,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:33,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:33,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:33,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:33,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:33,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:33,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:33,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:33,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:33,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:33,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:33,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:33,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:33,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:33,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:33,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:33,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:33,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:33,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:33,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:33,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:33,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:33,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:33,206 INFO L273 TraceCheckUtils]: 34: Hoare triple {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:33,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:33,207 INFO L273 TraceCheckUtils]: 36: Hoare triple {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2111#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:33,208 INFO L273 TraceCheckUtils]: 37: Hoare triple {2111#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2094#false} is VALID [2018-11-23 13:06:33,209 INFO L256 TraceCheckUtils]: 38: Hoare triple {2094#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)); {2094#false} is VALID [2018-11-23 13:06:33,209 INFO L273 TraceCheckUtils]: 39: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2018-11-23 13:06:33,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2018-11-23 13:06:33,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2018-11-23 13:06:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:33,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:33,212 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:06:33,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:06:33,263 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 13:06:33,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:33,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:33,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2018-11-23 13:06:33,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {2093#true} assume true; {2093#true} is VALID [2018-11-23 13:06:33,423 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2093#true} {2093#true} #37#return; {2093#true} is VALID [2018-11-23 13:06:33,423 INFO L256 TraceCheckUtils]: 3: Hoare triple {2093#true} call #t~ret1 := main(); {2093#true} is VALID [2018-11-23 13:06:33,423 INFO L273 TraceCheckUtils]: 4: Hoare triple {2093#true} ~x~0 := 0; {2093#true} is VALID [2018-11-23 13:06:33,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,425 INFO L273 TraceCheckUtils]: 19: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,426 INFO L273 TraceCheckUtils]: 22: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,427 INFO L273 TraceCheckUtils]: 27: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,427 INFO L273 TraceCheckUtils]: 30: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:06:33,427 INFO L273 TraceCheckUtils]: 31: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:06:33,428 INFO L273 TraceCheckUtils]: 32: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2018-11-23 13:06:33,429 INFO L273 TraceCheckUtils]: 33: Hoare triple {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2018-11-23 13:06:33,429 INFO L273 TraceCheckUtils]: 34: Hoare triple {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2218#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2018-11-23 13:06:33,430 INFO L273 TraceCheckUtils]: 35: Hoare triple {2218#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {2218#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2018-11-23 13:06:33,431 INFO L273 TraceCheckUtils]: 36: Hoare triple {2218#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2225#(< (mod (+ main_~x~0 4294967291) 4294967296) 65521)} is VALID [2018-11-23 13:06:33,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {2225#(< (mod (+ main_~x~0 4294967291) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {2094#false} is VALID [2018-11-23 13:06:33,432 INFO L256 TraceCheckUtils]: 38: Hoare triple {2094#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)); {2094#false} is VALID [2018-11-23 13:06:33,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2018-11-23 13:06:33,432 INFO L273 TraceCheckUtils]: 40: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2018-11-23 13:06:33,433 INFO L273 TraceCheckUtils]: 41: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2018-11-23 13:06:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 13:06:33,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:33,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2018-11-23 13:06:33,456 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 13:06:33,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:33,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:06:33,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:33,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:06:33,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:06:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:06:33,520 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 22 states. [2018-11-23 13:06:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:38,643 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 13:06:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:06:38,644 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 13:06:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:06:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2018-11-23 13:06:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:06:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2018-11-23 13:06:38,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 74 transitions. [2018-11-23 13:06:43,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:43,918 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:06:43,918 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 13:06:43,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:06:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 13:06:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-11-23 13:06:43,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:43,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 49 states. [2018-11-23 13:06:43,993 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 49 states. [2018-11-23 13:06:43,993 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 49 states. [2018-11-23 13:06:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:43,995 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 13:06:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-23 13:06:43,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:43,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:43,996 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 56 states. [2018-11-23 13:06:43,996 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 56 states. [2018-11-23 13:06:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:43,998 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 13:06:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-23 13:06:43,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:43,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:43,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:43,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:06:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-23 13:06:44,000 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 42 [2018-11-23 13:06:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:44,000 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-23 13:06:44,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:06:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 13:06:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:06:44,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:44,001 INFO L402 BasicCegarLoop]: trace histogram [19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:44,001 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:44,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:44,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1168417095, now seen corresponding path program 7 times [2018-11-23 13:06:44,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:44,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:44,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:44,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:44,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2018-11-23 13:06:44,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {2536#true} assume true; {2536#true} is VALID [2018-11-23 13:06:44,774 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2536#true} {2536#true} #37#return; {2536#true} is VALID [2018-11-23 13:06:44,774 INFO L256 TraceCheckUtils]: 3: Hoare triple {2536#true} call #t~ret1 := main(); {2536#true} is VALID [2018-11-23 13:06:44,775 INFO L273 TraceCheckUtils]: 4: Hoare triple {2536#true} ~x~0 := 0; {2538#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:44,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {2538#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2538#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:44,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {2538#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2539#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:44,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {2539#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2539#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:44,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {2539#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:44,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {2540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:44,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {2540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2541#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:44,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {2541#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2541#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:44,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {2541#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2542#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:44,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {2542#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2542#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:44,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {2542#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2543#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:44,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {2543#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2543#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:44,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {2543#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2544#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:44,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {2544#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2544#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:44,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {2544#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2545#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:44,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {2545#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2545#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:44,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {2545#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2546#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:44,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {2546#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2546#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:44,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {2546#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2547#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:44,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2547#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:44,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {2547#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2548#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:44,830 INFO L273 TraceCheckUtils]: 25: Hoare triple {2548#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2548#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:44,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {2548#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2549#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:44,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {2549#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2549#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:44,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {2549#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2550#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:44,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {2550#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2550#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:44,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {2550#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2551#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:44,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {2551#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2551#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:44,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {2551#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2552#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:44,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {2552#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2552#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:44,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {2552#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2553#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:44,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {2553#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {2553#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:44,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {2553#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:44,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {2554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:44,856 INFO L273 TraceCheckUtils]: 38: Hoare triple {2554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:44,857 INFO L273 TraceCheckUtils]: 39: Hoare triple {2555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:44,857 INFO L273 TraceCheckUtils]: 40: Hoare triple {2555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2556#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:44,858 INFO L273 TraceCheckUtils]: 41: Hoare triple {2556#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {2556#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:44,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {2556#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2557#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:44,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {2557#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2537#false} is VALID [2018-11-23 13:06:44,860 INFO L256 TraceCheckUtils]: 44: Hoare triple {2537#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)); {2537#false} is VALID [2018-11-23 13:06:44,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {2537#false} ~cond := #in~cond; {2537#false} is VALID [2018-11-23 13:06:44,861 INFO L273 TraceCheckUtils]: 46: Hoare triple {2537#false} assume 0 == ~cond; {2537#false} is VALID [2018-11-23 13:06:44,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2018-11-23 13:06:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:44,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:44,865 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:06:44,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:44,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:45,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2018-11-23 13:06:45,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {2536#true} assume true; {2536#true} is VALID [2018-11-23 13:06:45,049 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2536#true} {2536#true} #37#return; {2536#true} is VALID [2018-11-23 13:06:45,050 INFO L256 TraceCheckUtils]: 3: Hoare triple {2536#true} call #t~ret1 := main(); {2536#true} is VALID [2018-11-23 13:06:45,050 INFO L273 TraceCheckUtils]: 4: Hoare triple {2536#true} ~x~0 := 0; {2538#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:45,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {2538#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2538#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:45,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {2538#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2539#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:45,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {2539#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2539#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:45,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {2539#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:45,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {2540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:45,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {2540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2541#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:45,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {2541#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2541#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:45,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {2541#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2542#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:45,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {2542#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2542#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:45,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {2542#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2543#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:45,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {2543#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2543#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:45,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {2543#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2544#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:45,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {2544#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2544#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:45,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {2544#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2545#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:45,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {2545#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2545#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:45,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {2545#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2546#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:45,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {2546#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2546#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:45,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {2546#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2547#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:45,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2547#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:45,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {2547#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2548#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:45,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {2548#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2548#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:45,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {2548#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2549#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:45,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {2549#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2549#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:45,069 INFO L273 TraceCheckUtils]: 28: Hoare triple {2549#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2550#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:45,070 INFO L273 TraceCheckUtils]: 29: Hoare triple {2550#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2550#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:45,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {2550#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2551#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:45,071 INFO L273 TraceCheckUtils]: 31: Hoare triple {2551#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2551#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:45,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {2551#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2552#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:45,073 INFO L273 TraceCheckUtils]: 33: Hoare triple {2552#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2552#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:45,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {2552#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2553#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:45,075 INFO L273 TraceCheckUtils]: 35: Hoare triple {2553#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {2553#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:45,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {2553#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:45,076 INFO L273 TraceCheckUtils]: 37: Hoare triple {2554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:45,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {2554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2537#false} is VALID [2018-11-23 13:06:45,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {2537#false} assume !!(~x~0 % 4294967296 < 268435455); {2537#false} is VALID [2018-11-23 13:06:45,078 INFO L273 TraceCheckUtils]: 40: Hoare triple {2537#false} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2537#false} is VALID [2018-11-23 13:06:45,078 INFO L273 TraceCheckUtils]: 41: Hoare triple {2537#false} assume !!(~x~0 % 4294967296 < 268435455); {2537#false} is VALID [2018-11-23 13:06:45,078 INFO L273 TraceCheckUtils]: 42: Hoare triple {2537#false} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2537#false} is VALID [2018-11-23 13:06:45,079 INFO L273 TraceCheckUtils]: 43: Hoare triple {2537#false} assume !(~x~0 % 4294967296 < 268435455); {2537#false} is VALID [2018-11-23 13:06:45,079 INFO L256 TraceCheckUtils]: 44: Hoare triple {2537#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)); {2537#false} is VALID [2018-11-23 13:06:45,079 INFO L273 TraceCheckUtils]: 45: Hoare triple {2537#false} ~cond := #in~cond; {2537#false} is VALID [2018-11-23 13:06:45,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {2537#false} assume 0 == ~cond; {2537#false} is VALID [2018-11-23 13:06:45,079 INFO L273 TraceCheckUtils]: 47: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2018-11-23 13:06:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 85 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:06:45,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:45,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 22 [2018-11-23 13:06:45,102 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:06:45,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:45,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:06:45,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:45,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:06:45,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:06:45,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:06:45,161 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 22 states. [2018-11-23 13:06:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,212 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 13:06:47,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:06:47,213 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:06:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:06:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-11-23 13:06:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:06:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-11-23 13:06:47,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2018-11-23 13:06:47,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:47,286 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:06:47,287 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 13:06:47,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:06:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 13:06:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 13:06:47,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:47,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 13:06:47,343 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:06:47,343 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:06:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,345 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 13:06:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 13:06:47,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:47,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:47,346 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:06:47,346 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:06:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,347 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 13:06:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 13:06:47,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:47,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:47,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:47,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:06:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-11-23 13:06:47,350 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 48 [2018-11-23 13:06:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:47,350 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-23 13:06:47,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:06:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 13:06:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:06:47,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:47,351 INFO L402 BasicCegarLoop]: trace histogram [21, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:47,351 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:47,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 652678003, now seen corresponding path program 8 times [2018-11-23 13:06:47,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:47,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:47,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:47,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:47,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {2987#true} call ULTIMATE.init(); {2987#true} is VALID [2018-11-23 13:06:47,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {2987#true} assume true; {2987#true} is VALID [2018-11-23 13:06:47,891 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2987#true} {2987#true} #37#return; {2987#true} is VALID [2018-11-23 13:06:47,891 INFO L256 TraceCheckUtils]: 3: Hoare triple {2987#true} call #t~ret1 := main(); {2987#true} is VALID [2018-11-23 13:06:47,892 INFO L273 TraceCheckUtils]: 4: Hoare triple {2987#true} ~x~0 := 0; {2989#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:47,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {2989#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2989#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:47,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {2989#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2990#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:47,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {2990#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2990#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:47,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {2990#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:47,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {2991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:47,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {2991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:47,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {2992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:47,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {2992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2993#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:47,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {2993#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2993#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:47,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {2993#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:47,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {2994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:47,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {2994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:47,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {2995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:47,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {2995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:47,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {2996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:47,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {2996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2997#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:47,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {2997#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2997#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:47,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {2997#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2998#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:47,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {2998#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2998#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:47,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {2998#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:47,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {2999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:47,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {2999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3000#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:47,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {3000#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {3000#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:47,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {3000#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:47,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {3001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:47,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {3001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3002#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:47,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {3002#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3002#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:47,915 INFO L273 TraceCheckUtils]: 32: Hoare triple {3002#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3003#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:47,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {3003#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3003#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:47,916 INFO L273 TraceCheckUtils]: 34: Hoare triple {3003#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3004#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:47,917 INFO L273 TraceCheckUtils]: 35: Hoare triple {3004#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {3004#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:47,918 INFO L273 TraceCheckUtils]: 36: Hoare triple {3004#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3005#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:47,919 INFO L273 TraceCheckUtils]: 37: Hoare triple {3005#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3005#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:47,920 INFO L273 TraceCheckUtils]: 38: Hoare triple {3005#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3006#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:06:47,920 INFO L273 TraceCheckUtils]: 39: Hoare triple {3006#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3006#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:06:47,921 INFO L273 TraceCheckUtils]: 40: Hoare triple {3006#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3007#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:47,922 INFO L273 TraceCheckUtils]: 41: Hoare triple {3007#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3007#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:47,923 INFO L273 TraceCheckUtils]: 42: Hoare triple {3007#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3008#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:47,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {3008#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3008#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:47,925 INFO L273 TraceCheckUtils]: 44: Hoare triple {3008#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3009#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:47,925 INFO L273 TraceCheckUtils]: 45: Hoare triple {3009#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3009#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:47,927 INFO L273 TraceCheckUtils]: 46: Hoare triple {3009#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3010#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:47,928 INFO L273 TraceCheckUtils]: 47: Hoare triple {3010#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2988#false} is VALID [2018-11-23 13:06:47,928 INFO L256 TraceCheckUtils]: 48: Hoare triple {2988#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)); {2988#false} is VALID [2018-11-23 13:06:47,928 INFO L273 TraceCheckUtils]: 49: Hoare triple {2988#false} ~cond := #in~cond; {2988#false} is VALID [2018-11-23 13:06:47,928 INFO L273 TraceCheckUtils]: 50: Hoare triple {2988#false} assume 0 == ~cond; {2988#false} is VALID [2018-11-23 13:06:47,928 INFO L273 TraceCheckUtils]: 51: Hoare triple {2988#false} assume !false; {2988#false} is VALID [2018-11-23 13:06:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:47,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:47,936 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:06:47,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:47,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:47,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:47,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {2987#true} call ULTIMATE.init(); {2987#true} is VALID [2018-11-23 13:06:48,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {2987#true} assume true; {2987#true} is VALID [2018-11-23 13:06:48,375 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2987#true} {2987#true} #37#return; {2987#true} is VALID [2018-11-23 13:06:48,375 INFO L256 TraceCheckUtils]: 3: Hoare triple {2987#true} call #t~ret1 := main(); {2987#true} is VALID [2018-11-23 13:06:48,375 INFO L273 TraceCheckUtils]: 4: Hoare triple {2987#true} ~x~0 := 0; {2989#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:48,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {2989#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2989#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:48,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {2989#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2990#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:48,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {2990#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2990#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:48,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {2990#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:48,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {2991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:48,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {2991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:48,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {2992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:48,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {2992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2993#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:48,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {2993#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2993#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:48,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {2993#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:48,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {2994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:48,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {2994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:48,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {2995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:48,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {2995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:48,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {2996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:48,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {2996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2997#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:48,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {2997#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2997#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:48,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {2997#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2998#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:48,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {2998#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2998#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:48,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {2998#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:48,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {2999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:48,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {2999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3000#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:48,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {3000#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {3000#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:48,621 INFO L273 TraceCheckUtils]: 28: Hoare triple {3000#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:48,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {3001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:48,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {3001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3002#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:48,662 INFO L273 TraceCheckUtils]: 31: Hoare triple {3002#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3002#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:48,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {3002#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3003#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:48,686 INFO L273 TraceCheckUtils]: 33: Hoare triple {3003#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3003#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:48,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {3003#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3004#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:48,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {3004#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {3004#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:48,719 INFO L273 TraceCheckUtils]: 36: Hoare triple {3004#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3005#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:48,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {3005#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3005#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:48,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {3005#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3006#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:06:48,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {3006#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3006#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:06:48,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {3006#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3007#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:48,782 INFO L273 TraceCheckUtils]: 41: Hoare triple {3007#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3007#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:48,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {3007#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3008#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:48,807 INFO L273 TraceCheckUtils]: 43: Hoare triple {3008#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3008#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:48,820 INFO L273 TraceCheckUtils]: 44: Hoare triple {3008#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3009#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:48,835 INFO L273 TraceCheckUtils]: 45: Hoare triple {3009#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3009#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:48,841 INFO L273 TraceCheckUtils]: 46: Hoare triple {3009#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:48,841 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2988#false} is VALID [2018-11-23 13:06:48,842 INFO L256 TraceCheckUtils]: 48: Hoare triple {2988#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)); {2988#false} is VALID [2018-11-23 13:06:48,842 INFO L273 TraceCheckUtils]: 49: Hoare triple {2988#false} ~cond := #in~cond; {2988#false} is VALID [2018-11-23 13:06:48,842 INFO L273 TraceCheckUtils]: 50: Hoare triple {2988#false} assume 0 == ~cond; {2988#false} is VALID [2018-11-23 13:06:48,842 INFO L273 TraceCheckUtils]: 51: Hoare triple {2988#false} assume !false; {2988#false} is VALID [2018-11-23 13:06:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:48,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:48,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:06:48,865 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:06:48,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:48,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:06:48,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:48,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:06:48,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:06:48,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:06:48,929 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 25 states. [2018-11-23 13:06:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:51,633 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 13:06:51,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:06:51,633 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:06:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:06:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-11-23 13:06:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:06:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-11-23 13:06:51,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 63 transitions. [2018-11-23 13:06:51,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:51,707 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:06:51,708 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:06:51,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:06:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:06:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 13:06:51,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:51,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 13:06:51,777 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 13:06:51,777 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 13:06:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:51,778 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-11-23 13:06:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 13:06:51,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:51,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:51,779 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 13:06:51,779 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 13:06:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:51,780 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-11-23 13:06:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 13:06:51,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:51,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:51,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:51,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:06:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-11-23 13:06:51,782 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 52 [2018-11-23 13:06:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:51,782 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-11-23 13:06:51,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:06:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 13:06:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:06:51,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:51,783 INFO L402 BasicCegarLoop]: trace histogram [23, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:51,783 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:51,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1219877677, now seen corresponding path program 9 times [2018-11-23 13:06:51,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:51,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:51,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:51,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:51,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:52,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {3473#true} call ULTIMATE.init(); {3473#true} is VALID [2018-11-23 13:06:52,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {3473#true} assume true; {3473#true} is VALID [2018-11-23 13:06:52,585 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3473#true} {3473#true} #37#return; {3473#true} is VALID [2018-11-23 13:06:52,585 INFO L256 TraceCheckUtils]: 3: Hoare triple {3473#true} call #t~ret1 := main(); {3473#true} is VALID [2018-11-23 13:06:52,586 INFO L273 TraceCheckUtils]: 4: Hoare triple {3473#true} ~x~0 := 0; {3475#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:52,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {3475#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3475#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:52,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {3475#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3476#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:52,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {3476#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3476#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:52,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {3476#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3477#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:52,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {3477#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3477#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:52,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {3477#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3478#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:52,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {3478#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3478#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:52,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {3478#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3479#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:52,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {3479#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3479#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:52,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {3479#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3480#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:52,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {3480#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3480#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:52,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {3480#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3481#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:52,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {3481#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3481#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:52,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {3481#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3482#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:52,598 INFO L273 TraceCheckUtils]: 19: Hoare triple {3482#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3482#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:52,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {3482#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3483#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:52,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {3483#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3483#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:52,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {3483#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3484#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:52,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {3484#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {3484#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:52,602 INFO L273 TraceCheckUtils]: 24: Hoare triple {3484#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3485#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:52,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {3485#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3485#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:52,604 INFO L273 TraceCheckUtils]: 26: Hoare triple {3485#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3486#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:52,605 INFO L273 TraceCheckUtils]: 27: Hoare triple {3486#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {3486#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:52,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {3486#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3487#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:52,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {3487#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3487#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:52,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {3487#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3488#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:52,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {3488#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3488#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:52,609 INFO L273 TraceCheckUtils]: 32: Hoare triple {3488#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3489#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:52,610 INFO L273 TraceCheckUtils]: 33: Hoare triple {3489#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3489#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:52,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {3489#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3490#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:52,611 INFO L273 TraceCheckUtils]: 35: Hoare triple {3490#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {3490#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:52,612 INFO L273 TraceCheckUtils]: 36: Hoare triple {3490#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3491#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:52,613 INFO L273 TraceCheckUtils]: 37: Hoare triple {3491#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3491#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:52,618 INFO L273 TraceCheckUtils]: 38: Hoare triple {3491#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3492#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:06:52,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {3492#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3492#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:06:52,619 INFO L273 TraceCheckUtils]: 40: Hoare triple {3492#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3493#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:52,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {3493#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3493#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:52,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {3493#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3494#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:06:52,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {3494#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3494#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:06:52,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {3494#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3495#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:52,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {3495#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3495#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:52,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {3495#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3496#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:52,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {3496#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3496#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:52,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {3496#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3497#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:52,625 INFO L273 TraceCheckUtils]: 49: Hoare triple {3497#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3497#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:52,626 INFO L273 TraceCheckUtils]: 50: Hoare triple {3497#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3498#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:52,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {3498#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3474#false} is VALID [2018-11-23 13:06:52,627 INFO L256 TraceCheckUtils]: 52: Hoare triple {3474#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)); {3474#false} is VALID [2018-11-23 13:06:52,628 INFO L273 TraceCheckUtils]: 53: Hoare triple {3474#false} ~cond := #in~cond; {3474#false} is VALID [2018-11-23 13:06:52,628 INFO L273 TraceCheckUtils]: 54: Hoare triple {3474#false} assume 0 == ~cond; {3474#false} is VALID [2018-11-23 13:06:52,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {3474#false} assume !false; {3474#false} is VALID [2018-11-23 13:06:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:52,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:52,634 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:06:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:52,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 13:06:52,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:52,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:52,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {3473#true} call ULTIMATE.init(); {3473#true} is VALID [2018-11-23 13:06:52,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {3473#true} assume true; {3473#true} is VALID [2018-11-23 13:06:52,858 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3473#true} {3473#true} #37#return; {3473#true} is VALID [2018-11-23 13:06:52,858 INFO L256 TraceCheckUtils]: 3: Hoare triple {3473#true} call #t~ret1 := main(); {3473#true} is VALID [2018-11-23 13:06:52,858 INFO L273 TraceCheckUtils]: 4: Hoare triple {3473#true} ~x~0 := 0; {3473#true} is VALID [2018-11-23 13:06:52,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,862 INFO L273 TraceCheckUtils]: 27: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,862 INFO L273 TraceCheckUtils]: 29: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 32: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 36: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 37: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 38: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 39: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,863 INFO L273 TraceCheckUtils]: 40: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,864 INFO L273 TraceCheckUtils]: 41: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,864 INFO L273 TraceCheckUtils]: 42: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#true} is VALID [2018-11-23 13:06:52,864 INFO L273 TraceCheckUtils]: 43: Hoare triple {3473#true} assume !!(~x~0 % 4294967296 < 268435455); {3473#true} is VALID [2018-11-23 13:06:52,865 INFO L273 TraceCheckUtils]: 44: Hoare triple {3473#true} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3634#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2018-11-23 13:06:52,885 INFO L273 TraceCheckUtils]: 45: Hoare triple {3634#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {3634#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2018-11-23 13:06:52,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {3634#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3641#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2018-11-23 13:06:52,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {3641#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {3641#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2018-11-23 13:06:52,922 INFO L273 TraceCheckUtils]: 48: Hoare triple {3641#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3648#(< (mod (+ main_~x~0 4294967291) 4294967296) 65521)} is VALID [2018-11-23 13:06:52,934 INFO L273 TraceCheckUtils]: 49: Hoare triple {3648#(< (mod (+ main_~x~0 4294967291) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {3648#(< (mod (+ main_~x~0 4294967291) 4294967296) 65521)} is VALID [2018-11-23 13:06:52,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {3648#(< (mod (+ main_~x~0 4294967291) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3655#(< (mod (+ main_~x~0 4294967289) 4294967296) 65521)} is VALID [2018-11-23 13:06:52,955 INFO L273 TraceCheckUtils]: 51: Hoare triple {3655#(< (mod (+ main_~x~0 4294967289) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {3474#false} is VALID [2018-11-23 13:06:52,955 INFO L256 TraceCheckUtils]: 52: Hoare triple {3474#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)); {3474#false} is VALID [2018-11-23 13:06:52,955 INFO L273 TraceCheckUtils]: 53: Hoare triple {3474#false} ~cond := #in~cond; {3474#false} is VALID [2018-11-23 13:06:52,955 INFO L273 TraceCheckUtils]: 54: Hoare triple {3474#false} assume 0 == ~cond; {3474#false} is VALID [2018-11-23 13:06:52,956 INFO L273 TraceCheckUtils]: 55: Hoare triple {3474#false} assume !false; {3474#false} is VALID [2018-11-23 13:06:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 140 proven. 9 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-23 13:06:52,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:52,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 6] total 30 [2018-11-23 13:06:52,980 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:06:52,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:52,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:06:53,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:53,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:06:53,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:06:53,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:06:53,062 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 30 states. [2018-11-23 13:06:55,882 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-23 13:07:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:11,019 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-11-23 13:07:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:07:11,019 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:07:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:07:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 83 transitions. [2018-11-23 13:07:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:07:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 83 transitions. [2018-11-23 13:07:11,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 83 transitions. [2018-11-23 13:07:16,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:16,074 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:07:16,074 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:07:16,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:07:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:07:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-11-23 13:07:16,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:16,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 63 states. [2018-11-23 13:07:16,149 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 63 states. [2018-11-23 13:07:16,149 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 63 states. [2018-11-23 13:07:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:16,151 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-23 13:07:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-11-23 13:07:16,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:16,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:16,152 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 66 states. [2018-11-23 13:07:16,152 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 66 states. [2018-11-23 13:07:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:16,154 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-23 13:07:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-11-23 13:07:16,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:16,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:16,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:16,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:07:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 13:07:16,156 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 56 [2018-11-23 13:07:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:16,156 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 13:07:16,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:07:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 13:07:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:07:16,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:16,158 INFO L402 BasicCegarLoop]: trace histogram [26, 22, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:16,158 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:16,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1395503838, now seen corresponding path program 10 times [2018-11-23 13:07:16,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:16,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:16,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:17,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {4027#true} call ULTIMATE.init(); {4027#true} is VALID [2018-11-23 13:07:17,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {4027#true} assume true; {4027#true} is VALID [2018-11-23 13:07:17,551 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4027#true} {4027#true} #37#return; {4027#true} is VALID [2018-11-23 13:07:17,552 INFO L256 TraceCheckUtils]: 3: Hoare triple {4027#true} call #t~ret1 := main(); {4027#true} is VALID [2018-11-23 13:07:17,552 INFO L273 TraceCheckUtils]: 4: Hoare triple {4027#true} ~x~0 := 0; {4029#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:17,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {4029#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4029#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:17,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {4029#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4030#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:17,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {4030#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4030#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:17,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {4030#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:17,555 INFO L273 TraceCheckUtils]: 9: Hoare triple {4031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:17,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {4031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:17,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {4032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:17,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {4032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4033#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:17,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {4033#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4033#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:17,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {4033#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:17,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {4034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:17,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {4034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4035#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:17,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {4035#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4035#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:17,563 INFO L273 TraceCheckUtils]: 18: Hoare triple {4035#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:17,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {4036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:17,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {4036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4037#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:17,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {4037#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4037#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:17,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {4037#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4038#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:17,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {4038#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {4038#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:17,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {4038#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:17,568 INFO L273 TraceCheckUtils]: 25: Hoare triple {4039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:17,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {4039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4040#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:17,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {4040#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {4040#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:17,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {4040#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:17,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:17,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4042#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:17,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {4042#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4042#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:17,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {4042#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4043#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:17,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {4043#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4043#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:17,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {4043#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4044#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:17,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {4044#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {4044#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:17,578 INFO L273 TraceCheckUtils]: 36: Hoare triple {4044#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4045#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:17,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {4045#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4045#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:17,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {4045#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4046#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:17,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {4046#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4046#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:17,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {4046#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4047#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:17,582 INFO L273 TraceCheckUtils]: 41: Hoare triple {4047#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4047#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:17,583 INFO L273 TraceCheckUtils]: 42: Hoare triple {4047#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4048#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:17,583 INFO L273 TraceCheckUtils]: 43: Hoare triple {4048#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4048#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:17,584 INFO L273 TraceCheckUtils]: 44: Hoare triple {4048#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4049#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:17,585 INFO L273 TraceCheckUtils]: 45: Hoare triple {4049#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4049#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:17,586 INFO L273 TraceCheckUtils]: 46: Hoare triple {4049#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4050#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:07:17,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {4050#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {4050#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:07:17,588 INFO L273 TraceCheckUtils]: 48: Hoare triple {4050#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4051#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:17,588 INFO L273 TraceCheckUtils]: 49: Hoare triple {4051#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4051#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:17,589 INFO L273 TraceCheckUtils]: 50: Hoare triple {4051#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4052#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:17,590 INFO L273 TraceCheckUtils]: 51: Hoare triple {4052#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4052#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:17,591 INFO L273 TraceCheckUtils]: 52: Hoare triple {4052#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4053#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:17,592 INFO L273 TraceCheckUtils]: 53: Hoare triple {4053#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4053#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:17,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {4053#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4054#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:17,593 INFO L273 TraceCheckUtils]: 55: Hoare triple {4054#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4054#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:17,595 INFO L273 TraceCheckUtils]: 56: Hoare triple {4054#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4055#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:17,595 INFO L273 TraceCheckUtils]: 57: Hoare triple {4055#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4028#false} is VALID [2018-11-23 13:07:17,596 INFO L256 TraceCheckUtils]: 58: Hoare triple {4028#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)); {4028#false} is VALID [2018-11-23 13:07:17,596 INFO L273 TraceCheckUtils]: 59: Hoare triple {4028#false} ~cond := #in~cond; {4028#false} is VALID [2018-11-23 13:07:17,596 INFO L273 TraceCheckUtils]: 60: Hoare triple {4028#false} assume 0 == ~cond; {4028#false} is VALID [2018-11-23 13:07:17,596 INFO L273 TraceCheckUtils]: 61: Hoare triple {4028#false} assume !false; {4028#false} is VALID [2018-11-23 13:07:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:17,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:17,605 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:07:17,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:17,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:17,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:17,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:17,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {4027#true} call ULTIMATE.init(); {4027#true} is VALID [2018-11-23 13:07:17,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {4027#true} assume true; {4027#true} is VALID [2018-11-23 13:07:17,933 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4027#true} {4027#true} #37#return; {4027#true} is VALID [2018-11-23 13:07:17,933 INFO L256 TraceCheckUtils]: 3: Hoare triple {4027#true} call #t~ret1 := main(); {4027#true} is VALID [2018-11-23 13:07:17,933 INFO L273 TraceCheckUtils]: 4: Hoare triple {4027#true} ~x~0 := 0; {4029#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:17,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {4029#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4029#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:17,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {4029#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4030#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:17,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {4030#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4030#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:17,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {4030#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:17,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {4031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:17,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {4031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:17,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {4032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:17,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {4032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4033#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:17,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {4033#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4033#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:17,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {4033#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:17,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {4034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:17,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {4034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4035#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:17,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {4035#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4035#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:17,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {4035#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:17,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {4036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:17,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {4036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4037#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:17,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {4037#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4037#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:17,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {4037#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4038#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:17,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {4038#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {4038#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:17,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {4038#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:17,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {4039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:17,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {4039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4040#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:17,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {4040#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {4040#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:17,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {4040#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:17,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:17,973 INFO L273 TraceCheckUtils]: 30: Hoare triple {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4042#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:17,974 INFO L273 TraceCheckUtils]: 31: Hoare triple {4042#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4042#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:17,975 INFO L273 TraceCheckUtils]: 32: Hoare triple {4042#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4043#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:17,975 INFO L273 TraceCheckUtils]: 33: Hoare triple {4043#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4043#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:17,976 INFO L273 TraceCheckUtils]: 34: Hoare triple {4043#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4044#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:17,977 INFO L273 TraceCheckUtils]: 35: Hoare triple {4044#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {4044#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:17,978 INFO L273 TraceCheckUtils]: 36: Hoare triple {4044#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4045#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:17,979 INFO L273 TraceCheckUtils]: 37: Hoare triple {4045#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4045#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:17,980 INFO L273 TraceCheckUtils]: 38: Hoare triple {4045#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4046#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:17,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {4046#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4046#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:17,981 INFO L273 TraceCheckUtils]: 40: Hoare triple {4046#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4047#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:17,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {4047#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4047#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:17,983 INFO L273 TraceCheckUtils]: 42: Hoare triple {4047#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4048#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:17,984 INFO L273 TraceCheckUtils]: 43: Hoare triple {4048#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4048#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:17,985 INFO L273 TraceCheckUtils]: 44: Hoare triple {4048#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4049#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:17,985 INFO L273 TraceCheckUtils]: 45: Hoare triple {4049#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4049#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:17,986 INFO L273 TraceCheckUtils]: 46: Hoare triple {4049#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4050#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:07:17,987 INFO L273 TraceCheckUtils]: 47: Hoare triple {4050#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {4050#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:07:17,988 INFO L273 TraceCheckUtils]: 48: Hoare triple {4050#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4051#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:17,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {4051#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4051#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:17,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {4051#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4028#false} is VALID [2018-11-23 13:07:17,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {4028#false} assume !!(~x~0 % 4294967296 < 268435455); {4028#false} is VALID [2018-11-23 13:07:17,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {4028#false} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4028#false} is VALID [2018-11-23 13:07:17,990 INFO L273 TraceCheckUtils]: 53: Hoare triple {4028#false} assume !!(~x~0 % 4294967296 < 268435455); {4028#false} is VALID [2018-11-23 13:07:17,990 INFO L273 TraceCheckUtils]: 54: Hoare triple {4028#false} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4028#false} is VALID [2018-11-23 13:07:17,991 INFO L273 TraceCheckUtils]: 55: Hoare triple {4028#false} assume !!(~x~0 % 4294967296 < 268435455); {4028#false} is VALID [2018-11-23 13:07:17,991 INFO L273 TraceCheckUtils]: 56: Hoare triple {4028#false} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4028#false} is VALID [2018-11-23 13:07:17,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {4028#false} assume !(~x~0 % 4294967296 < 268435455); {4028#false} is VALID [2018-11-23 13:07:17,991 INFO L256 TraceCheckUtils]: 58: Hoare triple {4028#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)); {4028#false} is VALID [2018-11-23 13:07:17,991 INFO L273 TraceCheckUtils]: 59: Hoare triple {4028#false} ~cond := #in~cond; {4028#false} is VALID [2018-11-23 13:07:17,992 INFO L273 TraceCheckUtils]: 60: Hoare triple {4028#false} assume 0 == ~cond; {4028#false} is VALID [2018-11-23 13:07:17,992 INFO L273 TraceCheckUtils]: 61: Hoare triple {4028#false} assume !false; {4028#false} is VALID [2018-11-23 13:07:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 161 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:07:18,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:18,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 29 [2018-11-23 13:07:18,019 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:07:18,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:18,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:07:18,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:18,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:07:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:07:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:07:18,300 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 29 states. [2018-11-23 13:07:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:21,950 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-23 13:07:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:07:21,950 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:07:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2018-11-23 13:07:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2018-11-23 13:07:21,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2018-11-23 13:07:22,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:22,077 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:07:22,078 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:07:22,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:07:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:07:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 13:07:22,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:22,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 13:07:22,164 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:07:22,164 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:07:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:22,166 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:07:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:07:22,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:22,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:22,167 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:07:22,167 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:07:22,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:22,169 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:07:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:07:22,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:22,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:22,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:22,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:07:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 13:07:22,171 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 62 [2018-11-23 13:07:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:22,172 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 13:07:22,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:07:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:07:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:07:22,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:22,173 INFO L402 BasicCegarLoop]: trace histogram [28, 24, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:22,173 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:22,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1514026076, now seen corresponding path program 11 times [2018-11-23 13:07:22,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:22,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:22,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:23,736 INFO L256 TraceCheckUtils]: 0: Hoare triple {4600#true} call ULTIMATE.init(); {4600#true} is VALID [2018-11-23 13:07:23,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {4600#true} assume true; {4600#true} is VALID [2018-11-23 13:07:23,737 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4600#true} {4600#true} #37#return; {4600#true} is VALID [2018-11-23 13:07:23,737 INFO L256 TraceCheckUtils]: 3: Hoare triple {4600#true} call #t~ret1 := main(); {4600#true} is VALID [2018-11-23 13:07:23,737 INFO L273 TraceCheckUtils]: 4: Hoare triple {4600#true} ~x~0 := 0; {4602#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:23,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {4602#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4602#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:23,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {4602#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4603#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:23,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {4603#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4603#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:23,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {4603#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4604#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:23,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {4604#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4604#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:23,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {4604#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4605#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:23,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {4605#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4605#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:23,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {4605#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4606#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:23,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {4606#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4606#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:23,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {4606#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4607#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:23,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {4607#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4607#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:23,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {4607#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4608#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:23,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {4608#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4608#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:23,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {4608#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4609#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:23,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {4609#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4609#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:23,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {4609#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4610#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:23,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {4610#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4610#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:23,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {4610#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4611#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:23,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {4611#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {4611#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:23,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {4611#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4612#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:23,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {4612#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4612#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:23,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {4612#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4613#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:23,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {4613#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {4613#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:23,756 INFO L273 TraceCheckUtils]: 28: Hoare triple {4613#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4614#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:23,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {4614#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4614#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:23,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {4614#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4615#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:23,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {4615#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4615#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:23,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {4615#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4616#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:23,759 INFO L273 TraceCheckUtils]: 33: Hoare triple {4616#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4616#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:23,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {4616#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4617#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:23,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {4617#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {4617#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:23,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {4617#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4618#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:23,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {4618#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4618#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:23,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {4618#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4619#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:23,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {4619#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4619#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:23,763 INFO L273 TraceCheckUtils]: 40: Hoare triple {4619#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:23,764 INFO L273 TraceCheckUtils]: 41: Hoare triple {4620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:23,765 INFO L273 TraceCheckUtils]: 42: Hoare triple {4620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4621#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:23,765 INFO L273 TraceCheckUtils]: 43: Hoare triple {4621#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4621#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:23,766 INFO L273 TraceCheckUtils]: 44: Hoare triple {4621#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4622#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:23,767 INFO L273 TraceCheckUtils]: 45: Hoare triple {4622#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4622#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:23,768 INFO L273 TraceCheckUtils]: 46: Hoare triple {4622#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4623#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:07:23,768 INFO L273 TraceCheckUtils]: 47: Hoare triple {4623#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {4623#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:07:23,769 INFO L273 TraceCheckUtils]: 48: Hoare triple {4623#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4624#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:23,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {4624#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4624#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:23,785 INFO L273 TraceCheckUtils]: 50: Hoare triple {4624#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4625#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:07:23,786 INFO L273 TraceCheckUtils]: 51: Hoare triple {4625#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4625#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:07:23,786 INFO L273 TraceCheckUtils]: 52: Hoare triple {4625#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4626#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:23,787 INFO L273 TraceCheckUtils]: 53: Hoare triple {4626#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4626#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:23,787 INFO L273 TraceCheckUtils]: 54: Hoare triple {4626#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4627#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:23,787 INFO L273 TraceCheckUtils]: 55: Hoare triple {4627#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4627#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:23,788 INFO L273 TraceCheckUtils]: 56: Hoare triple {4627#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4628#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:23,789 INFO L273 TraceCheckUtils]: 57: Hoare triple {4628#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4628#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:23,790 INFO L273 TraceCheckUtils]: 58: Hoare triple {4628#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4629#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:23,791 INFO L273 TraceCheckUtils]: 59: Hoare triple {4629#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {4629#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:23,792 INFO L273 TraceCheckUtils]: 60: Hoare triple {4629#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4630#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:23,793 INFO L273 TraceCheckUtils]: 61: Hoare triple {4630#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4601#false} is VALID [2018-11-23 13:07:23,793 INFO L256 TraceCheckUtils]: 62: Hoare triple {4601#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)); {4601#false} is VALID [2018-11-23 13:07:23,793 INFO L273 TraceCheckUtils]: 63: Hoare triple {4601#false} ~cond := #in~cond; {4601#false} is VALID [2018-11-23 13:07:23,793 INFO L273 TraceCheckUtils]: 64: Hoare triple {4601#false} assume 0 == ~cond; {4601#false} is VALID [2018-11-23 13:07:23,793 INFO L273 TraceCheckUtils]: 65: Hoare triple {4601#false} assume !false; {4601#false} is VALID [2018-11-23 13:07:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:23,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:23,801 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:07:23,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1