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/functions_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:06:57,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:57,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:57,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:57,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:57,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:57,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:57,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:57,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:57,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:57,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:57,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:57,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:57,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:57,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:57,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:57,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:57,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:57,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:57,087 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:57,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:57,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:57,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:57,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:57,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:57,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:57,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:57,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:57,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:57,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:57,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:57,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:57,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:57,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:57,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:57,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:57,100 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:06:57,121 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:57,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:57,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:06:57,122 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:06:57,123 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:57,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:57,123 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:57,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:57,124 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:06:57,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:57,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:06:57,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:57,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:06:57,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:06:57,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:06:57,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:06:57,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:57,125 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:57,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:06:57,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:57,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:57,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:06:57,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:06:57,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:57,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:57,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:06:57,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:06:57,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:57,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:06:57,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:06:57,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:06:57,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:57,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:57,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:57,207 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:57,208 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:57,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_true-unreach-call1_true-termination.i [2018-11-23 13:06:57,268 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15aac3eb9/386976d7f3ae4ff98d7d8747eeb1f9e1/FLAG70c924b62 [2018-11-23 13:06:57,649 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:57,649 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_true-unreach-call1_true-termination.i [2018-11-23 13:06:57,654 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15aac3eb9/386976d7f3ae4ff98d7d8747eeb1f9e1/FLAG70c924b62 [2018-11-23 13:06:58,051 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15aac3eb9/386976d7f3ae4ff98d7d8747eeb1f9e1 [2018-11-23 13:06:58,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:58,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:58,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:58,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:58,066 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:58,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc57fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58, skipping insertion in model container [2018-11-23 13:06:58,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:58,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:58,315 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:58,320 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:58,341 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:58,359 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:58,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58 WrapperNode [2018-11-23 13:06:58,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:58,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:58,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:58,361 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:58,370 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:06:58" (1/1) ... [2018-11-23 13:06:58,376 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:06:58" (1/1) ... [2018-11-23 13:06:58,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:58,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:58,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:58,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:58,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58" (1/1) ... [2018-11-23 13:06:58,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:58,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:58,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:58,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:58,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06: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:06:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:06:58,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:06:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 13:06:58,550 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:06:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:06:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:06:59,000 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:59,000 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:06:59,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:59 BoogieIcfgContainer [2018-11-23 13:06:59,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:59,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:06:59,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:06:59,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:06:59,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:06:58" (1/3) ... [2018-11-23 13:06:59,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35473336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:59, skipping insertion in model container [2018-11-23 13:06:59,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:58" (2/3) ... [2018-11-23 13:06:59,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35473336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:59, skipping insertion in model container [2018-11-23 13:06:59,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:59" (3/3) ... [2018-11-23 13:06:59,009 INFO L112 eAbstractionObserver]: Analyzing ICFG functions_true-unreach-call1_true-termination.i [2018-11-23 13:06:59,019 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:06:59,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:06:59,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:06:59,078 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:59,079 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:06:59,079 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:06:59,080 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:06:59,080 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:59,080 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:59,080 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:06:59,080 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:59,080 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:06:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 13:06:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:06:59,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:59,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:59,109 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:59,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1238725826, now seen corresponding path program 1 times [2018-11-23 13:06:59,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:59,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:59,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 13:06:59,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 13:06:59,293 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #35#return; {25#true} is VALID [2018-11-23 13:06:59,293 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret1 := main(); {25#true} is VALID [2018-11-23 13:06:59,294 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} ~x~0 := 0; {25#true} is VALID [2018-11-23 13:06:59,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 13:06:59,307 INFO L256 TraceCheckUtils]: 6: Hoare triple {26#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)); {26#false} is VALID [2018-11-23 13:06:59,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-23 13:06:59,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2018-11-23 13:06:59,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 13:06:59,312 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:06:59,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:59,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:06:59,320 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:06:59,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:59,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:06:59,397 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:06:59,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:06:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:06:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:06:59,410 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 13:06:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,506 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 13:06:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:06:59,507 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:06:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:06:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:06:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:06:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:06:59,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 13:06:59,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:59,806 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:06:59,807 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:06:59,811 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:06:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:06:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:06:59,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:59,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:59,891 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:59,891 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,895 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:59,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:59,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:59,896 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:59,896 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,900 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:59,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:59,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:59,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:59,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:06:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:06:59,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-11-23 13:06:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:59,906 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:06:59,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:06:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:06:59,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:59,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:59,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:59,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:59,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1244266952, now seen corresponding path program 1 times [2018-11-23 13:06:59,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:59,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:59,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:59,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:00,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {130#true} call ULTIMATE.init(); {130#true} is VALID [2018-11-23 13:07:00,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {130#true} assume true; {130#true} is VALID [2018-11-23 13:07:00,167 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {130#true} {130#true} #35#return; {130#true} is VALID [2018-11-23 13:07:00,167 INFO L256 TraceCheckUtils]: 3: Hoare triple {130#true} call #t~ret1 := main(); {130#true} is VALID [2018-11-23 13:07:00,168 INFO L273 TraceCheckUtils]: 4: Hoare triple {130#true} ~x~0 := 0; {132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:00,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {131#false} is VALID [2018-11-23 13:07:00,170 INFO L256 TraceCheckUtils]: 6: Hoare triple {131#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)); {131#false} is VALID [2018-11-23 13:07:00,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {131#false} ~cond := #in~cond; {131#false} is VALID [2018-11-23 13:07:00,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {131#false} assume 0 == ~cond; {131#false} is VALID [2018-11-23 13:07:00,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {131#false} assume !false; {131#false} is VALID [2018-11-23 13:07:00,172 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:07:00,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:07:00,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:07:00,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:07:00,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:00,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:07:00,225 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:07:00,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:07:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:07:00,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:07:00,227 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2018-11-23 13:07:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,459 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 13:07:00,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:07:00,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:07:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:07:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:07:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:07:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:07:00,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 13:07:00,507 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:07:00,508 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:07:00,509 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:07:00,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:07:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:07:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-23 13:07:00,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:00,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 17 states. [2018-11-23 13:07:00,529 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 17 states. [2018-11-23 13:07:00,530 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 17 states. [2018-11-23 13:07:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,533 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:07:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:07:00,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:00,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:00,534 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states. [2018-11-23 13:07:00,535 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states. [2018-11-23 13:07:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,537 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:07:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:07:00,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:00,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:00,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:00,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:07:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:07:00,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2018-11-23 13:07:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:00,541 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:07:00,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:07:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:07:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:07:00,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:00,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:00,543 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:00,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1831198934, now seen corresponding path program 1 times [2018-11-23 13:07:00,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:00,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:00,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-23 13:07:01,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-23 13:07:01,072 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {237#true} {237#true} #35#return; {237#true} is VALID [2018-11-23 13:07:01,072 INFO L256 TraceCheckUtils]: 3: Hoare triple {237#true} call #t~ret1 := main(); {237#true} is VALID [2018-11-23 13:07:01,085 INFO L273 TraceCheckUtils]: 4: Hoare triple {237#true} ~x~0 := 0; {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:01,098 INFO L273 TraceCheckUtils]: 5: Hoare triple {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:01,099 INFO L256 TraceCheckUtils]: 6: Hoare triple {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {237#true} is VALID [2018-11-23 13:07:01,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {237#true} ~z := #in~z;#res := 2 + ~z; {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:01,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:01,139 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {241#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:01,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {241#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {242#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:01,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {242#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {238#false} is VALID [2018-11-23 13:07:01,166 INFO L256 TraceCheckUtils]: 12: Hoare triple {238#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)); {238#false} is VALID [2018-11-23 13:07:01,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-23 13:07:01,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} assume 0 == ~cond; {238#false} is VALID [2018-11-23 13:07:01,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-23 13:07:01,172 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:07:01,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:01,177 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:07:01,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:01,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-23 13:07:01,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-23 13:07:01,511 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {237#true} {237#true} #35#return; {237#true} is VALID [2018-11-23 13:07:01,512 INFO L256 TraceCheckUtils]: 3: Hoare triple {237#true} call #t~ret1 := main(); {237#true} is VALID [2018-11-23 13:07:01,512 INFO L273 TraceCheckUtils]: 4: Hoare triple {237#true} ~x~0 := 0; {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:01,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:01,514 INFO L256 TraceCheckUtils]: 6: Hoare triple {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {237#true} is VALID [2018-11-23 13:07:01,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {237#true} ~z := #in~z;#res := 2 + ~z; {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:01,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:01,517 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {241#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:01,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {241#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {276#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:01,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {276#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {238#false} is VALID [2018-11-23 13:07:01,520 INFO L256 TraceCheckUtils]: 12: Hoare triple {238#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)); {238#false} is VALID [2018-11-23 13:07:01,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-23 13:07:01,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} assume 0 == ~cond; {238#false} is VALID [2018-11-23 13:07:01,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-23 13:07:01,524 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:07:01,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:01,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:07:01,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:07:01,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:01,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:07:01,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:01,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:07:01,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:07:01,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:07:01,653 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-11-23 13:07:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,034 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:07:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:07:02,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:07:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:07:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 13:07:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:07:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 13:07:02,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 13:07:02,086 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:07:02,088 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:07:02,089 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:07:02,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:07:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:07:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 13:07:02,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:02,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2018-11-23 13:07:02,135 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2018-11-23 13:07:02,135 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2018-11-23 13:07:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,138 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:07:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:07:02,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:02,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:02,139 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2018-11-23 13:07:02,139 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2018-11-23 13:07:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,142 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:07:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:07:02,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:02,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:02,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:02,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:07:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 13:07:02,146 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-23 13:07:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:02,146 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 13:07:02,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:07:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:07:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:07:02,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:02,147 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:02,148 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:02,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:02,148 INFO L82 PathProgramCache]: Analyzing trace with hash 329045236, now seen corresponding path program 2 times [2018-11-23 13:07:02,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:02,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:02,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:02,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2018-11-23 13:07:02,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#true} assume true; {411#true} is VALID [2018-11-23 13:07:02,788 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {411#true} {411#true} #35#return; {411#true} is VALID [2018-11-23 13:07:02,788 INFO L256 TraceCheckUtils]: 3: Hoare triple {411#true} call #t~ret1 := main(); {411#true} is VALID [2018-11-23 13:07:02,789 INFO L273 TraceCheckUtils]: 4: Hoare triple {411#true} ~x~0 := 0; {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,790 INFO L256 TraceCheckUtils]: 6: Hoare triple {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {411#true} is VALID [2018-11-23 13:07:02,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#true} ~z := #in~z;#res := 2 + ~z; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,801 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {415#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:02,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {415#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,808 INFO L256 TraceCheckUtils]: 12: Hoare triple {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {411#true} is VALID [2018-11-23 13:07:02,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {411#true} ~z := #in~z;#res := 2 + ~z; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,811 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {417#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {417#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {418#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:02,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {418#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {412#false} is VALID [2018-11-23 13:07:02,816 INFO L256 TraceCheckUtils]: 18: Hoare triple {412#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)); {412#false} is VALID [2018-11-23 13:07:02,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2018-11-23 13:07:02,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2018-11-23 13:07:02,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {412#false} assume !false; {412#false} is VALID [2018-11-23 13:07:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:07:02,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:02,819 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:07:02,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:02,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:02,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:03,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2018-11-23 13:07:03,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#true} assume true; {411#true} is VALID [2018-11-23 13:07:03,044 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {411#true} {411#true} #35#return; {411#true} is VALID [2018-11-23 13:07:03,044 INFO L256 TraceCheckUtils]: 3: Hoare triple {411#true} call #t~ret1 := main(); {411#true} is VALID [2018-11-23 13:07:03,046 INFO L273 TraceCheckUtils]: 4: Hoare triple {411#true} ~x~0 := 0; {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:03,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:03,047 INFO L256 TraceCheckUtils]: 6: Hoare triple {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {411#true} is VALID [2018-11-23 13:07:03,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#true} ~z := #in~z;#res := 2 + ~z; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:03,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:03,056 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {415#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:03,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {415#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:03,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:03,058 INFO L256 TraceCheckUtils]: 12: Hoare triple {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {411#true} is VALID [2018-11-23 13:07:03,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {411#true} ~z := #in~z;#res := 2 + ~z; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:03,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:03,061 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {417#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:03,062 INFO L273 TraceCheckUtils]: 16: Hoare triple {417#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:03,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 268435455); {412#false} is VALID [2018-11-23 13:07:03,064 INFO L256 TraceCheckUtils]: 18: Hoare triple {412#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)); {412#false} is VALID [2018-11-23 13:07:03,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2018-11-23 13:07:03,064 INFO L273 TraceCheckUtils]: 20: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2018-11-23 13:07:03,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {412#false} assume !false; {412#false} is VALID [2018-11-23 13:07:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:07:03,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:03,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:07:03,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:07:03,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:03,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:07:03,124 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:07:03,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:07:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:07:03,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:07:03,125 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2018-11-23 13:07:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:03,599 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 13:07:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:07:03,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:07:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:07:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-11-23 13:07:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:07:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-11-23 13:07:03,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2018-11-23 13:07:03,673 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:07:03,675 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:07:03,675 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:07:03,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:07:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:07:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 13:07:03,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:03,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2018-11-23 13:07:03,702 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2018-11-23 13:07:03,702 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2018-11-23 13:07:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:03,706 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 13:07:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:07:03,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:03,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:03,707 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2018-11-23 13:07:03,707 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2018-11-23 13:07:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:03,710 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 13:07:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:07:03,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:03,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:03,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:03,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:07:03,714 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 22 [2018-11-23 13:07:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:03,714 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:07:03,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:07:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:07:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:07:03,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:03,716 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:03,716 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:03,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash 755481234, now seen corresponding path program 3 times [2018-11-23 13:07:03,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:03,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:03,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:03,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:03,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:04,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2018-11-23 13:07:04,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-23 13:07:04,248 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {623#true} {623#true} #35#return; {623#true} is VALID [2018-11-23 13:07:04,249 INFO L256 TraceCheckUtils]: 3: Hoare triple {623#true} call #t~ret1 := main(); {623#true} is VALID [2018-11-23 13:07:04,252 INFO L273 TraceCheckUtils]: 4: Hoare triple {623#true} ~x~0 := 0; {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:04,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:04,253 INFO L256 TraceCheckUtils]: 6: Hoare triple {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:07:04,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,260 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {627#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:04,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:04,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:04,262 INFO L256 TraceCheckUtils]: 12: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:07:04,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,265 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {629#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:04,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {629#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:04,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:04,267 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:07:04,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,270 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {631#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:04,271 INFO L273 TraceCheckUtils]: 22: Hoare triple {631#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {632#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:04,272 INFO L273 TraceCheckUtils]: 23: Hoare triple {632#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {624#false} is VALID [2018-11-23 13:07:04,273 INFO L256 TraceCheckUtils]: 24: Hoare triple {624#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)); {624#false} is VALID [2018-11-23 13:07:04,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {624#false} ~cond := #in~cond; {624#false} is VALID [2018-11-23 13:07:04,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {624#false} assume 0 == ~cond; {624#false} is VALID [2018-11-23 13:07:04,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {624#false} assume !false; {624#false} is VALID [2018-11-23 13:07:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:07:04,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:04,278 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:07:04,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:04,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:07:04,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:04,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:04,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2018-11-23 13:07:04,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-23 13:07:04,712 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {623#true} {623#true} #35#return; {623#true} is VALID [2018-11-23 13:07:04,712 INFO L256 TraceCheckUtils]: 3: Hoare triple {623#true} call #t~ret1 := main(); {623#true} is VALID [2018-11-23 13:07:04,716 INFO L273 TraceCheckUtils]: 4: Hoare triple {623#true} ~x~0 := 0; {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:04,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:04,717 INFO L256 TraceCheckUtils]: 6: Hoare triple {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:07:04,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,723 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {627#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:04,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:04,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:04,725 INFO L256 TraceCheckUtils]: 12: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:07:04,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,728 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {629#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:04,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {629#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:04,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:04,731 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:07:04,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:04,765 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {631#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:04,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {631#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:04,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {624#false} is VALID [2018-11-23 13:07:04,766 INFO L256 TraceCheckUtils]: 24: Hoare triple {624#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)); {624#false} is VALID [2018-11-23 13:07:04,767 INFO L273 TraceCheckUtils]: 25: Hoare triple {624#false} ~cond := #in~cond; {624#false} is VALID [2018-11-23 13:07:04,767 INFO L273 TraceCheckUtils]: 26: Hoare triple {624#false} assume 0 == ~cond; {624#false} is VALID [2018-11-23 13:07:04,767 INFO L273 TraceCheckUtils]: 27: Hoare triple {624#false} assume !false; {624#false} is VALID [2018-11-23 13:07:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:07:04,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:04,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:07:04,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 13:07:04,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:04,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:07:04,817 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:07:04,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:07:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:07:04,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:07:04,819 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2018-11-23 13:07:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,452 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:07:05,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:07:05,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 13:07:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:07:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-11-23 13:07:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:07:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-11-23 13:07:05,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2018-11-23 13:07:05,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:05,512 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:07:05,512 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:07:05,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:07:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:07:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 13:07:05,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:05,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 13:07:05,540 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 13:07:05,540 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 13:07:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,543 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:07:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:07:05,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:05,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:05,544 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 13:07:05,544 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 13:07:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,547 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:07:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:07:05,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:05,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:05,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:05,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:07:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 13:07:05,550 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 28 [2018-11-23 13:07:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:05,551 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 13:07:05,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:07:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 13:07:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:07:05,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:05,552 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:05,553 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:05,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:05,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1475645008, now seen corresponding path program 4 times [2018-11-23 13:07:05,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:05,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:05,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:05,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:05,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2018-11-23 13:07:05,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {873#true} assume true; {873#true} is VALID [2018-11-23 13:07:05,988 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {873#true} {873#true} #35#return; {873#true} is VALID [2018-11-23 13:07:05,989 INFO L256 TraceCheckUtils]: 3: Hoare triple {873#true} call #t~ret1 := main(); {873#true} is VALID [2018-11-23 13:07:05,989 INFO L273 TraceCheckUtils]: 4: Hoare triple {873#true} ~x~0 := 0; {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:05,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:05,990 INFO L256 TraceCheckUtils]: 6: Hoare triple {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:07:05,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:05,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:05,994 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {877#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:05,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {877#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:05,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:05,997 INFO L256 TraceCheckUtils]: 12: Hoare triple {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:07:05,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:05,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,000 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {879#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:06,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {879#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:06,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:06,003 INFO L256 TraceCheckUtils]: 18: Hoare triple {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:07:06,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,007 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {881#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:06,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {881#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:06,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:06,009 INFO L256 TraceCheckUtils]: 24: Hoare triple {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:07:06,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,013 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {883#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:06,014 INFO L273 TraceCheckUtils]: 28: Hoare triple {883#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {884#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:06,015 INFO L273 TraceCheckUtils]: 29: Hoare triple {884#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {874#false} is VALID [2018-11-23 13:07:06,016 INFO L256 TraceCheckUtils]: 30: Hoare triple {874#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)); {874#false} is VALID [2018-11-23 13:07:06,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {874#false} ~cond := #in~cond; {874#false} is VALID [2018-11-23 13:07:06,016 INFO L273 TraceCheckUtils]: 32: Hoare triple {874#false} assume 0 == ~cond; {874#false} is VALID [2018-11-23 13:07:06,017 INFO L273 TraceCheckUtils]: 33: Hoare triple {874#false} assume !false; {874#false} is VALID [2018-11-23 13:07:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:07:06,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:06,020 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:07:06,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:06,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:06,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:06,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:06,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2018-11-23 13:07:06,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {873#true} assume true; {873#true} is VALID [2018-11-23 13:07:06,351 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {873#true} {873#true} #35#return; {873#true} is VALID [2018-11-23 13:07:06,351 INFO L256 TraceCheckUtils]: 3: Hoare triple {873#true} call #t~ret1 := main(); {873#true} is VALID [2018-11-23 13:07:06,352 INFO L273 TraceCheckUtils]: 4: Hoare triple {873#true} ~x~0 := 0; {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:06,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:06,353 INFO L256 TraceCheckUtils]: 6: Hoare triple {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:07:06,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,382 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {877#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:06,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {877#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:06,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:06,396 INFO L256 TraceCheckUtils]: 12: Hoare triple {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:07:06,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,401 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {879#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:06,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {879#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:06,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:06,403 INFO L256 TraceCheckUtils]: 18: Hoare triple {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:07:06,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,406 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {881#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:06,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {881#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:06,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:06,408 INFO L256 TraceCheckUtils]: 24: Hoare triple {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:07:06,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:06,411 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {883#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:06,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {883#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {972#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:06,414 INFO L273 TraceCheckUtils]: 29: Hoare triple {972#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 268435455); {874#false} is VALID [2018-11-23 13:07:06,414 INFO L256 TraceCheckUtils]: 30: Hoare triple {874#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)); {874#false} is VALID [2018-11-23 13:07:06,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {874#false} ~cond := #in~cond; {874#false} is VALID [2018-11-23 13:07:06,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {874#false} assume 0 == ~cond; {874#false} is VALID [2018-11-23 13:07:06,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {874#false} assume !false; {874#false} is VALID [2018-11-23 13:07:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:07:06,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:06,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:07:06,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 13:07:06,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:06,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:07:06,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:06,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:07:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:07:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:07:06,505 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 13 states. [2018-11-23 13:07:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:07,632 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 13:07:07,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:07:07,633 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 13:07:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:07:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 13:07:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:07:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 13:07:07,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2018-11-23 13:07:07,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:07,683 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:07:07,683 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:07:07,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:07:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:07:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 13:07:07,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:07,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-23 13:07:07,709 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-23 13:07:07,709 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-23 13:07:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:07,712 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:07:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:07:07,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:07,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:07,714 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-23 13:07:07,714 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-23 13:07:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:07,716 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:07:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:07:07,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:07,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:07,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:07,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 13:07:07,720 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 34 [2018-11-23 13:07:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:07,720 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 13:07:07,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:07:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 13:07:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:07:07,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:07,722 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:07,722 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:07,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1545919054, now seen corresponding path program 5 times [2018-11-23 13:07:07,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:07,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:07,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:08,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2018-11-23 13:07:08,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2018-11-23 13:07:08,355 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #35#return; {1161#true} is VALID [2018-11-23 13:07:08,355 INFO L256 TraceCheckUtils]: 3: Hoare triple {1161#true} call #t~ret1 := main(); {1161#true} is VALID [2018-11-23 13:07:08,356 INFO L273 TraceCheckUtils]: 4: Hoare triple {1161#true} ~x~0 := 0; {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:08,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:08,357 INFO L256 TraceCheckUtils]: 6: Hoare triple {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,360 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1165#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:08,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {1165#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:08,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:08,361 INFO L256 TraceCheckUtils]: 12: Hoare triple {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,363 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1167#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:08,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {1167#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:08,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:08,365 INFO L256 TraceCheckUtils]: 18: Hoare triple {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,368 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1169#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:08,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {1169#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:08,370 INFO L273 TraceCheckUtils]: 23: Hoare triple {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:08,370 INFO L256 TraceCheckUtils]: 24: Hoare triple {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,371 INFO L273 TraceCheckUtils]: 25: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,372 INFO L273 TraceCheckUtils]: 26: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,373 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1171#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:08,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {1171#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:08,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:08,375 INFO L256 TraceCheckUtils]: 30: Hoare triple {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,376 INFO L273 TraceCheckUtils]: 31: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,379 INFO L273 TraceCheckUtils]: 32: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,381 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1173#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:08,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {1173#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1174#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:08,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {1174#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1162#false} is VALID [2018-11-23 13:07:08,388 INFO L256 TraceCheckUtils]: 36: Hoare triple {1162#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)); {1162#false} is VALID [2018-11-23 13:07:08,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {1162#false} ~cond := #in~cond; {1162#false} is VALID [2018-11-23 13:07:08,389 INFO L273 TraceCheckUtils]: 38: Hoare triple {1162#false} assume 0 == ~cond; {1162#false} is VALID [2018-11-23 13:07:08,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2018-11-23 13:07:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 13:07:08,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:08,393 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:07:08,405 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:07:08,442 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:07:08,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:08,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:08,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2018-11-23 13:07:08,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2018-11-23 13:07:08,859 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #35#return; {1161#true} is VALID [2018-11-23 13:07:08,859 INFO L256 TraceCheckUtils]: 3: Hoare triple {1161#true} call #t~ret1 := main(); {1161#true} is VALID [2018-11-23 13:07:08,860 INFO L273 TraceCheckUtils]: 4: Hoare triple {1161#true} ~x~0 := 0; {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:08,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:08,861 INFO L256 TraceCheckUtils]: 6: Hoare triple {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,863 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1165#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:08,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {1165#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:08,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:08,867 INFO L256 TraceCheckUtils]: 12: Hoare triple {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,870 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1167#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:08,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {1167#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:08,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:08,873 INFO L256 TraceCheckUtils]: 18: Hoare triple {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,876 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1169#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:08,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {1169#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:08,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:08,878 INFO L256 TraceCheckUtils]: 24: Hoare triple {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,882 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1171#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:08,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {1171#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:08,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:08,884 INFO L256 TraceCheckUtils]: 30: Hoare triple {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:07:08,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:08,889 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1173#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:08,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {1173#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:08,890 INFO L273 TraceCheckUtils]: 35: Hoare triple {1280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1162#false} is VALID [2018-11-23 13:07:08,890 INFO L256 TraceCheckUtils]: 36: Hoare triple {1162#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)); {1162#false} is VALID [2018-11-23 13:07:08,891 INFO L273 TraceCheckUtils]: 37: Hoare triple {1162#false} ~cond := #in~cond; {1162#false} is VALID [2018-11-23 13:07:08,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {1162#false} assume 0 == ~cond; {1162#false} is VALID [2018-11-23 13:07:08,891 INFO L273 TraceCheckUtils]: 39: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2018-11-23 13:07:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 13:07:08,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:08,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:07:08,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-23 13:07:08,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:08,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:07:08,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:08,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:07:08,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:07:08,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:07:08,968 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 15 states. [2018-11-23 13:07:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:10,123 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 13:07:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:07:10,123 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-23 13:07:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:07:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2018-11-23 13:07:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:07:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2018-11-23 13:07:10,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 45 transitions. [2018-11-23 13:07:10,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:10,247 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:07:10,247 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:07:10,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:07:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:07:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 13:07:10,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:10,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 13:07:10,270 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 13:07:10,270 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 13:07:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:10,273 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 13:07:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 13:07:10,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:10,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:10,274 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 13:07:10,274 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 13:07:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:10,277 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 13:07:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 13:07:10,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:10,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:10,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:10,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:07:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 13:07:10,280 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 40 [2018-11-23 13:07:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:10,280 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 13:07:10,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:07:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 13:07:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:07:10,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:10,282 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:10,282 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:10,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 128504940, now seen corresponding path program 6 times [2018-11-23 13:07:10,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:10,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:10,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {1487#true} call ULTIMATE.init(); {1487#true} is VALID [2018-11-23 13:07:10,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {1487#true} assume true; {1487#true} is VALID [2018-11-23 13:07:10,705 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1487#true} {1487#true} #35#return; {1487#true} is VALID [2018-11-23 13:07:10,705 INFO L256 TraceCheckUtils]: 3: Hoare triple {1487#true} call #t~ret1 := main(); {1487#true} is VALID [2018-11-23 13:07:10,706 INFO L273 TraceCheckUtils]: 4: Hoare triple {1487#true} ~x~0 := 0; {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:10,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:10,706 INFO L256 TraceCheckUtils]: 6: Hoare triple {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:10,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,708 INFO L273 TraceCheckUtils]: 8: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,709 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1491#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:10,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {1491#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:10,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:10,711 INFO L256 TraceCheckUtils]: 12: Hoare triple {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:10,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,714 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1493#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {1493#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:10,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:10,716 INFO L256 TraceCheckUtils]: 18: Hoare triple {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:10,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,719 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1495#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {1495#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:10,721 INFO L273 TraceCheckUtils]: 23: Hoare triple {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:10,721 INFO L256 TraceCheckUtils]: 24: Hoare triple {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:10,722 INFO L273 TraceCheckUtils]: 25: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,723 INFO L273 TraceCheckUtils]: 26: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,724 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1497#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {1497#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:10,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:10,726 INFO L256 TraceCheckUtils]: 30: Hoare triple {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:10,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,729 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1499#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {1499#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:10,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:10,731 INFO L256 TraceCheckUtils]: 36: Hoare triple {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:10,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,732 INFO L273 TraceCheckUtils]: 38: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,734 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {1501#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {1501#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1502#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:10,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {1502#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1488#false} is VALID [2018-11-23 13:07:10,736 INFO L256 TraceCheckUtils]: 42: Hoare triple {1488#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)); {1488#false} is VALID [2018-11-23 13:07:10,736 INFO L273 TraceCheckUtils]: 43: Hoare triple {1488#false} ~cond := #in~cond; {1488#false} is VALID [2018-11-23 13:07:10,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {1488#false} assume 0 == ~cond; {1488#false} is VALID [2018-11-23 13:07:10,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2018-11-23 13:07:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 13:07:10,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:10,741 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:07:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:10,848 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:07:10,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:10,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:11,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {1487#true} call ULTIMATE.init(); {1487#true} is VALID [2018-11-23 13:07:11,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {1487#true} assume true; {1487#true} is VALID [2018-11-23 13:07:11,211 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1487#true} {1487#true} #35#return; {1487#true} is VALID [2018-11-23 13:07:11,211 INFO L256 TraceCheckUtils]: 3: Hoare triple {1487#true} call #t~ret1 := main(); {1487#true} is VALID [2018-11-23 13:07:11,220 INFO L273 TraceCheckUtils]: 4: Hoare triple {1487#true} ~x~0 := 0; {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:11,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:11,220 INFO L256 TraceCheckUtils]: 6: Hoare triple {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:11,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,222 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1491#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:11,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {1491#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:11,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:11,224 INFO L256 TraceCheckUtils]: 12: Hoare triple {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:11,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,227 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1493#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {1493#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:11,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:11,229 INFO L256 TraceCheckUtils]: 18: Hoare triple {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:11,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,246 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1495#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {1495#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:11,247 INFO L273 TraceCheckUtils]: 23: Hoare triple {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:11,247 INFO L256 TraceCheckUtils]: 24: Hoare triple {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:11,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,249 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1497#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,249 INFO L273 TraceCheckUtils]: 28: Hoare triple {1497#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:11,250 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:11,250 INFO L256 TraceCheckUtils]: 30: Hoare triple {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:11,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,253 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1499#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {1499#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:11,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:11,257 INFO L256 TraceCheckUtils]: 36: Hoare triple {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:07:11,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,266 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {1501#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {1501#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:11,267 INFO L273 TraceCheckUtils]: 41: Hoare triple {1626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1488#false} is VALID [2018-11-23 13:07:11,268 INFO L256 TraceCheckUtils]: 42: Hoare triple {1488#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)); {1488#false} is VALID [2018-11-23 13:07:11,268 INFO L273 TraceCheckUtils]: 43: Hoare triple {1488#false} ~cond := #in~cond; {1488#false} is VALID [2018-11-23 13:07:11,268 INFO L273 TraceCheckUtils]: 44: Hoare triple {1488#false} assume 0 == ~cond; {1488#false} is VALID [2018-11-23 13:07:11,268 INFO L273 TraceCheckUtils]: 45: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2018-11-23 13:07:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 13:07:11,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:11,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:07:11,291 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-23 13:07:11,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:11,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:07:11,328 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:07:11,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:07:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:07:11,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:07:11,330 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 17 states. [2018-11-23 13:07:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:12,608 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 13:07:12,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:07:12,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-23 13:07:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:07:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2018-11-23 13:07:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:07:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2018-11-23 13:07:12,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2018-11-23 13:07:12,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:12,699 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:07:12,699 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:07:12,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:07:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 13:07:12,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:12,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-23 13:07:12,737 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-23 13:07:12,737 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-23 13:07:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:12,739 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 13:07:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 13:07:12,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:12,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:12,740 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-23 13:07:12,740 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-23 13:07:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:12,743 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 13:07:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 13:07:12,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:12,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:12,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:12,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:07:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 13:07:12,746 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 46 [2018-11-23 13:07:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:12,746 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 13:07:12,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:07:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 13:07:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:07:12,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:12,748 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:12,748 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:12,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash -842776566, now seen corresponding path program 7 times [2018-11-23 13:07:12,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:12,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:12,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:13,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {1851#true} call ULTIMATE.init(); {1851#true} is VALID [2018-11-23 13:07:13,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {1851#true} assume true; {1851#true} is VALID [2018-11-23 13:07:13,245 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1851#true} {1851#true} #35#return; {1851#true} is VALID [2018-11-23 13:07:13,245 INFO L256 TraceCheckUtils]: 3: Hoare triple {1851#true} call #t~ret1 := main(); {1851#true} is VALID [2018-11-23 13:07:13,246 INFO L273 TraceCheckUtils]: 4: Hoare triple {1851#true} ~x~0 := 0; {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:13,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:13,247 INFO L256 TraceCheckUtils]: 6: Hoare triple {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,251 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1855#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:13,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {1855#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:13,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:13,253 INFO L256 TraceCheckUtils]: 12: Hoare triple {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,257 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1857#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:13,259 INFO L273 TraceCheckUtils]: 17: Hoare triple {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:13,259 INFO L256 TraceCheckUtils]: 18: Hoare triple {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,263 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1859#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {1859#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:13,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:13,266 INFO L256 TraceCheckUtils]: 24: Hoare triple {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,267 INFO L273 TraceCheckUtils]: 26: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,279 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1861#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,280 INFO L273 TraceCheckUtils]: 28: Hoare triple {1861#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:13,280 INFO L273 TraceCheckUtils]: 29: Hoare triple {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:13,280 INFO L256 TraceCheckUtils]: 30: Hoare triple {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,281 INFO L273 TraceCheckUtils]: 31: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,283 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1863#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {1863#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:13,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:13,285 INFO L256 TraceCheckUtils]: 36: Hoare triple {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,286 INFO L273 TraceCheckUtils]: 37: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,287 INFO L273 TraceCheckUtils]: 38: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,289 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {1865#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,290 INFO L273 TraceCheckUtils]: 40: Hoare triple {1865#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:13,291 INFO L273 TraceCheckUtils]: 41: Hoare triple {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:13,291 INFO L256 TraceCheckUtils]: 42: Hoare triple {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,292 INFO L273 TraceCheckUtils]: 43: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,293 INFO L273 TraceCheckUtils]: 44: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,295 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {1867#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,296 INFO L273 TraceCheckUtils]: 46: Hoare triple {1867#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1868#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:13,297 INFO L273 TraceCheckUtils]: 47: Hoare triple {1868#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1852#false} is VALID [2018-11-23 13:07:13,297 INFO L256 TraceCheckUtils]: 48: Hoare triple {1852#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)); {1852#false} is VALID [2018-11-23 13:07:13,298 INFO L273 TraceCheckUtils]: 49: Hoare triple {1852#false} ~cond := #in~cond; {1852#false} is VALID [2018-11-23 13:07:13,298 INFO L273 TraceCheckUtils]: 50: Hoare triple {1852#false} assume 0 == ~cond; {1852#false} is VALID [2018-11-23 13:07:13,298 INFO L273 TraceCheckUtils]: 51: Hoare triple {1852#false} assume !false; {1852#false} is VALID [2018-11-23 13:07:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 13:07:13,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:13,304 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:07:13,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:13,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:13,790 INFO L256 TraceCheckUtils]: 0: Hoare triple {1851#true} call ULTIMATE.init(); {1851#true} is VALID [2018-11-23 13:07:13,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {1851#true} assume true; {1851#true} is VALID [2018-11-23 13:07:13,790 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1851#true} {1851#true} #35#return; {1851#true} is VALID [2018-11-23 13:07:13,790 INFO L256 TraceCheckUtils]: 3: Hoare triple {1851#true} call #t~ret1 := main(); {1851#true} is VALID [2018-11-23 13:07:13,792 INFO L273 TraceCheckUtils]: 4: Hoare triple {1851#true} ~x~0 := 0; {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:13,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:13,794 INFO L256 TraceCheckUtils]: 6: Hoare triple {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,798 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1855#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:13,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {1855#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:13,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:13,801 INFO L256 TraceCheckUtils]: 12: Hoare triple {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,838 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1857#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:13,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:13,845 INFO L256 TraceCheckUtils]: 18: Hoare triple {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,846 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1859#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {1859#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:13,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:13,847 INFO L256 TraceCheckUtils]: 24: Hoare triple {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,850 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1861#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {1861#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:13,851 INFO L273 TraceCheckUtils]: 29: Hoare triple {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:13,851 INFO L256 TraceCheckUtils]: 30: Hoare triple {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,861 INFO L273 TraceCheckUtils]: 31: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,876 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1863#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {1863#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:13,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:13,878 INFO L256 TraceCheckUtils]: 36: Hoare triple {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,880 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {1865#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {1865#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:13,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:13,883 INFO L256 TraceCheckUtils]: 42: Hoare triple {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:07:13,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:13,890 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {1867#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:13,890 INFO L273 TraceCheckUtils]: 46: Hoare triple {1867#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2010#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:13,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {2010#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1852#false} is VALID [2018-11-23 13:07:13,892 INFO L256 TraceCheckUtils]: 48: Hoare triple {1852#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)); {1852#false} is VALID [2018-11-23 13:07:13,892 INFO L273 TraceCheckUtils]: 49: Hoare triple {1852#false} ~cond := #in~cond; {1852#false} is VALID [2018-11-23 13:07:13,892 INFO L273 TraceCheckUtils]: 50: Hoare triple {1852#false} assume 0 == ~cond; {1852#false} is VALID [2018-11-23 13:07:13,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {1852#false} assume !false; {1852#false} is VALID [2018-11-23 13:07:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 13:07:13,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:13,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:07:13,916 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-11-23 13:07:13,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:13,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:07:13,970 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:07:13,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:07:13,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:07:13,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:07:13,971 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 19 states. [2018-11-23 13:07:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,457 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 13:07:15,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:07:15,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-11-23 13:07:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:07:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2018-11-23 13:07:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:07:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2018-11-23 13:07:15,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2018-11-23 13:07:15,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:15,525 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:07:15,526 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:07:15,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:07:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:07:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 13:07:15,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:15,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-23 13:07:15,553 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-23 13:07:15,553 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-23 13:07:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,556 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 13:07:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 13:07:15,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:15,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:15,557 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-23 13:07:15,557 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-23 13:07:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,560 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 13:07:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 13:07:15,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:15,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:15,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:15,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:07:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 13:07:15,563 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 52 [2018-11-23 13:07:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:15,563 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 13:07:15,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:07:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 13:07:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:07:15,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:15,564 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:15,565 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:15,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash 880540968, now seen corresponding path program 8 times [2018-11-23 13:07:15,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:15,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:15,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:15,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:15,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:16,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2018-11-23 13:07:16,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {2253#true} assume true; {2253#true} is VALID [2018-11-23 13:07:16,115 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2253#true} {2253#true} #35#return; {2253#true} is VALID [2018-11-23 13:07:16,115 INFO L256 TraceCheckUtils]: 3: Hoare triple {2253#true} call #t~ret1 := main(); {2253#true} is VALID [2018-11-23 13:07:16,115 INFO L273 TraceCheckUtils]: 4: Hoare triple {2253#true} ~x~0 := 0; {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:16,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:16,116 INFO L256 TraceCheckUtils]: 6: Hoare triple {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,120 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {2257#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:16,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {2257#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:16,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:16,121 INFO L256 TraceCheckUtils]: 12: Hoare triple {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,158 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {2259#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {2259#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:16,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:16,174 INFO L256 TraceCheckUtils]: 18: Hoare triple {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,177 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {2261#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {2261#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:16,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:16,178 INFO L256 TraceCheckUtils]: 24: Hoare triple {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,179 INFO L273 TraceCheckUtils]: 26: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,180 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {2263#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {2263#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:16,182 INFO L273 TraceCheckUtils]: 29: Hoare triple {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:16,182 INFO L256 TraceCheckUtils]: 30: Hoare triple {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,185 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {2265#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,185 INFO L273 TraceCheckUtils]: 34: Hoare triple {2265#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:16,186 INFO L273 TraceCheckUtils]: 35: Hoare triple {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:16,186 INFO L256 TraceCheckUtils]: 36: Hoare triple {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,187 INFO L273 TraceCheckUtils]: 37: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,188 INFO L273 TraceCheckUtils]: 38: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,189 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {2267#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,190 INFO L273 TraceCheckUtils]: 40: Hoare triple {2267#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:16,191 INFO L273 TraceCheckUtils]: 41: Hoare triple {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:16,191 INFO L256 TraceCheckUtils]: 42: Hoare triple {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,192 INFO L273 TraceCheckUtils]: 43: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,192 INFO L273 TraceCheckUtils]: 44: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,194 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {2269#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,194 INFO L273 TraceCheckUtils]: 46: Hoare triple {2269#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:16,195 INFO L273 TraceCheckUtils]: 47: Hoare triple {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:16,195 INFO L256 TraceCheckUtils]: 48: Hoare triple {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,196 INFO L273 TraceCheckUtils]: 49: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,198 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {2271#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:16,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {2271#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2272#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:16,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {2272#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2254#false} is VALID [2018-11-23 13:07:16,201 INFO L256 TraceCheckUtils]: 54: Hoare triple {2254#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)); {2254#false} is VALID [2018-11-23 13:07:16,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {2254#false} ~cond := #in~cond; {2254#false} is VALID [2018-11-23 13:07:16,201 INFO L273 TraceCheckUtils]: 56: Hoare triple {2254#false} assume 0 == ~cond; {2254#false} is VALID [2018-11-23 13:07:16,201 INFO L273 TraceCheckUtils]: 57: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2018-11-23 13:07:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:07:16,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:16,207 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:07:16,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:16,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:16,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:16,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:16,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2018-11-23 13:07:16,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {2253#true} assume true; {2253#true} is VALID [2018-11-23 13:07:16,660 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2253#true} {2253#true} #35#return; {2253#true} is VALID [2018-11-23 13:07:16,661 INFO L256 TraceCheckUtils]: 3: Hoare triple {2253#true} call #t~ret1 := main(); {2253#true} is VALID [2018-11-23 13:07:16,661 INFO L273 TraceCheckUtils]: 4: Hoare triple {2253#true} ~x~0 := 0; {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:16,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:16,662 INFO L256 TraceCheckUtils]: 6: Hoare triple {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,662 INFO L273 TraceCheckUtils]: 7: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,668 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {2257#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:16,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {2257#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:16,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:16,669 INFO L256 TraceCheckUtils]: 12: Hoare triple {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,671 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {2259#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {2259#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:16,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:16,672 INFO L256 TraceCheckUtils]: 18: Hoare triple {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,675 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {2261#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {2261#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:16,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:16,677 INFO L256 TraceCheckUtils]: 24: Hoare triple {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,680 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {2263#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {2263#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:16,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:16,682 INFO L256 TraceCheckUtils]: 30: Hoare triple {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,684 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {2265#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {2265#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:16,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:16,686 INFO L256 TraceCheckUtils]: 36: Hoare triple {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,689 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {2267#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,690 INFO L273 TraceCheckUtils]: 40: Hoare triple {2267#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:16,690 INFO L273 TraceCheckUtils]: 41: Hoare triple {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:16,690 INFO L256 TraceCheckUtils]: 42: Hoare triple {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,693 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {2269#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:16,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {2269#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:16,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:16,695 INFO L256 TraceCheckUtils]: 48: Hoare triple {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:07:16,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,696 INFO L273 TraceCheckUtils]: 50: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:16,698 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {2271#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:16,699 INFO L273 TraceCheckUtils]: 52: Hoare triple {2271#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2432#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:16,699 INFO L273 TraceCheckUtils]: 53: Hoare triple {2432#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2254#false} is VALID [2018-11-23 13:07:16,700 INFO L256 TraceCheckUtils]: 54: Hoare triple {2254#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)); {2254#false} is VALID [2018-11-23 13:07:16,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {2254#false} ~cond := #in~cond; {2254#false} is VALID [2018-11-23 13:07:16,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {2254#false} assume 0 == ~cond; {2254#false} is VALID [2018-11-23 13:07:16,700 INFO L273 TraceCheckUtils]: 57: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2018-11-23 13:07:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:07:16,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:16,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:07:16,724 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-11-23 13:07:16,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:16,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:07:16,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:16,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:07:16,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:07:16,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:07:16,766 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 21 states. [2018-11-23 13:07:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:18,693 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 13:07:18,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:07:18,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-11-23 13:07:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:07:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2018-11-23 13:07:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:07:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2018-11-23 13:07:18,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 57 transitions. [2018-11-23 13:07:18,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:18,804 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:07:18,804 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:07:18,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:07:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:07:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 13:07:18,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:18,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 13:07:18,895 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 13:07:18,895 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 13:07:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:18,897 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 13:07:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 13:07:18,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:18,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:18,898 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 13:07:18,898 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 13:07:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:18,900 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 13:07:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 13:07:18,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:18,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:18,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:18,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:07:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 13:07:18,903 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 58 [2018-11-23 13:07:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:18,903 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 13:07:18,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:07:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 13:07:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:07:18,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:18,904 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:18,905 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:18,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1565725754, now seen corresponding path program 9 times [2018-11-23 13:07:18,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:18,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:18,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:18,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:18,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:19,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {2693#true} call ULTIMATE.init(); {2693#true} is VALID [2018-11-23 13:07:19,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {2693#true} assume true; {2693#true} is VALID [2018-11-23 13:07:19,751 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2693#true} {2693#true} #35#return; {2693#true} is VALID [2018-11-23 13:07:19,751 INFO L256 TraceCheckUtils]: 3: Hoare triple {2693#true} call #t~ret1 := main(); {2693#true} is VALID [2018-11-23 13:07:19,752 INFO L273 TraceCheckUtils]: 4: Hoare triple {2693#true} ~x~0 := 0; {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:19,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:19,753 INFO L256 TraceCheckUtils]: 6: Hoare triple {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,756 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {2697#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:19,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {2697#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:19,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:19,757 INFO L256 TraceCheckUtils]: 12: Hoare triple {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,761 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {2699#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:19,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:19,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:19,763 INFO L256 TraceCheckUtils]: 18: Hoare triple {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,766 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {2701#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:19,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {2701#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:19,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:19,767 INFO L256 TraceCheckUtils]: 24: Hoare triple {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,771 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {2703#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:19,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {2703#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:19,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:19,773 INFO L256 TraceCheckUtils]: 30: Hoare triple {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,777 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {2705#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:19,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {2705#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:19,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:19,801 INFO L256 TraceCheckUtils]: 36: Hoare triple {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,802 INFO L273 TraceCheckUtils]: 38: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,804 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {2707#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:19,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {2707#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:19,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:19,806 INFO L256 TraceCheckUtils]: 42: Hoare triple {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,807 INFO L273 TraceCheckUtils]: 43: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,808 INFO L273 TraceCheckUtils]: 44: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,810 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {2709#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:19,811 INFO L273 TraceCheckUtils]: 46: Hoare triple {2709#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:19,812 INFO L273 TraceCheckUtils]: 47: Hoare triple {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:19,812 INFO L256 TraceCheckUtils]: 48: Hoare triple {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,812 INFO L273 TraceCheckUtils]: 49: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,813 INFO L273 TraceCheckUtils]: 50: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,814 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {2711#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:19,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {2711#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:19,816 INFO L273 TraceCheckUtils]: 53: Hoare triple {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:19,816 INFO L256 TraceCheckUtils]: 54: Hoare triple {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:19,817 INFO L273 TraceCheckUtils]: 55: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,818 INFO L273 TraceCheckUtils]: 56: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:19,820 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {2713#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:19,821 INFO L273 TraceCheckUtils]: 58: Hoare triple {2713#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {2714#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:19,822 INFO L273 TraceCheckUtils]: 59: Hoare triple {2714#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2694#false} is VALID [2018-11-23 13:07:19,823 INFO L256 TraceCheckUtils]: 60: Hoare triple {2694#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)); {2694#false} is VALID [2018-11-23 13:07:19,823 INFO L273 TraceCheckUtils]: 61: Hoare triple {2694#false} ~cond := #in~cond; {2694#false} is VALID [2018-11-23 13:07:19,823 INFO L273 TraceCheckUtils]: 62: Hoare triple {2694#false} assume 0 == ~cond; {2694#false} is VALID [2018-11-23 13:07:19,823 INFO L273 TraceCheckUtils]: 63: Hoare triple {2694#false} assume !false; {2694#false} is VALID [2018-11-23 13:07:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 13:07:19,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:19,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:19,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:34,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:07:34,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:34,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:35,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {2693#true} call ULTIMATE.init(); {2693#true} is VALID [2018-11-23 13:07:35,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {2693#true} assume true; {2693#true} is VALID [2018-11-23 13:07:35,073 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2693#true} {2693#true} #35#return; {2693#true} is VALID [2018-11-23 13:07:35,074 INFO L256 TraceCheckUtils]: 3: Hoare triple {2693#true} call #t~ret1 := main(); {2693#true} is VALID [2018-11-23 13:07:35,074 INFO L273 TraceCheckUtils]: 4: Hoare triple {2693#true} ~x~0 := 0; {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:35,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:35,077 INFO L256 TraceCheckUtils]: 6: Hoare triple {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,080 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {2697#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:35,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {2697#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:35,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:35,081 INFO L256 TraceCheckUtils]: 12: Hoare triple {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,083 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {2699#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:35,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:35,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:35,085 INFO L256 TraceCheckUtils]: 18: Hoare triple {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,086 INFO L273 TraceCheckUtils]: 19: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,088 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {2701#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:35,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {2701#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:35,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:35,089 INFO L256 TraceCheckUtils]: 24: Hoare triple {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,091 INFO L273 TraceCheckUtils]: 26: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,092 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {2703#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:35,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {2703#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:35,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:35,094 INFO L256 TraceCheckUtils]: 30: Hoare triple {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,096 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {2705#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:35,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {2705#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:35,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:35,098 INFO L256 TraceCheckUtils]: 36: Hoare triple {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,101 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {2707#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:35,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {2707#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:35,102 INFO L273 TraceCheckUtils]: 41: Hoare triple {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:35,102 INFO L256 TraceCheckUtils]: 42: Hoare triple {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,103 INFO L273 TraceCheckUtils]: 43: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,104 INFO L273 TraceCheckUtils]: 44: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,105 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {2709#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:35,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {2709#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:35,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:35,107 INFO L256 TraceCheckUtils]: 48: Hoare triple {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,109 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {2711#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:35,110 INFO L273 TraceCheckUtils]: 52: Hoare triple {2711#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:35,111 INFO L273 TraceCheckUtils]: 53: Hoare triple {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:35,111 INFO L256 TraceCheckUtils]: 54: Hoare triple {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:07:35,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,113 INFO L273 TraceCheckUtils]: 56: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:35,114 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {2713#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:35,115 INFO L273 TraceCheckUtils]: 58: Hoare triple {2713#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {2892#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:35,115 INFO L273 TraceCheckUtils]: 59: Hoare triple {2892#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2694#false} is VALID [2018-11-23 13:07:35,116 INFO L256 TraceCheckUtils]: 60: Hoare triple {2694#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)); {2694#false} is VALID [2018-11-23 13:07:35,116 INFO L273 TraceCheckUtils]: 61: Hoare triple {2694#false} ~cond := #in~cond; {2694#false} is VALID [2018-11-23 13:07:35,116 INFO L273 TraceCheckUtils]: 62: Hoare triple {2694#false} assume 0 == ~cond; {2694#false} is VALID [2018-11-23 13:07:35,116 INFO L273 TraceCheckUtils]: 63: Hoare triple {2694#false} assume !false; {2694#false} is VALID [2018-11-23 13:07:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 13:07:35,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:35,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:07:35,143 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-11-23 13:07:35,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:35,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:07:35,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:35,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:07:35,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:07:35,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:35,191 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 23 states. [2018-11-23 13:07:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,513 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 13:07:37,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:07:37,513 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-11-23 13:07:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2018-11-23 13:07:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2018-11-23 13:07:37,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 61 transitions. [2018-11-23 13:07:37,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:37,596 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:07:37,596 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:07:37,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:07:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:07:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 13:07:37,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:37,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-23 13:07:37,691 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-23 13:07:37,691 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-23 13:07:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,693 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 13:07:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 13:07:37,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:37,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:37,693 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-23 13:07:37,693 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-23 13:07:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,695 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 13:07:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 13:07:37,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:37,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:37,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:37,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:07:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 13:07:37,698 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 64 [2018-11-23 13:07:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:37,698 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 13:07:37,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:07:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:07:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 13:07:37,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:37,700 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:37,700 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:37,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1577839588, now seen corresponding path program 10 times [2018-11-23 13:07:37,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:37,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:37,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:38,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {3171#true} call ULTIMATE.init(); {3171#true} is VALID [2018-11-23 13:07:38,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {3171#true} assume true; {3171#true} is VALID [2018-11-23 13:07:38,443 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3171#true} {3171#true} #35#return; {3171#true} is VALID [2018-11-23 13:07:38,443 INFO L256 TraceCheckUtils]: 3: Hoare triple {3171#true} call #t~ret1 := main(); {3171#true} is VALID [2018-11-23 13:07:38,444 INFO L273 TraceCheckUtils]: 4: Hoare triple {3171#true} ~x~0 := 0; {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:38,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:38,445 INFO L256 TraceCheckUtils]: 6: Hoare triple {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,447 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {3175#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:38,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {3175#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:38,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:38,450 INFO L256 TraceCheckUtils]: 12: Hoare triple {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,452 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {3177#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:38,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {3177#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:38,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:38,454 INFO L256 TraceCheckUtils]: 18: Hoare triple {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,454 INFO L273 TraceCheckUtils]: 19: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,490 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {3179#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:38,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {3179#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:38,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:38,491 INFO L256 TraceCheckUtils]: 24: Hoare triple {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,494 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {3181#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:38,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {3181#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:38,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:38,495 INFO L256 TraceCheckUtils]: 30: Hoare triple {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,496 INFO L273 TraceCheckUtils]: 32: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,498 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {3183#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:38,498 INFO L273 TraceCheckUtils]: 34: Hoare triple {3183#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:38,499 INFO L273 TraceCheckUtils]: 35: Hoare triple {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:38,499 INFO L256 TraceCheckUtils]: 36: Hoare triple {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,500 INFO L273 TraceCheckUtils]: 37: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,501 INFO L273 TraceCheckUtils]: 38: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,502 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {3185#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:38,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {3185#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:38,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:38,529 INFO L256 TraceCheckUtils]: 42: Hoare triple {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,543 INFO L273 TraceCheckUtils]: 43: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,552 INFO L273 TraceCheckUtils]: 44: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,567 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {3187#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:38,575 INFO L273 TraceCheckUtils]: 46: Hoare triple {3187#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:38,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:38,576 INFO L256 TraceCheckUtils]: 48: Hoare triple {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,577 INFO L273 TraceCheckUtils]: 49: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,580 INFO L273 TraceCheckUtils]: 50: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,581 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {3189#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:38,582 INFO L273 TraceCheckUtils]: 52: Hoare triple {3189#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:38,582 INFO L273 TraceCheckUtils]: 53: Hoare triple {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:38,582 INFO L256 TraceCheckUtils]: 54: Hoare triple {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,583 INFO L273 TraceCheckUtils]: 56: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,584 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {3191#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:38,585 INFO L273 TraceCheckUtils]: 58: Hoare triple {3191#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:38,586 INFO L273 TraceCheckUtils]: 59: Hoare triple {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:38,586 INFO L256 TraceCheckUtils]: 60: Hoare triple {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:38,599 INFO L273 TraceCheckUtils]: 61: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,599 INFO L273 TraceCheckUtils]: 62: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:38,600 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {3193#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:07:38,601 INFO L273 TraceCheckUtils]: 64: Hoare triple {3193#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3194#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:38,602 INFO L273 TraceCheckUtils]: 65: Hoare triple {3194#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {3172#false} is VALID [2018-11-23 13:07:38,602 INFO L256 TraceCheckUtils]: 66: Hoare triple {3172#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)); {3172#false} is VALID [2018-11-23 13:07:38,602 INFO L273 TraceCheckUtils]: 67: Hoare triple {3172#false} ~cond := #in~cond; {3172#false} is VALID [2018-11-23 13:07:38,602 INFO L273 TraceCheckUtils]: 68: Hoare triple {3172#false} assume 0 == ~cond; {3172#false} is VALID [2018-11-23 13:07:38,602 INFO L273 TraceCheckUtils]: 69: Hoare triple {3172#false} assume !false; {3172#false} is VALID [2018-11-23 13:07:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 13:07:38,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:38,611 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:07:38,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:38,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:38,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:38,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:39,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {3171#true} call ULTIMATE.init(); {3171#true} is VALID [2018-11-23 13:07:39,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {3171#true} assume true; {3171#true} is VALID [2018-11-23 13:07:39,044 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3171#true} {3171#true} #35#return; {3171#true} is VALID [2018-11-23 13:07:39,045 INFO L256 TraceCheckUtils]: 3: Hoare triple {3171#true} call #t~ret1 := main(); {3171#true} is VALID [2018-11-23 13:07:39,045 INFO L273 TraceCheckUtils]: 4: Hoare triple {3171#true} ~x~0 := 0; {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:39,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:39,045 INFO L256 TraceCheckUtils]: 6: Hoare triple {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,049 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {3175#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:39,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {3175#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:39,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:39,050 INFO L256 TraceCheckUtils]: 12: Hoare triple {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,054 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {3177#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:39,054 INFO L273 TraceCheckUtils]: 16: Hoare triple {3177#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:39,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:39,055 INFO L256 TraceCheckUtils]: 18: Hoare triple {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,075 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {3179#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:39,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {3179#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:39,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:39,097 INFO L256 TraceCheckUtils]: 24: Hoare triple {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,129 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {3181#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:39,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {3181#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:39,151 INFO L273 TraceCheckUtils]: 29: Hoare triple {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:39,152 INFO L256 TraceCheckUtils]: 30: Hoare triple {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,164 INFO L273 TraceCheckUtils]: 31: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,190 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {3183#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:39,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {3183#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:39,214 INFO L273 TraceCheckUtils]: 35: Hoare triple {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:39,214 INFO L256 TraceCheckUtils]: 36: Hoare triple {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,229 INFO L273 TraceCheckUtils]: 37: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,239 INFO L273 TraceCheckUtils]: 38: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,249 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {3185#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:39,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {3185#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:39,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:39,273 INFO L256 TraceCheckUtils]: 42: Hoare triple {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,287 INFO L273 TraceCheckUtils]: 43: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,296 INFO L273 TraceCheckUtils]: 44: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,301 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {3187#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:39,301 INFO L273 TraceCheckUtils]: 46: Hoare triple {3187#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:39,303 INFO L273 TraceCheckUtils]: 47: Hoare triple {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:39,303 INFO L256 TraceCheckUtils]: 48: Hoare triple {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,303 INFO L273 TraceCheckUtils]: 49: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,305 INFO L273 TraceCheckUtils]: 50: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,306 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {3189#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:39,307 INFO L273 TraceCheckUtils]: 52: Hoare triple {3189#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:39,307 INFO L273 TraceCheckUtils]: 53: Hoare triple {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:39,307 INFO L256 TraceCheckUtils]: 54: Hoare triple {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,309 INFO L273 TraceCheckUtils]: 55: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,309 INFO L273 TraceCheckUtils]: 56: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,311 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {3191#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:39,311 INFO L273 TraceCheckUtils]: 58: Hoare triple {3191#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:39,313 INFO L273 TraceCheckUtils]: 59: Hoare triple {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:39,313 INFO L256 TraceCheckUtils]: 60: Hoare triple {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:07:39,313 INFO L273 TraceCheckUtils]: 61: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,315 INFO L273 TraceCheckUtils]: 62: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:39,316 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {3193#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:07:39,321 INFO L273 TraceCheckUtils]: 64: Hoare triple {3193#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3390#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:39,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {3390#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {3172#false} is VALID [2018-11-23 13:07:39,324 INFO L256 TraceCheckUtils]: 66: Hoare triple {3172#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)); {3172#false} is VALID [2018-11-23 13:07:39,324 INFO L273 TraceCheckUtils]: 67: Hoare triple {3172#false} ~cond := #in~cond; {3172#false} is VALID [2018-11-23 13:07:39,324 INFO L273 TraceCheckUtils]: 68: Hoare triple {3172#false} assume 0 == ~cond; {3172#false} is VALID [2018-11-23 13:07:39,324 INFO L273 TraceCheckUtils]: 69: Hoare triple {3172#false} assume !false; {3172#false} is VALID [2018-11-23 13:07:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 13:07:39,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:39,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:07:39,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2018-11-23 13:07:39,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:39,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:07:39,413 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:07:39,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:07:39,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:07:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:07:39,414 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 25 states. [2018-11-23 13:07:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:42,534 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 13:07:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:07:42,535 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2018-11-23 13:07:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:07:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2018-11-23 13:07:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:07:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2018-11-23 13:07:42,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2018-11-23 13:07:42,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:42,650 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:07:42,651 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:07:42,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:07:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:07:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 13:07:42,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:42,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 13:07:42,691 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 13:07:42,691 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 13:07:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:42,693 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 13:07:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-11-23 13:07:42,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:42,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:42,694 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 13:07:42,694 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 13:07:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:42,696 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 13:07:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-11-23 13:07:42,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:42,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:42,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:42,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:07:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-23 13:07:42,699 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 70 [2018-11-23 13:07:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:42,699 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-23 13:07:42,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:07:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 13:07:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 13:07:42,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:42,701 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:42,701 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:42,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash 153476482, now seen corresponding path program 11 times [2018-11-23 13:07:42,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:42,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:42,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:43,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {3687#true} call ULTIMATE.init(); {3687#true} is VALID [2018-11-23 13:07:43,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {3687#true} assume true; {3687#true} is VALID [2018-11-23 13:07:43,746 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3687#true} {3687#true} #35#return; {3687#true} is VALID [2018-11-23 13:07:43,746 INFO L256 TraceCheckUtils]: 3: Hoare triple {3687#true} call #t~ret1 := main(); {3687#true} is VALID [2018-11-23 13:07:43,747 INFO L273 TraceCheckUtils]: 4: Hoare triple {3687#true} ~x~0 := 0; {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:43,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:43,748 INFO L256 TraceCheckUtils]: 6: Hoare triple {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,751 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {3691#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:43,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {3691#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:43,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:43,753 INFO L256 TraceCheckUtils]: 12: Hoare triple {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,755 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {3693#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:43,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {3693#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:43,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:43,757 INFO L256 TraceCheckUtils]: 18: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,760 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {3695#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:43,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {3695#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:43,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:43,761 INFO L256 TraceCheckUtils]: 24: Hoare triple {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,764 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {3697#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:43,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {3697#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:43,765 INFO L273 TraceCheckUtils]: 29: Hoare triple {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:43,766 INFO L256 TraceCheckUtils]: 30: Hoare triple {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,767 INFO L273 TraceCheckUtils]: 32: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,768 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {3699#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:43,769 INFO L273 TraceCheckUtils]: 34: Hoare triple {3699#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:43,770 INFO L273 TraceCheckUtils]: 35: Hoare triple {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:43,770 INFO L256 TraceCheckUtils]: 36: Hoare triple {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,771 INFO L273 TraceCheckUtils]: 37: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,771 INFO L273 TraceCheckUtils]: 38: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,773 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {3701#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:43,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {3701#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:43,774 INFO L273 TraceCheckUtils]: 41: Hoare triple {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:43,774 INFO L256 TraceCheckUtils]: 42: Hoare triple {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,775 INFO L273 TraceCheckUtils]: 43: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,776 INFO L273 TraceCheckUtils]: 44: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,777 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {3703#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:43,778 INFO L273 TraceCheckUtils]: 46: Hoare triple {3703#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:43,778 INFO L273 TraceCheckUtils]: 47: Hoare triple {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:43,779 INFO L256 TraceCheckUtils]: 48: Hoare triple {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,779 INFO L273 TraceCheckUtils]: 49: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,780 INFO L273 TraceCheckUtils]: 50: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,781 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {3705#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:43,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {3705#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:43,783 INFO L273 TraceCheckUtils]: 53: Hoare triple {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:43,783 INFO L256 TraceCheckUtils]: 54: Hoare triple {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,784 INFO L273 TraceCheckUtils]: 55: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,785 INFO L273 TraceCheckUtils]: 56: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,786 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {3707#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:43,787 INFO L273 TraceCheckUtils]: 58: Hoare triple {3707#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:43,787 INFO L273 TraceCheckUtils]: 59: Hoare triple {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:43,787 INFO L256 TraceCheckUtils]: 60: Hoare triple {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,788 INFO L273 TraceCheckUtils]: 61: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,789 INFO L273 TraceCheckUtils]: 62: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,790 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {3709#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:07:43,791 INFO L273 TraceCheckUtils]: 64: Hoare triple {3709#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:43,792 INFO L273 TraceCheckUtils]: 65: Hoare triple {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:43,792 INFO L256 TraceCheckUtils]: 66: Hoare triple {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:07:43,793 INFO L273 TraceCheckUtils]: 67: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,793 INFO L273 TraceCheckUtils]: 68: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:43,795 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {3711#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:07:43,796 INFO L273 TraceCheckUtils]: 70: Hoare triple {3711#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {3712#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:43,796 INFO L273 TraceCheckUtils]: 71: Hoare triple {3712#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3688#false} is VALID [2018-11-23 13:07:43,797 INFO L256 TraceCheckUtils]: 72: Hoare triple {3688#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)); {3688#false} is VALID [2018-11-23 13:07:43,797 INFO L273 TraceCheckUtils]: 73: Hoare triple {3688#false} ~cond := #in~cond; {3688#false} is VALID [2018-11-23 13:07:43,797 INFO L273 TraceCheckUtils]: 74: Hoare triple {3688#false} assume 0 == ~cond; {3688#false} is VALID [2018-11-23 13:07:43,797 INFO L273 TraceCheckUtils]: 75: Hoare triple {3688#false} assume !false; {3688#false} is VALID [2018-11-23 13:07:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 13:07:43,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:43,806 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:07:43,815 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:08:43,261 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:08:43,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:43,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:43,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {3687#true} call ULTIMATE.init(); {3687#true} is VALID [2018-11-23 13:08:43,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {3687#true} assume true; {3687#true} is VALID [2018-11-23 13:08:43,697 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3687#true} {3687#true} #35#return; {3687#true} is VALID [2018-11-23 13:08:43,698 INFO L256 TraceCheckUtils]: 3: Hoare triple {3687#true} call #t~ret1 := main(); {3687#true} is VALID [2018-11-23 13:08:43,698 INFO L273 TraceCheckUtils]: 4: Hoare triple {3687#true} ~x~0 := 0; {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:43,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:43,699 INFO L256 TraceCheckUtils]: 6: Hoare triple {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,701 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {3691#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:08:43,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {3691#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:43,702 INFO L273 TraceCheckUtils]: 11: Hoare triple {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:43,702 INFO L256 TraceCheckUtils]: 12: Hoare triple {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,705 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {3693#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:08:43,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {3693#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:43,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:43,707 INFO L256 TraceCheckUtils]: 18: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,710 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {3695#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:08:43,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {3695#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:43,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:43,712 INFO L256 TraceCheckUtils]: 24: Hoare triple {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,715 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {3697#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:08:43,716 INFO L273 TraceCheckUtils]: 28: Hoare triple {3697#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:43,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:43,717 INFO L256 TraceCheckUtils]: 30: Hoare triple {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,718 INFO L273 TraceCheckUtils]: 31: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,719 INFO L273 TraceCheckUtils]: 32: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,720 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {3699#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:08:43,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {3699#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:43,722 INFO L273 TraceCheckUtils]: 35: Hoare triple {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:43,722 INFO L256 TraceCheckUtils]: 36: Hoare triple {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,723 INFO L273 TraceCheckUtils]: 37: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,723 INFO L273 TraceCheckUtils]: 38: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,725 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {3701#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:08:43,726 INFO L273 TraceCheckUtils]: 40: Hoare triple {3701#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:43,726 INFO L273 TraceCheckUtils]: 41: Hoare triple {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:43,727 INFO L256 TraceCheckUtils]: 42: Hoare triple {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,728 INFO L273 TraceCheckUtils]: 43: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,728 INFO L273 TraceCheckUtils]: 44: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,730 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {3703#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:08:43,731 INFO L273 TraceCheckUtils]: 46: Hoare triple {3703#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:43,731 INFO L273 TraceCheckUtils]: 47: Hoare triple {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:43,732 INFO L256 TraceCheckUtils]: 48: Hoare triple {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,733 INFO L273 TraceCheckUtils]: 49: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,733 INFO L273 TraceCheckUtils]: 50: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,735 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {3705#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:08:43,736 INFO L273 TraceCheckUtils]: 52: Hoare triple {3705#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:43,736 INFO L273 TraceCheckUtils]: 53: Hoare triple {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:43,737 INFO L256 TraceCheckUtils]: 54: Hoare triple {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,737 INFO L273 TraceCheckUtils]: 55: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,738 INFO L273 TraceCheckUtils]: 56: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,740 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {3707#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:08:43,740 INFO L273 TraceCheckUtils]: 58: Hoare triple {3707#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:43,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:43,741 INFO L256 TraceCheckUtils]: 60: Hoare triple {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,742 INFO L273 TraceCheckUtils]: 61: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,743 INFO L273 TraceCheckUtils]: 62: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,745 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {3709#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:08:43,745 INFO L273 TraceCheckUtils]: 64: Hoare triple {3709#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:43,746 INFO L273 TraceCheckUtils]: 65: Hoare triple {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:43,746 INFO L256 TraceCheckUtils]: 66: Hoare triple {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:08:43,747 INFO L273 TraceCheckUtils]: 67: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,748 INFO L273 TraceCheckUtils]: 68: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:43,750 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {3711#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:08:43,750 INFO L273 TraceCheckUtils]: 70: Hoare triple {3711#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {3926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:43,751 INFO L273 TraceCheckUtils]: 71: Hoare triple {3926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3688#false} is VALID [2018-11-23 13:08:43,752 INFO L256 TraceCheckUtils]: 72: Hoare triple {3688#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)); {3688#false} is VALID [2018-11-23 13:08:43,752 INFO L273 TraceCheckUtils]: 73: Hoare triple {3688#false} ~cond := #in~cond; {3688#false} is VALID [2018-11-23 13:08:43,752 INFO L273 TraceCheckUtils]: 74: Hoare triple {3688#false} assume 0 == ~cond; {3688#false} is VALID [2018-11-23 13:08:43,752 INFO L273 TraceCheckUtils]: 75: Hoare triple {3688#false} assume !false; {3688#false} is VALID [2018-11-23 13:08:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 13:08:43,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:43,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 13:08:43,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-11-23 13:08:43,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:43,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:08:43,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:43,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:08:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:08:43,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:08:43,842 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 27 states. [2018-11-23 13:08:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:46,863 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 13:08:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:08:46,864 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-11-23 13:08:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:08:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2018-11-23 13:08:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:08:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2018-11-23 13:08:46,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 69 transitions. [2018-11-23 13:08:47,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:47,157 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:08:47,157 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:08:47,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 74 SyntacticMatches, 13 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:08:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:08:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 13:08:47,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:47,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-23 13:08:47,201 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-23 13:08:47,201 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-23 13:08:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,203 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-23 13:08:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-11-23 13:08:47,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:47,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:47,204 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-23 13:08:47,204 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-23 13:08:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,207 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-23 13:08:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-11-23 13:08:47,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:47,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:47,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:47,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:08:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-23 13:08:47,210 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 76 [2018-11-23 13:08:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:47,210 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-23 13:08:47,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:08:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-23 13:08:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 13:08:47,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:47,211 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:47,212 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:47,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1587568480, now seen corresponding path program 12 times [2018-11-23 13:08:47,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:47,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:47,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:47,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:47,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:48,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-23 13:08:48,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-23 13:08:48,091 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4241#true} {4241#true} #35#return; {4241#true} is VALID [2018-11-23 13:08:48,091 INFO L256 TraceCheckUtils]: 3: Hoare triple {4241#true} call #t~ret1 := main(); {4241#true} is VALID [2018-11-23 13:08:48,091 INFO L273 TraceCheckUtils]: 4: Hoare triple {4241#true} ~x~0 := 0; {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:48,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:48,092 INFO L256 TraceCheckUtils]: 6: Hoare triple {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,096 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {4245#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:08:48,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {4245#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:48,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:48,098 INFO L256 TraceCheckUtils]: 12: Hoare triple {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,102 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {4247#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {4247#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:48,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:48,104 INFO L256 TraceCheckUtils]: 18: Hoare triple {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,107 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {4249#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {4249#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:48,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:48,109 INFO L256 TraceCheckUtils]: 24: Hoare triple {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,110 INFO L273 TraceCheckUtils]: 26: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,113 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {4251#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {4251#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:48,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:48,114 INFO L256 TraceCheckUtils]: 30: Hoare triple {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,118 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {4253#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,119 INFO L273 TraceCheckUtils]: 34: Hoare triple {4253#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:48,120 INFO L273 TraceCheckUtils]: 35: Hoare triple {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:48,120 INFO L256 TraceCheckUtils]: 36: Hoare triple {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,120 INFO L273 TraceCheckUtils]: 37: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,121 INFO L273 TraceCheckUtils]: 38: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,123 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {4255#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,123 INFO L273 TraceCheckUtils]: 40: Hoare triple {4255#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:48,124 INFO L273 TraceCheckUtils]: 41: Hoare triple {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:48,124 INFO L256 TraceCheckUtils]: 42: Hoare triple {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,125 INFO L273 TraceCheckUtils]: 43: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,128 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {4257#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,129 INFO L273 TraceCheckUtils]: 46: Hoare triple {4257#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:48,130 INFO L273 TraceCheckUtils]: 47: Hoare triple {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:48,130 INFO L256 TraceCheckUtils]: 48: Hoare triple {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,131 INFO L273 TraceCheckUtils]: 49: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,132 INFO L273 TraceCheckUtils]: 50: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,134 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {4259#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:08:48,135 INFO L273 TraceCheckUtils]: 52: Hoare triple {4259#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:48,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:48,136 INFO L256 TraceCheckUtils]: 54: Hoare triple {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,139 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {4261#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:08:48,140 INFO L273 TraceCheckUtils]: 58: Hoare triple {4261#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:48,141 INFO L273 TraceCheckUtils]: 59: Hoare triple {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:48,141 INFO L256 TraceCheckUtils]: 60: Hoare triple {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,142 INFO L273 TraceCheckUtils]: 61: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,143 INFO L273 TraceCheckUtils]: 62: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,145 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {4263#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:08:48,146 INFO L273 TraceCheckUtils]: 64: Hoare triple {4263#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:48,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:48,148 INFO L256 TraceCheckUtils]: 66: Hoare triple {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,149 INFO L273 TraceCheckUtils]: 67: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,152 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {4265#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:08:48,153 INFO L273 TraceCheckUtils]: 70: Hoare triple {4265#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:48,154 INFO L273 TraceCheckUtils]: 71: Hoare triple {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:48,154 INFO L256 TraceCheckUtils]: 72: Hoare triple {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,155 INFO L273 TraceCheckUtils]: 73: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,156 INFO L273 TraceCheckUtils]: 74: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,159 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {4267#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,160 INFO L273 TraceCheckUtils]: 76: Hoare triple {4267#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4268#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:48,161 INFO L273 TraceCheckUtils]: 77: Hoare triple {4268#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4242#false} is VALID [2018-11-23 13:08:48,161 INFO L256 TraceCheckUtils]: 78: Hoare triple {4242#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)); {4242#false} is VALID [2018-11-23 13:08:48,161 INFO L273 TraceCheckUtils]: 79: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-23 13:08:48,161 INFO L273 TraceCheckUtils]: 80: Hoare triple {4242#false} assume 0 == ~cond; {4242#false} is VALID [2018-11-23 13:08:48,162 INFO L273 TraceCheckUtils]: 81: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-23 13:08:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-23 13:08:48,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:48,176 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:08:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:08:48,377 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:08:48,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:48,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:48,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-23 13:08:48,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-23 13:08:48,854 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4241#true} {4241#true} #35#return; {4241#true} is VALID [2018-11-23 13:08:48,854 INFO L256 TraceCheckUtils]: 3: Hoare triple {4241#true} call #t~ret1 := main(); {4241#true} is VALID [2018-11-23 13:08:48,855 INFO L273 TraceCheckUtils]: 4: Hoare triple {4241#true} ~x~0 := 0; {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:48,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:48,856 INFO L256 TraceCheckUtils]: 6: Hoare triple {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,857 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {4245#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:08:48,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {4245#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:48,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:48,859 INFO L256 TraceCheckUtils]: 12: Hoare triple {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,861 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {4247#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {4247#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:48,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:48,863 INFO L256 TraceCheckUtils]: 18: Hoare triple {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,865 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {4249#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {4249#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:48,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:48,867 INFO L256 TraceCheckUtils]: 24: Hoare triple {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,869 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {4251#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {4251#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:48,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:48,871 INFO L256 TraceCheckUtils]: 30: Hoare triple {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,873 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {4253#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {4253#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:48,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:48,875 INFO L256 TraceCheckUtils]: 36: Hoare triple {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,876 INFO L273 TraceCheckUtils]: 38: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,877 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {4255#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {4255#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:48,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:48,879 INFO L256 TraceCheckUtils]: 42: Hoare triple {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,880 INFO L273 TraceCheckUtils]: 43: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,880 INFO L273 TraceCheckUtils]: 44: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,881 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {4257#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,882 INFO L273 TraceCheckUtils]: 46: Hoare triple {4257#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:48,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:48,883 INFO L256 TraceCheckUtils]: 48: Hoare triple {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,884 INFO L273 TraceCheckUtils]: 49: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,884 INFO L273 TraceCheckUtils]: 50: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,885 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {4259#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:08:48,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {4259#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:48,887 INFO L273 TraceCheckUtils]: 53: Hoare triple {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:48,887 INFO L256 TraceCheckUtils]: 54: Hoare triple {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,888 INFO L273 TraceCheckUtils]: 55: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,888 INFO L273 TraceCheckUtils]: 56: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,890 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {4261#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:08:48,890 INFO L273 TraceCheckUtils]: 58: Hoare triple {4261#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:48,891 INFO L273 TraceCheckUtils]: 59: Hoare triple {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:48,891 INFO L256 TraceCheckUtils]: 60: Hoare triple {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,892 INFO L273 TraceCheckUtils]: 61: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,892 INFO L273 TraceCheckUtils]: 62: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,894 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {4263#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:08:48,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {4263#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:48,895 INFO L273 TraceCheckUtils]: 65: Hoare triple {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:48,895 INFO L256 TraceCheckUtils]: 66: Hoare triple {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,896 INFO L273 TraceCheckUtils]: 67: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,897 INFO L273 TraceCheckUtils]: 68: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,898 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {4265#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:08:48,899 INFO L273 TraceCheckUtils]: 70: Hoare triple {4265#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:48,899 INFO L273 TraceCheckUtils]: 71: Hoare triple {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:48,900 INFO L256 TraceCheckUtils]: 72: Hoare triple {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:08:48,900 INFO L273 TraceCheckUtils]: 73: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,901 INFO L273 TraceCheckUtils]: 74: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:48,902 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {4267#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:08:48,903 INFO L273 TraceCheckUtils]: 76: Hoare triple {4267#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4500#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:48,904 INFO L273 TraceCheckUtils]: 77: Hoare triple {4500#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4242#false} is VALID [2018-11-23 13:08:48,904 INFO L256 TraceCheckUtils]: 78: Hoare triple {4242#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)); {4242#false} is VALID [2018-11-23 13:08:48,904 INFO L273 TraceCheckUtils]: 79: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-23 13:08:48,905 INFO L273 TraceCheckUtils]: 80: Hoare triple {4242#false} assume 0 == ~cond; {4242#false} is VALID [2018-11-23 13:08:48,905 INFO L273 TraceCheckUtils]: 81: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-23 13:08:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-23 13:08:48,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:48,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 13:08:48,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-11-23 13:08:48,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:48,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:08:49,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:49,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:08:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:08:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:08:49,004 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 29 states. [2018-11-23 13:08:51,673 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 13:08:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:55,929 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 13:08:55,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:08:55,929 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-11-23 13:08:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:08:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2018-11-23 13:08:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:08:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2018-11-23 13:08:55,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 73 transitions. [2018-11-23 13:08:56,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:56,135 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:08:56,135 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:08:56,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 80 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=128, Invalid=1512, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:08:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:08:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-23 13:08:56,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:56,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-23 13:08:56,252 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-23 13:08:56,252 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-23 13:08:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:56,254 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2018-11-23 13:08:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-23 13:08:56,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:56,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:56,255 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-23 13:08:56,255 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-23 13:08:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:56,257 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2018-11-23 13:08:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-23 13:08:56,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:56,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:56,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:56,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:08:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-23 13:08:56,260 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 82 [2018-11-23 13:08:56,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:56,260 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-23 13:08:56,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:08:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-23 13:08:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 13:08:56,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:56,261 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:56,262 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:56,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash -50981570, now seen corresponding path program 13 times [2018-11-23 13:08:56,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:56,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:56,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:56,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:56,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:57,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {4833#true} call ULTIMATE.init(); {4833#true} is VALID [2018-11-23 13:08:57,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {4833#true} assume true; {4833#true} is VALID [2018-11-23 13:08:57,240 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4833#true} {4833#true} #35#return; {4833#true} is VALID [2018-11-23 13:08:57,240 INFO L256 TraceCheckUtils]: 3: Hoare triple {4833#true} call #t~ret1 := main(); {4833#true} is VALID [2018-11-23 13:08:57,262 INFO L273 TraceCheckUtils]: 4: Hoare triple {4833#true} ~x~0 := 0; {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:57,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:57,263 INFO L256 TraceCheckUtils]: 6: Hoare triple {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,266 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {4837#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:08:57,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {4837#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:57,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:57,267 INFO L256 TraceCheckUtils]: 12: Hoare triple {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,270 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {4839#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {4839#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:57,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:57,272 INFO L256 TraceCheckUtils]: 18: Hoare triple {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,273 INFO L273 TraceCheckUtils]: 20: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,275 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {4841#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,276 INFO L273 TraceCheckUtils]: 22: Hoare triple {4841#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:57,277 INFO L273 TraceCheckUtils]: 23: Hoare triple {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:57,277 INFO L256 TraceCheckUtils]: 24: Hoare triple {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,280 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {4843#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,281 INFO L273 TraceCheckUtils]: 28: Hoare triple {4843#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:57,282 INFO L273 TraceCheckUtils]: 29: Hoare triple {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:57,282 INFO L256 TraceCheckUtils]: 30: Hoare triple {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,283 INFO L273 TraceCheckUtils]: 32: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,285 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {4845#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {4845#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:57,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:57,287 INFO L256 TraceCheckUtils]: 36: Hoare triple {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,290 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {4847#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,291 INFO L273 TraceCheckUtils]: 40: Hoare triple {4847#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:57,292 INFO L273 TraceCheckUtils]: 41: Hoare triple {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:57,292 INFO L256 TraceCheckUtils]: 42: Hoare triple {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,293 INFO L273 TraceCheckUtils]: 43: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,293 INFO L273 TraceCheckUtils]: 44: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,295 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {4849#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,296 INFO L273 TraceCheckUtils]: 46: Hoare triple {4849#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:57,297 INFO L273 TraceCheckUtils]: 47: Hoare triple {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:57,297 INFO L256 TraceCheckUtils]: 48: Hoare triple {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,298 INFO L273 TraceCheckUtils]: 49: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,298 INFO L273 TraceCheckUtils]: 50: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,300 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {4851#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:08:57,301 INFO L273 TraceCheckUtils]: 52: Hoare triple {4851#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:57,302 INFO L273 TraceCheckUtils]: 53: Hoare triple {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:57,302 INFO L256 TraceCheckUtils]: 54: Hoare triple {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,303 INFO L273 TraceCheckUtils]: 55: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,303 INFO L273 TraceCheckUtils]: 56: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,305 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {4853#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:08:57,306 INFO L273 TraceCheckUtils]: 58: Hoare triple {4853#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:57,307 INFO L273 TraceCheckUtils]: 59: Hoare triple {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:57,307 INFO L256 TraceCheckUtils]: 60: Hoare triple {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,308 INFO L273 TraceCheckUtils]: 61: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,308 INFO L273 TraceCheckUtils]: 62: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,310 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {4855#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:08:57,311 INFO L273 TraceCheckUtils]: 64: Hoare triple {4855#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:57,312 INFO L273 TraceCheckUtils]: 65: Hoare triple {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:57,312 INFO L256 TraceCheckUtils]: 66: Hoare triple {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,313 INFO L273 TraceCheckUtils]: 67: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,313 INFO L273 TraceCheckUtils]: 68: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,315 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {4857#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:08:57,316 INFO L273 TraceCheckUtils]: 70: Hoare triple {4857#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:57,317 INFO L273 TraceCheckUtils]: 71: Hoare triple {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:57,317 INFO L256 TraceCheckUtils]: 72: Hoare triple {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,318 INFO L273 TraceCheckUtils]: 73: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,318 INFO L273 TraceCheckUtils]: 74: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,320 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {4859#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,321 INFO L273 TraceCheckUtils]: 76: Hoare triple {4859#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:57,322 INFO L273 TraceCheckUtils]: 77: Hoare triple {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:57,322 INFO L256 TraceCheckUtils]: 78: Hoare triple {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,323 INFO L273 TraceCheckUtils]: 79: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,324 INFO L273 TraceCheckUtils]: 80: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,325 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {4861#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:08:57,326 INFO L273 TraceCheckUtils]: 82: Hoare triple {4861#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {4862#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:57,327 INFO L273 TraceCheckUtils]: 83: Hoare triple {4862#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4834#false} is VALID [2018-11-23 13:08:57,328 INFO L256 TraceCheckUtils]: 84: Hoare triple {4834#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)); {4834#false} is VALID [2018-11-23 13:08:57,328 INFO L273 TraceCheckUtils]: 85: Hoare triple {4834#false} ~cond := #in~cond; {4834#false} is VALID [2018-11-23 13:08:57,328 INFO L273 TraceCheckUtils]: 86: Hoare triple {4834#false} assume 0 == ~cond; {4834#false} is VALID [2018-11-23 13:08:57,328 INFO L273 TraceCheckUtils]: 87: Hoare triple {4834#false} assume !false; {4834#false} is VALID [2018-11-23 13:08:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-23 13:08:57,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:57,344 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:08:57,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:57,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:57,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {4833#true} call ULTIMATE.init(); {4833#true} is VALID [2018-11-23 13:08:57,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {4833#true} assume true; {4833#true} is VALID [2018-11-23 13:08:57,873 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4833#true} {4833#true} #35#return; {4833#true} is VALID [2018-11-23 13:08:57,873 INFO L256 TraceCheckUtils]: 3: Hoare triple {4833#true} call #t~ret1 := main(); {4833#true} is VALID [2018-11-23 13:08:57,874 INFO L273 TraceCheckUtils]: 4: Hoare triple {4833#true} ~x~0 := 0; {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:57,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:57,875 INFO L256 TraceCheckUtils]: 6: Hoare triple {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,878 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {4837#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:08:57,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {4837#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:57,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:57,880 INFO L256 TraceCheckUtils]: 12: Hoare triple {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,883 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {4839#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {4839#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:57,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:57,885 INFO L256 TraceCheckUtils]: 18: Hoare triple {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,888 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {4841#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,889 INFO L273 TraceCheckUtils]: 22: Hoare triple {4841#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:57,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:57,890 INFO L256 TraceCheckUtils]: 24: Hoare triple {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,895 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {4843#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {4843#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:57,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:57,897 INFO L256 TraceCheckUtils]: 30: Hoare triple {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,898 INFO L273 TraceCheckUtils]: 32: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,900 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {4845#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {4845#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:57,902 INFO L273 TraceCheckUtils]: 35: Hoare triple {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:57,902 INFO L256 TraceCheckUtils]: 36: Hoare triple {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,903 INFO L273 TraceCheckUtils]: 37: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,903 INFO L273 TraceCheckUtils]: 38: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,904 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {4847#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,905 INFO L273 TraceCheckUtils]: 40: Hoare triple {4847#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:57,906 INFO L273 TraceCheckUtils]: 41: Hoare triple {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:57,906 INFO L256 TraceCheckUtils]: 42: Hoare triple {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,909 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {4849#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,910 INFO L273 TraceCheckUtils]: 46: Hoare triple {4849#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:57,911 INFO L273 TraceCheckUtils]: 47: Hoare triple {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:57,911 INFO L256 TraceCheckUtils]: 48: Hoare triple {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,912 INFO L273 TraceCheckUtils]: 49: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,912 INFO L273 TraceCheckUtils]: 50: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,914 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {4851#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:08:57,915 INFO L273 TraceCheckUtils]: 52: Hoare triple {4851#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:57,916 INFO L273 TraceCheckUtils]: 53: Hoare triple {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:57,916 INFO L256 TraceCheckUtils]: 54: Hoare triple {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,917 INFO L273 TraceCheckUtils]: 55: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,918 INFO L273 TraceCheckUtils]: 56: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,919 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {4853#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:08:57,939 INFO L273 TraceCheckUtils]: 58: Hoare triple {4853#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:57,940 INFO L273 TraceCheckUtils]: 59: Hoare triple {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:57,940 INFO L256 TraceCheckUtils]: 60: Hoare triple {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,940 INFO L273 TraceCheckUtils]: 61: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,941 INFO L273 TraceCheckUtils]: 62: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,943 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {4855#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:08:57,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {4855#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:57,944 INFO L273 TraceCheckUtils]: 65: Hoare triple {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:57,944 INFO L256 TraceCheckUtils]: 66: Hoare triple {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,944 INFO L273 TraceCheckUtils]: 67: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,945 INFO L273 TraceCheckUtils]: 68: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,947 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {4857#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:08:57,948 INFO L273 TraceCheckUtils]: 70: Hoare triple {4857#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:57,949 INFO L273 TraceCheckUtils]: 71: Hoare triple {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:57,949 INFO L256 TraceCheckUtils]: 72: Hoare triple {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,950 INFO L273 TraceCheckUtils]: 73: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,950 INFO L273 TraceCheckUtils]: 74: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,952 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {4859#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:08:57,955 INFO L273 TraceCheckUtils]: 76: Hoare triple {4859#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:57,955 INFO L273 TraceCheckUtils]: 77: Hoare triple {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:57,956 INFO L256 TraceCheckUtils]: 78: Hoare triple {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:08:57,957 INFO L273 TraceCheckUtils]: 79: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,957 INFO L273 TraceCheckUtils]: 80: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:08:57,959 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {4861#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:08:57,960 INFO L273 TraceCheckUtils]: 82: Hoare triple {4861#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {5112#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:57,961 INFO L273 TraceCheckUtils]: 83: Hoare triple {5112#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4834#false} is VALID [2018-11-23 13:08:57,961 INFO L256 TraceCheckUtils]: 84: Hoare triple {4834#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)); {4834#false} is VALID [2018-11-23 13:08:57,962 INFO L273 TraceCheckUtils]: 85: Hoare triple {4834#false} ~cond := #in~cond; {4834#false} is VALID [2018-11-23 13:08:57,962 INFO L273 TraceCheckUtils]: 86: Hoare triple {4834#false} assume 0 == ~cond; {4834#false} is VALID [2018-11-23 13:08:57,962 INFO L273 TraceCheckUtils]: 87: Hoare triple {4834#false} assume !false; {4834#false} is VALID [2018-11-23 13:08:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-23 13:08:57,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:57,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 13:08:57,992 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-11-23 13:08:57,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:57,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:08:58,053 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:08:58,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:08:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:08:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:08:58,054 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 31 states. [2018-11-23 13:09:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:02,245 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2018-11-23 13:09:02,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:09:02,245 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-11-23 13:09:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:09:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2018-11-23 13:09:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:09:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2018-11-23 13:09:02,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 77 transitions. [2018-11-23 13:09:03,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:03,197 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:09:03,198 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:09:03,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=1754, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:09:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:09:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 13:09:03,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:03,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-23 13:09:03,275 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-23 13:09:03,275 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-23 13:09:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:03,277 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 13:09:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 13:09:03,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:03,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:03,278 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-23 13:09:03,278 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-23 13:09:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:03,280 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 13:09:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 13:09:03,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:03,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:03,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:03,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:09:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2018-11-23 13:09:03,283 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 88 [2018-11-23 13:09:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:03,284 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2018-11-23 13:09:03,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:09:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2018-11-23 13:09:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 13:09:03,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:03,285 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:03,285 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:03,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -922870948, now seen corresponding path program 14 times [2018-11-23 13:09:03,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:03,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:03,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:03,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:05,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {5463#true} call ULTIMATE.init(); {5463#true} is VALID [2018-11-23 13:09:05,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {5463#true} assume true; {5463#true} is VALID [2018-11-23 13:09:05,536 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5463#true} {5463#true} #35#return; {5463#true} is VALID [2018-11-23 13:09:05,536 INFO L256 TraceCheckUtils]: 3: Hoare triple {5463#true} call #t~ret1 := main(); {5463#true} is VALID [2018-11-23 13:09:05,537 INFO L273 TraceCheckUtils]: 4: Hoare triple {5463#true} ~x~0 := 0; {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:05,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:05,538 INFO L256 TraceCheckUtils]: 6: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,541 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {5467#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:09:05,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {5467#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:05,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:05,542 INFO L256 TraceCheckUtils]: 12: Hoare triple {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,546 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {5469#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:09:05,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {5469#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:05,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:05,548 INFO L256 TraceCheckUtils]: 18: Hoare triple {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,552 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {5471#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:09:05,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {5471#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:05,554 INFO L273 TraceCheckUtils]: 23: Hoare triple {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:05,554 INFO L256 TraceCheckUtils]: 24: Hoare triple {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,558 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {5473#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:09:05,559 INFO L273 TraceCheckUtils]: 28: Hoare triple {5473#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:05,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:05,560 INFO L256 TraceCheckUtils]: 30: Hoare triple {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,564 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {5475#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:09:05,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {5475#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:05,566 INFO L273 TraceCheckUtils]: 35: Hoare triple {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:05,566 INFO L256 TraceCheckUtils]: 36: Hoare triple {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,567 INFO L273 TraceCheckUtils]: 37: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,567 INFO L273 TraceCheckUtils]: 38: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,570 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {5477#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:09:05,571 INFO L273 TraceCheckUtils]: 40: Hoare triple {5477#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:05,571 INFO L273 TraceCheckUtils]: 41: Hoare triple {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:05,572 INFO L256 TraceCheckUtils]: 42: Hoare triple {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,573 INFO L273 TraceCheckUtils]: 43: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,573 INFO L273 TraceCheckUtils]: 44: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,576 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {5479#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:09:05,577 INFO L273 TraceCheckUtils]: 46: Hoare triple {5479#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:05,578 INFO L273 TraceCheckUtils]: 47: Hoare triple {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:05,578 INFO L256 TraceCheckUtils]: 48: Hoare triple {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,581 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {5481#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:09:05,581 INFO L273 TraceCheckUtils]: 52: Hoare triple {5481#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:05,582 INFO L273 TraceCheckUtils]: 53: Hoare triple {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:05,582 INFO L256 TraceCheckUtils]: 54: Hoare triple {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,583 INFO L273 TraceCheckUtils]: 56: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,586 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {5483#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:09:05,587 INFO L273 TraceCheckUtils]: 58: Hoare triple {5483#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:05,587 INFO L273 TraceCheckUtils]: 59: Hoare triple {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:05,588 INFO L256 TraceCheckUtils]: 60: Hoare triple {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,588 INFO L273 TraceCheckUtils]: 61: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,588 INFO L273 TraceCheckUtils]: 62: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,590 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {5485#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:09:05,591 INFO L273 TraceCheckUtils]: 64: Hoare triple {5485#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:05,592 INFO L273 TraceCheckUtils]: 65: Hoare triple {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:05,592 INFO L256 TraceCheckUtils]: 66: Hoare triple {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,593 INFO L273 TraceCheckUtils]: 67: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,593 INFO L273 TraceCheckUtils]: 68: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,595 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {5487#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:09:05,616 INFO L273 TraceCheckUtils]: 70: Hoare triple {5487#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:05,637 INFO L273 TraceCheckUtils]: 71: Hoare triple {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:05,637 INFO L256 TraceCheckUtils]: 72: Hoare triple {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,648 INFO L273 TraceCheckUtils]: 73: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,649 INFO L273 TraceCheckUtils]: 74: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,651 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {5489#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:09:05,651 INFO L273 TraceCheckUtils]: 76: Hoare triple {5489#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:05,652 INFO L273 TraceCheckUtils]: 77: Hoare triple {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:05,652 INFO L256 TraceCheckUtils]: 78: Hoare triple {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,653 INFO L273 TraceCheckUtils]: 79: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,654 INFO L273 TraceCheckUtils]: 80: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,656 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {5491#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:09:05,657 INFO L273 TraceCheckUtils]: 82: Hoare triple {5491#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:05,657 INFO L273 TraceCheckUtils]: 83: Hoare triple {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:05,658 INFO L256 TraceCheckUtils]: 84: Hoare triple {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:05,658 INFO L273 TraceCheckUtils]: 85: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,659 INFO L273 TraceCheckUtils]: 86: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:05,661 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #39#return; {5493#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} is VALID [2018-11-23 13:09:05,662 INFO L273 TraceCheckUtils]: 88: Hoare triple {5493#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} ~x~0 := #t~ret0;havoc #t~ret0; {5494#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:05,663 INFO L273 TraceCheckUtils]: 89: Hoare triple {5494#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {5464#false} is VALID [2018-11-23 13:09:05,663 INFO L256 TraceCheckUtils]: 90: Hoare triple {5464#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)); {5464#false} is VALID [2018-11-23 13:09:05,664 INFO L273 TraceCheckUtils]: 91: Hoare triple {5464#false} ~cond := #in~cond; {5464#false} is VALID [2018-11-23 13:09:05,664 INFO L273 TraceCheckUtils]: 92: Hoare triple {5464#false} assume 0 == ~cond; {5464#false} is VALID [2018-11-23 13:09:05,664 INFO L273 TraceCheckUtils]: 93: Hoare triple {5464#false} assume !false; {5464#false} is VALID [2018-11-23 13:09:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-23 13:09:05,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:05,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:05,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:09:05,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:09:05,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:05,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:06,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {5463#true} call ULTIMATE.init(); {5463#true} is VALID [2018-11-23 13:09:06,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {5463#true} assume true; {5463#true} is VALID [2018-11-23 13:09:06,454 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5463#true} {5463#true} #35#return; {5463#true} is VALID [2018-11-23 13:09:06,454 INFO L256 TraceCheckUtils]: 3: Hoare triple {5463#true} call #t~ret1 := main(); {5463#true} is VALID [2018-11-23 13:09:06,454 INFO L273 TraceCheckUtils]: 4: Hoare triple {5463#true} ~x~0 := 0; {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:06,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:06,455 INFO L256 TraceCheckUtils]: 6: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,458 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {5467#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:09:06,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {5467#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:06,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:06,460 INFO L256 TraceCheckUtils]: 12: Hoare triple {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,464 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {5469#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:09:06,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {5469#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:06,465 INFO L273 TraceCheckUtils]: 17: Hoare triple {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:06,465 INFO L256 TraceCheckUtils]: 18: Hoare triple {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,466 INFO L273 TraceCheckUtils]: 19: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,469 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {5471#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:09:06,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {5471#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:06,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:06,471 INFO L256 TraceCheckUtils]: 24: Hoare triple {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,473 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {5473#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:09:06,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {5473#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:06,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:06,475 INFO L256 TraceCheckUtils]: 30: Hoare triple {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,476 INFO L273 TraceCheckUtils]: 32: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,480 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {5475#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:09:06,480 INFO L273 TraceCheckUtils]: 34: Hoare triple {5475#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:06,481 INFO L273 TraceCheckUtils]: 35: Hoare triple {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:06,481 INFO L256 TraceCheckUtils]: 36: Hoare triple {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,482 INFO L273 TraceCheckUtils]: 37: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,483 INFO L273 TraceCheckUtils]: 38: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,485 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {5477#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:09:06,486 INFO L273 TraceCheckUtils]: 40: Hoare triple {5477#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:06,486 INFO L273 TraceCheckUtils]: 41: Hoare triple {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:06,487 INFO L256 TraceCheckUtils]: 42: Hoare triple {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,488 INFO L273 TraceCheckUtils]: 43: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,488 INFO L273 TraceCheckUtils]: 44: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,495 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {5479#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:09:06,497 INFO L273 TraceCheckUtils]: 46: Hoare triple {5479#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:06,499 INFO L273 TraceCheckUtils]: 47: Hoare triple {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:06,499 INFO L256 TraceCheckUtils]: 48: Hoare triple {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,499 INFO L273 TraceCheckUtils]: 49: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,501 INFO L273 TraceCheckUtils]: 50: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,503 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {5481#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:09:06,503 INFO L273 TraceCheckUtils]: 52: Hoare triple {5481#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:06,505 INFO L273 TraceCheckUtils]: 53: Hoare triple {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:06,505 INFO L256 TraceCheckUtils]: 54: Hoare triple {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,507 INFO L273 TraceCheckUtils]: 56: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,508 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {5483#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:09:06,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {5483#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:06,509 INFO L273 TraceCheckUtils]: 59: Hoare triple {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:06,509 INFO L256 TraceCheckUtils]: 60: Hoare triple {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,510 INFO L273 TraceCheckUtils]: 61: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,511 INFO L273 TraceCheckUtils]: 62: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,515 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {5485#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:09:06,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {5485#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:06,517 INFO L273 TraceCheckUtils]: 65: Hoare triple {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:06,517 INFO L256 TraceCheckUtils]: 66: Hoare triple {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,519 INFO L273 TraceCheckUtils]: 68: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,521 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {5487#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:09:06,521 INFO L273 TraceCheckUtils]: 70: Hoare triple {5487#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:06,523 INFO L273 TraceCheckUtils]: 71: Hoare triple {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:06,523 INFO L256 TraceCheckUtils]: 72: Hoare triple {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,523 INFO L273 TraceCheckUtils]: 73: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,525 INFO L273 TraceCheckUtils]: 74: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,526 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {5489#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:09:06,527 INFO L273 TraceCheckUtils]: 76: Hoare triple {5489#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:06,527 INFO L273 TraceCheckUtils]: 77: Hoare triple {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:06,527 INFO L256 TraceCheckUtils]: 78: Hoare triple {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,529 INFO L273 TraceCheckUtils]: 79: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,529 INFO L273 TraceCheckUtils]: 80: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,535 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {5491#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:09:06,537 INFO L273 TraceCheckUtils]: 82: Hoare triple {5491#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:06,537 INFO L273 TraceCheckUtils]: 83: Hoare triple {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:06,537 INFO L256 TraceCheckUtils]: 84: Hoare triple {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:09:06,539 INFO L273 TraceCheckUtils]: 85: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,539 INFO L273 TraceCheckUtils]: 86: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:06,541 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #39#return; {5493#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} is VALID [2018-11-23 13:09:06,541 INFO L273 TraceCheckUtils]: 88: Hoare triple {5493#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} ~x~0 := #t~ret0;havoc #t~ret0; {5762#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:06,543 INFO L273 TraceCheckUtils]: 89: Hoare triple {5762#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5464#false} is VALID [2018-11-23 13:09:06,543 INFO L256 TraceCheckUtils]: 90: Hoare triple {5464#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)); {5464#false} is VALID [2018-11-23 13:09:06,543 INFO L273 TraceCheckUtils]: 91: Hoare triple {5464#false} ~cond := #in~cond; {5464#false} is VALID [2018-11-23 13:09:06,543 INFO L273 TraceCheckUtils]: 92: Hoare triple {5464#false} assume 0 == ~cond; {5464#false} is VALID [2018-11-23 13:09:06,544 INFO L273 TraceCheckUtils]: 93: Hoare triple {5464#false} assume !false; {5464#false} is VALID [2018-11-23 13:09:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-23 13:09:06,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:06,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 13:09:06,574 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-11-23 13:09:06,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:06,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:09:06,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:06,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:09:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:09:06,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:09:06,666 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 33 states. [2018-11-23 13:09:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:11,407 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-23 13:09:11,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:09:11,407 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-11-23 13:09:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:09:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2018-11-23 13:09:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:09:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2018-11-23 13:09:11,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 81 transitions. [2018-11-23 13:09:11,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:11,569 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:09:11,569 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 13:09:11,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 92 SyntacticMatches, 16 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 13:09:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 13:09:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 13:09:11,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:11,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 13:09:11,697 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 13:09:11,697 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 13:09:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:11,699 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-23 13:09:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-11-23 13:09:11,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:11,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:11,700 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 13:09:11,700 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 13:09:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:11,703 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-23 13:09:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-11-23 13:09:11,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:11,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:11,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:11,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:09:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2018-11-23 13:09:11,706 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 94 [2018-11-23 13:09:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:11,706 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-11-23 13:09:11,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:09:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2018-11-23 13:09:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 13:09:11,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:11,708 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:11,708 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:11,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash 124031738, now seen corresponding path program 15 times [2018-11-23 13:09:11,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:11,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:11,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:12,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {6131#true} call ULTIMATE.init(); {6131#true} is VALID [2018-11-23 13:09:12,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {6131#true} assume true; {6131#true} is VALID [2018-11-23 13:09:12,977 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6131#true} {6131#true} #35#return; {6131#true} is VALID [2018-11-23 13:09:12,977 INFO L256 TraceCheckUtils]: 3: Hoare triple {6131#true} call #t~ret1 := main(); {6131#true} is VALID [2018-11-23 13:09:12,978 INFO L273 TraceCheckUtils]: 4: Hoare triple {6131#true} ~x~0 := 0; {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:12,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:12,979 INFO L256 TraceCheckUtils]: 6: Hoare triple {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:12,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:12,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:12,983 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {6135#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:09:12,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {6135#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:12,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:12,985 INFO L256 TraceCheckUtils]: 12: Hoare triple {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:12,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:12,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:12,987 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {6137#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:09:12,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {6137#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:12,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:12,988 INFO L256 TraceCheckUtils]: 18: Hoare triple {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:12,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:12,990 INFO L273 TraceCheckUtils]: 20: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:12,992 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {6139#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:09:12,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {6139#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:12,993 INFO L273 TraceCheckUtils]: 23: Hoare triple {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:12,994 INFO L256 TraceCheckUtils]: 24: Hoare triple {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:12,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:12,995 INFO L273 TraceCheckUtils]: 26: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:12,997 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {6141#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:09:12,998 INFO L273 TraceCheckUtils]: 28: Hoare triple {6141#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:12,999 INFO L273 TraceCheckUtils]: 29: Hoare triple {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:12,999 INFO L256 TraceCheckUtils]: 30: Hoare triple {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,001 INFO L273 TraceCheckUtils]: 32: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,003 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {6143#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:09:13,004 INFO L273 TraceCheckUtils]: 34: Hoare triple {6143#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:13,004 INFO L273 TraceCheckUtils]: 35: Hoare triple {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:13,005 INFO L256 TraceCheckUtils]: 36: Hoare triple {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,005 INFO L273 TraceCheckUtils]: 37: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,006 INFO L273 TraceCheckUtils]: 38: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,008 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {6145#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:09:13,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {6145#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:13,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:13,010 INFO L256 TraceCheckUtils]: 42: Hoare triple {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,011 INFO L273 TraceCheckUtils]: 44: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,014 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {6147#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:09:13,014 INFO L273 TraceCheckUtils]: 46: Hoare triple {6147#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:13,015 INFO L273 TraceCheckUtils]: 47: Hoare triple {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:13,015 INFO L256 TraceCheckUtils]: 48: Hoare triple {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,016 INFO L273 TraceCheckUtils]: 49: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,017 INFO L273 TraceCheckUtils]: 50: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,019 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {6149#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:09:13,020 INFO L273 TraceCheckUtils]: 52: Hoare triple {6149#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:13,020 INFO L273 TraceCheckUtils]: 53: Hoare triple {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:13,021 INFO L256 TraceCheckUtils]: 54: Hoare triple {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,021 INFO L273 TraceCheckUtils]: 55: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,022 INFO L273 TraceCheckUtils]: 56: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,024 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {6151#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:09:13,025 INFO L273 TraceCheckUtils]: 58: Hoare triple {6151#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:13,026 INFO L273 TraceCheckUtils]: 59: Hoare triple {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:13,026 INFO L256 TraceCheckUtils]: 60: Hoare triple {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,027 INFO L273 TraceCheckUtils]: 61: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,028 INFO L273 TraceCheckUtils]: 62: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,030 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {6153#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:09:13,031 INFO L273 TraceCheckUtils]: 64: Hoare triple {6153#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:13,031 INFO L273 TraceCheckUtils]: 65: Hoare triple {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:13,032 INFO L256 TraceCheckUtils]: 66: Hoare triple {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,033 INFO L273 TraceCheckUtils]: 67: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,033 INFO L273 TraceCheckUtils]: 68: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,036 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {6155#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:09:13,037 INFO L273 TraceCheckUtils]: 70: Hoare triple {6155#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:13,038 INFO L273 TraceCheckUtils]: 71: Hoare triple {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:13,038 INFO L256 TraceCheckUtils]: 72: Hoare triple {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,039 INFO L273 TraceCheckUtils]: 73: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,039 INFO L273 TraceCheckUtils]: 74: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,042 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {6157#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:09:13,043 INFO L273 TraceCheckUtils]: 76: Hoare triple {6157#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:13,043 INFO L273 TraceCheckUtils]: 77: Hoare triple {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:13,043 INFO L256 TraceCheckUtils]: 78: Hoare triple {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,044 INFO L273 TraceCheckUtils]: 79: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,045 INFO L273 TraceCheckUtils]: 80: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,047 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {6159#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:09:13,048 INFO L273 TraceCheckUtils]: 82: Hoare triple {6159#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:13,049 INFO L273 TraceCheckUtils]: 83: Hoare triple {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:13,049 INFO L256 TraceCheckUtils]: 84: Hoare triple {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,050 INFO L273 TraceCheckUtils]: 85: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,050 INFO L273 TraceCheckUtils]: 86: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,053 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #39#return; {6161#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} is VALID [2018-11-23 13:09:13,054 INFO L273 TraceCheckUtils]: 88: Hoare triple {6161#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} ~x~0 := #t~ret0;havoc #t~ret0; {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:13,054 INFO L273 TraceCheckUtils]: 89: Hoare triple {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:13,054 INFO L256 TraceCheckUtils]: 90: Hoare triple {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:09:13,055 INFO L273 TraceCheckUtils]: 91: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,056 INFO L273 TraceCheckUtils]: 92: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:09:13,058 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} #39#return; {6163#(and (<= |main_#t~ret0| 30) (<= 30 |main_#t~ret0|))} is VALID [2018-11-23 13:09:13,060 INFO L273 TraceCheckUtils]: 94: Hoare triple {6163#(and (<= |main_#t~ret0| 30) (<= 30 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6164#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:13,061 INFO L273 TraceCheckUtils]: 95: Hoare triple {6164#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {6132#false} is VALID [2018-11-23 13:09:13,061 INFO L256 TraceCheckUtils]: 96: Hoare triple {6132#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)); {6132#false} is VALID [2018-11-23 13:09:13,061 INFO L273 TraceCheckUtils]: 97: Hoare triple {6132#false} ~cond := #in~cond; {6132#false} is VALID [2018-11-23 13:09:13,061 INFO L273 TraceCheckUtils]: 98: Hoare triple {6132#false} assume 0 == ~cond; {6132#false} is VALID [2018-11-23 13:09:13,061 INFO L273 TraceCheckUtils]: 99: Hoare triple {6132#false} assume !false; {6132#false} is VALID [2018-11-23 13:09:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-23 13:09:13,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:13,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:13,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2