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/loops-crafted-1/nested5_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:16:32,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:16:32,585 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:16:32,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:16:32,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:16:32,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:16:32,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:16:32,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:16:32,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:16:32,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:16:32,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:16:32,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:16:32,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:16:32,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:16:32,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:16:32,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:16:32,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:16:32,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:16:32,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:16:32,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:16:32,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:16:32,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:16:32,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:16:32,623 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:16:32,623 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:16:32,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:16:32,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:16:32,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:16:32,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:16:32,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:16:32,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:16:32,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:16:32,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:16:32,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:16:32,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:16:32,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:16:32,632 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:16:32,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:16:32,648 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:16:32,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:16:32,649 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:16:32,650 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:16:32,650 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:16:32,650 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:16:32,650 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:16:32,651 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:16:32,651 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:16:32,651 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:16:32,651 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:16:32,651 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:16:32,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:16:32,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:16:32,652 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:16:32,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:16:32,652 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:16:32,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:16:32,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:16:32,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:16:32,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:16:32,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:16:32,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:32,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:16:32,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:16:32,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:16:32,654 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:16:32,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:16:32,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:16:32,655 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:16:32,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:16:32,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:16:32,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:16:32,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:16:32,720 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:16:32,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5_true-unreach-call.c [2018-11-23 13:16:32,784 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60988e634/1f5889ebc12e4b0c92e389e9edb0d8ae/FLAG5aa0b7d5a [2018-11-23 13:16:33,264 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:16:33,265 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5_true-unreach-call.c [2018-11-23 13:16:33,272 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60988e634/1f5889ebc12e4b0c92e389e9edb0d8ae/FLAG5aa0b7d5a [2018-11-23 13:16:33,618 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60988e634/1f5889ebc12e4b0c92e389e9edb0d8ae [2018-11-23 13:16:33,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:16:33,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:16:33,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:33,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:16:33,636 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:16:33,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:33" (1/1) ... [2018-11-23 13:16:33,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdaa6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:33, skipping insertion in model container [2018-11-23 13:16:33,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:33" (1/1) ... [2018-11-23 13:16:33,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:16:33,685 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:16:33,963 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:33,969 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:16:33,999 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:34,019 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:16:34,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34 WrapperNode [2018-11-23 13:16:34,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:34,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:34,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:16:34,022 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:16:34,032 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:16:34" (1/1) ... [2018-11-23 13:16:34,039 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:16:34" (1/1) ... [2018-11-23 13:16:34,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:34,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:16:34,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:16:34,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:16:34,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (1/1) ... [2018-11-23 13:16:34,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (1/1) ... [2018-11-23 13:16:34,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (1/1) ... [2018-11-23 13:16:34,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (1/1) ... [2018-11-23 13:16:34,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (1/1) ... [2018-11-23 13:16:34,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (1/1) ... [2018-11-23 13:16:34,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (1/1) ... [2018-11-23 13:16:34,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:16:34,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:16:34,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:16:34,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:16:34,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (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:16:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:16:34,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:16:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:16:34,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:16:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:16:34,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:16:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:16:34,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:16:34,833 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:16:34,834 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 13:16:34,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:34 BoogieIcfgContainer [2018-11-23 13:16:34,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:16:34,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:16:34,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:16:34,839 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:16:34,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:33" (1/3) ... [2018-11-23 13:16:34,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ada477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:34, skipping insertion in model container [2018-11-23 13:16:34,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:34" (2/3) ... [2018-11-23 13:16:34,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ada477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:34, skipping insertion in model container [2018-11-23 13:16:34,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:34" (3/3) ... [2018-11-23 13:16:34,844 INFO L112 eAbstractionObserver]: Analyzing ICFG nested5_true-unreach-call.c [2018-11-23 13:16:34,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:16:34,864 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:16:34,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:16:34,924 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:16:34,924 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:16:34,925 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:16:34,925 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:16:34,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:16:34,925 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:16:34,925 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:16:34,926 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:16:34,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:16:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 13:16:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:16:34,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:34,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:34,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:34,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash -84144223, now seen corresponding path program 1 times [2018-11-23 13:16:34,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:34,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:35,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:35,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:35,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 13:16:35,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 13:16:35,116 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #81#return; {29#true} is VALID [2018-11-23 13:16:35,116 INFO L256 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2018-11-23 13:16:35,117 INFO L273 TraceCheckUtils]: 4: Hoare triple {29#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {29#true} is VALID [2018-11-23 13:16:35,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {29#true} is VALID [2018-11-23 13:16:35,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {29#true} is VALID [2018-11-23 13:16:35,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {29#true} is VALID [2018-11-23 13:16:35,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {29#true} is VALID [2018-11-23 13:16:35,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 13:16:35,121 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {30#false} is VALID [2018-11-23 13:16:35,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 13:16:35,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2018-11-23 13:16:35,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 13:16:35,125 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:16:35,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:35,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:16:35,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:16:35,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:35,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:16:35,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:35,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:16:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:16:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:35,234 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 13:16:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:35,483 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2018-11-23 13:16:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:16:35,483 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:16:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-23 13:16:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-23 13:16:35,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2018-11-23 13:16:36,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:36,142 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:16:36,143 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:16:36,147 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:16:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:16:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:16:36,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:36,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:16:36,227 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:16:36,227 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:16:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:36,231 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 13:16:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 13:16:36,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:36,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:36,232 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:16:36,233 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:16:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:36,237 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 13:16:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 13:16:36,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:36,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:36,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:36,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:16:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-23 13:16:36,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2018-11-23 13:16:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:36,244 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-23 13:16:36,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:16:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 13:16:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:16:36,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:36,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:36,246 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:36,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:36,246 INFO L82 PathProgramCache]: Analyzing trace with hash -89685349, now seen corresponding path program 1 times [2018-11-23 13:16:36,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:36,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:36,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:36,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID [2018-11-23 13:16:36,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID [2018-11-23 13:16:36,418 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #81#return; {175#true} is VALID [2018-11-23 13:16:36,419 INFO L256 TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret5 := main(); {175#true} is VALID [2018-11-23 13:16:36,419 INFO L273 TraceCheckUtils]: 4: Hoare triple {175#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {175#true} is VALID [2018-11-23 13:16:36,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {175#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {175#true} is VALID [2018-11-23 13:16:36,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {175#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {175#true} is VALID [2018-11-23 13:16:36,420 INFO L273 TraceCheckUtils]: 7: Hoare triple {175#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {175#true} is VALID [2018-11-23 13:16:36,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {175#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {177#(and (<= main_~v~0 0) (< 0 (+ (div main_~v~0 4294967296) 1)))} is VALID [2018-11-23 13:16:36,427 INFO L273 TraceCheckUtils]: 9: Hoare triple {177#(and (<= main_~v~0 0) (< 0 (+ (div main_~v~0 4294967296) 1)))} assume !(~v~0 % 4294967296 < 10); {176#false} is VALID [2018-11-23 13:16:36,427 INFO L256 TraceCheckUtils]: 10: Hoare triple {176#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {176#false} is VALID [2018-11-23 13:16:36,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {176#false} ~cond := #in~cond; {176#false} is VALID [2018-11-23 13:16:36,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {176#false} assume 0 == ~cond; {176#false} is VALID [2018-11-23 13:16:36,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {176#false} assume !false; {176#false} is VALID [2018-11-23 13:16:36,431 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:16:36,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:36,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:16:36,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 13:16:36,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:36,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:16:36,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:36,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:16:36,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:16:36,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:36,562 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2018-11-23 13:16:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:36,949 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-11-23 13:16:36,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:16:36,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 13:16:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 13:16:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 13:16:36,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-23 13:16:37,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:37,316 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:16:37,316 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:16:37,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:16:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-23 13:16:37,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:37,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-23 13:16:37,341 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-23 13:16:37,341 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-23 13:16:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:37,344 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 13:16:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 13:16:37,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:37,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:37,346 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-23 13:16:37,346 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-23 13:16:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:37,349 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 13:16:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 13:16:37,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:37,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:37,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:37,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:16:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 13:16:37,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2018-11-23 13:16:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:37,354 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 13:16:37,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:16:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 13:16:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:16:37,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:37,355 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:16:37,355 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:37,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash 374245081, now seen corresponding path program 1 times [2018-11-23 13:16:37,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:37,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:37,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2018-11-23 13:16:37,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2018-11-23 13:16:37,507 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #81#return; {348#true} is VALID [2018-11-23 13:16:37,508 INFO L256 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret5 := main(); {348#true} is VALID [2018-11-23 13:16:37,508 INFO L273 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {348#true} is VALID [2018-11-23 13:16:37,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {348#true} is VALID [2018-11-23 13:16:37,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {348#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {348#true} is VALID [2018-11-23 13:16:37,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {348#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {348#true} is VALID [2018-11-23 13:16:37,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {348#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {350#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:37,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {350#(and (<= main_~v~0 0) (<= 0 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {350#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:37,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {350#(and (<= main_~v~0 0) (<= 0 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {351#(and (<= main_~v~0 1) (< 0 (+ (div main_~v~0 4294967296) 1)))} is VALID [2018-11-23 13:16:37,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {351#(and (<= main_~v~0 1) (< 0 (+ (div main_~v~0 4294967296) 1)))} assume !(~v~0 % 4294967296 < 10); {349#false} is VALID [2018-11-23 13:16:37,518 INFO L256 TraceCheckUtils]: 12: Hoare triple {349#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {349#false} is VALID [2018-11-23 13:16:37,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2018-11-23 13:16:37,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2018-11-23 13:16:37,519 INFO L273 TraceCheckUtils]: 15: Hoare triple {349#false} assume !false; {349#false} is VALID [2018-11-23 13:16:37,522 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:16:37,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:37,523 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:16:37,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:37,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:37,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2018-11-23 13:16:37,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2018-11-23 13:16:37,731 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #81#return; {348#true} is VALID [2018-11-23 13:16:37,731 INFO L256 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret5 := main(); {348#true} is VALID [2018-11-23 13:16:37,731 INFO L273 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {348#true} is VALID [2018-11-23 13:16:37,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {348#true} is VALID [2018-11-23 13:16:37,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {348#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {348#true} is VALID [2018-11-23 13:16:37,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {348#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {348#true} is VALID [2018-11-23 13:16:37,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {348#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {350#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:37,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {350#(and (<= main_~v~0 0) (<= 0 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {350#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:37,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {350#(and (<= main_~v~0 0) (<= 0 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {385#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2018-11-23 13:16:37,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {385#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !(~v~0 % 4294967296 < 10); {349#false} is VALID [2018-11-23 13:16:37,739 INFO L256 TraceCheckUtils]: 12: Hoare triple {349#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {349#false} is VALID [2018-11-23 13:16:37,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2018-11-23 13:16:37,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2018-11-23 13:16:37,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {349#false} assume !false; {349#false} is VALID [2018-11-23 13:16:37,742 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:16:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:37,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:16:37,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 13:16:37,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:37,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:16:37,795 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:16:37,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:16:37,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:16:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:37,797 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2018-11-23 13:16:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:38,104 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 13:16:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:16:38,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 13:16:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-23 13:16:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-23 13:16:38,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2018-11-23 13:16:38,312 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:16:38,314 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:16:38,315 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:16:38,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:16:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-23 13:16:38,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:38,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 25 states. [2018-11-23 13:16:38,334 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 25 states. [2018-11-23 13:16:38,334 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 25 states. [2018-11-23 13:16:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:38,337 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:16:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:16:38,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:38,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:38,339 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 33 states. [2018-11-23 13:16:38,339 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 33 states. [2018-11-23 13:16:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:38,342 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:16:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:16:38,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:38,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:38,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:38,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:16:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 13:16:38,346 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2018-11-23 13:16:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:38,346 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 13:16:38,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:16:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 13:16:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:16:38,347 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:38,348 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:38,348 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:38,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:38,348 INFO L82 PathProgramCache]: Analyzing trace with hash -465210473, now seen corresponding path program 2 times [2018-11-23 13:16:38,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:38,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:38,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:38,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:38,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:38,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {580#true} call ULTIMATE.init(); {580#true} is VALID [2018-11-23 13:16:38,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {580#true} assume true; {580#true} is VALID [2018-11-23 13:16:38,608 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {580#true} {580#true} #81#return; {580#true} is VALID [2018-11-23 13:16:38,608 INFO L256 TraceCheckUtils]: 3: Hoare triple {580#true} call #t~ret5 := main(); {580#true} is VALID [2018-11-23 13:16:38,608 INFO L273 TraceCheckUtils]: 4: Hoare triple {580#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {580#true} is VALID [2018-11-23 13:16:38,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {580#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {580#true} is VALID [2018-11-23 13:16:38,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {580#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {580#true} is VALID [2018-11-23 13:16:38,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {580#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {580#true} is VALID [2018-11-23 13:16:38,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {580#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {582#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:38,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {582#(and (<= main_~v~0 0) (<= 0 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {582#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:38,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {582#(and (<= main_~v~0 0) (<= 0 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {583#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2018-11-23 13:16:38,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {583#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {583#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2018-11-23 13:16:38,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {583#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {584#(and (<= main_~v~0 2) (< 0 (+ (div main_~v~0 4294967296) 1)))} is VALID [2018-11-23 13:16:38,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {584#(and (<= main_~v~0 2) (< 0 (+ (div main_~v~0 4294967296) 1)))} assume !(~v~0 % 4294967296 < 10); {581#false} is VALID [2018-11-23 13:16:38,618 INFO L256 TraceCheckUtils]: 14: Hoare triple {581#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {581#false} is VALID [2018-11-23 13:16:38,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {581#false} ~cond := #in~cond; {581#false} is VALID [2018-11-23 13:16:38,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {581#false} assume 0 == ~cond; {581#false} is VALID [2018-11-23 13:16:38,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {581#false} assume !false; {581#false} is VALID [2018-11-23 13:16:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:38,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:38,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:38,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:38,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:38,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:38,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:38,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {580#true} call ULTIMATE.init(); {580#true} is VALID [2018-11-23 13:16:38,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {580#true} assume true; {580#true} is VALID [2018-11-23 13:16:38,849 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {580#true} {580#true} #81#return; {580#true} is VALID [2018-11-23 13:16:38,850 INFO L256 TraceCheckUtils]: 3: Hoare triple {580#true} call #t~ret5 := main(); {580#true} is VALID [2018-11-23 13:16:38,850 INFO L273 TraceCheckUtils]: 4: Hoare triple {580#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {580#true} is VALID [2018-11-23 13:16:38,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {580#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {580#true} is VALID [2018-11-23 13:16:38,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {580#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {580#true} is VALID [2018-11-23 13:16:38,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {580#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {580#true} is VALID [2018-11-23 13:16:38,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {580#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {582#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:38,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {582#(and (<= main_~v~0 0) (<= 0 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {582#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:38,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {582#(and (<= main_~v~0 0) (<= 0 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {583#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2018-11-23 13:16:38,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {583#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {583#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2018-11-23 13:16:38,856 INFO L273 TraceCheckUtils]: 12: Hoare triple {583#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {624#(and (<= main_~v~0 2) (<= 2 main_~v~0))} is VALID [2018-11-23 13:16:38,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {624#(and (<= main_~v~0 2) (<= 2 main_~v~0))} assume !(~v~0 % 4294967296 < 10); {581#false} is VALID [2018-11-23 13:16:38,861 INFO L256 TraceCheckUtils]: 14: Hoare triple {581#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {581#false} is VALID [2018-11-23 13:16:38,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {581#false} ~cond := #in~cond; {581#false} is VALID [2018-11-23 13:16:38,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {581#false} assume 0 == ~cond; {581#false} is VALID [2018-11-23 13:16:38,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {581#false} assume !false; {581#false} is VALID [2018-11-23 13:16:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:38,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:38,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:16:38,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:16:38,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:38,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:16:38,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:38,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:16:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:16:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:38,917 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 6 states. [2018-11-23 13:16:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:39,259 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-11-23 13:16:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:16:39,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:16:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 13:16:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 13:16:39,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 13:16:39,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:39,350 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:16:39,350 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:16:39,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:16:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-23 13:16:39,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:39,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 27 states. [2018-11-23 13:16:39,381 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 27 states. [2018-11-23 13:16:39,382 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 27 states. [2018-11-23 13:16:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:39,386 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 13:16:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 13:16:39,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:39,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:39,387 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 35 states. [2018-11-23 13:16:39,387 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 35 states. [2018-11-23 13:16:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:39,390 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 13:16:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 13:16:39,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:39,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:39,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:39,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:16:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 13:16:39,394 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2018-11-23 13:16:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:39,394 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 13:16:39,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:16:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 13:16:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:16:39,395 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:39,396 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:39,396 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:39,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash 271853781, now seen corresponding path program 3 times [2018-11-23 13:16:39,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:39,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:39,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:39,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:39,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:39,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {832#true} call ULTIMATE.init(); {832#true} is VALID [2018-11-23 13:16:39,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {832#true} assume true; {832#true} is VALID [2018-11-23 13:16:39,902 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {832#true} {832#true} #81#return; {832#true} is VALID [2018-11-23 13:16:39,902 INFO L256 TraceCheckUtils]: 3: Hoare triple {832#true} call #t~ret5 := main(); {832#true} is VALID [2018-11-23 13:16:39,903 INFO L273 TraceCheckUtils]: 4: Hoare triple {832#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {832#true} is VALID [2018-11-23 13:16:39,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {832#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {832#true} is VALID [2018-11-23 13:16:39,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {832#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {832#true} is VALID [2018-11-23 13:16:39,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {832#true} is VALID [2018-11-23 13:16:39,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {832#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {834#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:39,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {834#(and (<= main_~v~0 0) (<= 0 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {834#(and (<= main_~v~0 0) (<= 0 main_~v~0))} is VALID [2018-11-23 13:16:39,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {834#(and (<= main_~v~0 0) (<= 0 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2018-11-23 13:16:39,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2018-11-23 13:16:39,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {836#(and (<= main_~v~0 2) (<= 2 main_~v~0))} is VALID [2018-11-23 13:16:39,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#(and (<= main_~v~0 2) (<= 2 main_~v~0))} assume !!(~v~0 % 4294967296 < 10); {836#(and (<= main_~v~0 2) (<= 2 main_~v~0))} is VALID [2018-11-23 13:16:39,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#(and (<= main_~v~0 2) (<= 2 main_~v~0))} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {837#(and (<= main_~v~0 3) (< 0 (+ (div main_~v~0 4294967296) 1)))} is VALID [2018-11-23 13:16:39,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {837#(and (<= main_~v~0 3) (< 0 (+ (div main_~v~0 4294967296) 1)))} assume !(~v~0 % 4294967296 < 10); {833#false} is VALID [2018-11-23 13:16:39,918 INFO L256 TraceCheckUtils]: 16: Hoare triple {833#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {833#false} is VALID [2018-11-23 13:16:39,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {833#false} ~cond := #in~cond; {833#false} is VALID [2018-11-23 13:16:39,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {833#false} assume 0 == ~cond; {833#false} is VALID [2018-11-23 13:16:39,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {833#false} assume !false; {833#false} is VALID [2018-11-23 13:16:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:39,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:39,921 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:16:39,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:39,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:16:39,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:39,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:49,149 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2018-11-23 13:16:53,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {832#true} call ULTIMATE.init(); {832#true} is VALID [2018-11-23 13:16:53,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {832#true} assume true; {832#true} is VALID [2018-11-23 13:16:53,586 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {832#true} {832#true} #81#return; {832#true} is VALID [2018-11-23 13:16:53,587 INFO L256 TraceCheckUtils]: 3: Hoare triple {832#true} call #t~ret5 := main(); {832#true} is VALID [2018-11-23 13:16:53,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {832#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {832#true} is VALID [2018-11-23 13:16:53,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {832#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {832#true} is VALID [2018-11-23 13:16:53,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {832#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {832#true} is VALID [2018-11-23 13:16:53,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {832#true} is VALID [2018-11-23 13:16:53,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {832#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {832#true} is VALID [2018-11-23 13:16:53,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {832#true} assume !!(~v~0 % 4294967296 < 10); {832#true} is VALID [2018-11-23 13:16:53,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {832#true} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {832#true} is VALID [2018-11-23 13:16:53,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {832#true} assume !!(~v~0 % 4294967296 < 10); {832#true} is VALID [2018-11-23 13:16:53,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {832#true} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {832#true} is VALID [2018-11-23 13:16:53,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {832#true} assume !!(~v~0 % 4294967296 < 10); {880#(< (mod main_~v~0 4294967296) 10)} is VALID [2018-11-23 13:16:53,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {880#(< (mod main_~v~0 4294967296) 10)} #t~post4 := ~v~0;~v~0 := 1 + #t~post4;havoc #t~post4; {884#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} is VALID [2018-11-23 13:16:53,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {884#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} assume !(~v~0 % 4294967296 < 10); {888#(and (<= 10 (mod main_~v~0 4294967296)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))} is VALID [2018-11-23 13:16:53,609 INFO L256 TraceCheckUtils]: 16: Hoare triple {888#(and (<= 10 (mod main_~v~0 4294967296)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {892#(exists ((v_prenex_4 Int)) (and (<= (mod v_prenex_4 4) 2147483647) (<= 10 (mod v_prenex_4 4294967296)) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_4 4)) (<= 0 (mod v_prenex_4 4294967296)) (< (mod (+ v_prenex_4 4294967295) 4294967296) 10)))} is VALID [2018-11-23 13:16:53,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {892#(exists ((v_prenex_4 Int)) (and (<= (mod v_prenex_4 4) 2147483647) (<= 10 (mod v_prenex_4 4294967296)) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_4 4)) (<= 0 (mod v_prenex_4 4294967296)) (< (mod (+ v_prenex_4 4294967295) 4294967296) 10)))} ~cond := #in~cond; {896#(exists ((v_prenex_4 Int)) (and (<= (mod v_prenex_4 4) 2147483647) (<= 10 (mod v_prenex_4 4294967296)) (<= 0 (mod v_prenex_4 4294967296)) (= __VERIFIER_assert_~cond (mod v_prenex_4 4)) (< (mod (+ v_prenex_4 4294967295) 4294967296) 10)))} is VALID [2018-11-23 13:16:53,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {896#(exists ((v_prenex_4 Int)) (and (<= (mod v_prenex_4 4) 2147483647) (<= 10 (mod v_prenex_4 4294967296)) (<= 0 (mod v_prenex_4 4294967296)) (= __VERIFIER_assert_~cond (mod v_prenex_4 4)) (< (mod (+ v_prenex_4 4294967295) 4294967296) 10)))} assume 0 == ~cond; {833#false} is VALID [2018-11-23 13:16:53,618 INFO L273 TraceCheckUtils]: 19: Hoare triple {833#false} assume !false; {833#false} is VALID [2018-11-23 13:16:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:16:53,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:53,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-23 13:16:53,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 13:16:53,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:53,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:16:53,714 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:16:53,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:16:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:16:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=76, Unknown=5, NotChecked=0, Total=110 [2018-11-23 13:16:53,715 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 11 states. [2018-11-23 13:17:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:18,760 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 13:17:18,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:17:18,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 13:17:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:17:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2018-11-23 13:17:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:17:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2018-11-23 13:17:18,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2018-11-23 13:17:18,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:18,886 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:17:18,886 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:17:18,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=47, Invalid=130, Unknown=5, NotChecked=0, Total=182 [2018-11-23 13:17:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:17:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:17:18,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:18,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:18,888 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:18,888 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:18,889 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:17:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:17:18,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:18,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:18,889 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:18,889 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:18,890 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:17:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:17:18,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:18,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:18,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:18,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:17:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:17:18,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-23 13:17:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:18,891 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:17:18,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:17:18,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:17:18,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:18,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:17:19,109 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:17:19,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:17:19,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:17:19,110 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:17:19,110 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:17:19,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:17:19,110 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-23 13:17:19,111 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 22) the Hoare annotation is: (or (and (<= main_~v~0 0) (<= 0 main_~v~0)) (and (<= 10 (mod main_~v~0 4294967296)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) [2018-11-23 13:17:19,111 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-11-23 13:17:19,111 INFO L444 ceAbstractionStarter]: At program point L20-3(line 20) the Hoare annotation is: (or (and (<= main_~v~0 0) (< 0 (+ (div main_~v~0 4294967296) 1))) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2018-11-23 13:17:19,111 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (<= 10 (mod main_~v~0 4294967296)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2018-11-23 13:17:19,111 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 22) no Hoare annotation was computed. [2018-11-23 13:17:19,112 INFO L444 ceAbstractionStarter]: At program point L16-3(lines 16 22) the Hoare annotation is: (or (and (<= main_~v~0 0) (<= 0 main_~v~0)) (and (<= 10 (mod main_~v~0 4294967296)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) [2018-11-23 13:17:19,112 INFO L448 ceAbstractionStarter]: For program point L16-4(lines 10 23) no Hoare annotation was computed. [2018-11-23 13:17:19,112 INFO L448 ceAbstractionStarter]: For program point L21(lines 19 22) no Hoare annotation was computed. [2018-11-23 13:17:19,112 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 22) no Hoare annotation was computed. [2018-11-23 13:17:19,112 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 22) the Hoare annotation is: (or (and (<= main_~v~0 0) (<= 0 main_~v~0)) (and (<= 10 (mod main_~v~0 4294967296)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) [2018-11-23 13:17:19,113 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-23 13:17:19,113 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2018-11-23 13:17:19,113 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 22) the Hoare annotation is: (or (and (<= main_~v~0 0) (<= 0 main_~v~0)) (and (<= 10 (mod main_~v~0 4294967296)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))) [2018-11-23 13:17:19,113 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:17:19,114 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:17:19,114 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:17:19,114 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:17:19,114 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:17:19,114 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:17:19,116 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:17:19,119 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:17:19,119 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:17:19,119 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:17:19,119 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-23 13:17:19,119 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-23 13:17:19,120 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:17:19,120 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:17:19,120 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:17:19,120 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-23 13:17:19,120 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 13:17:19,120 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 13:17:19,121 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:17:19,121 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:17:19,121 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:17:19,121 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:17:19,121 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 13:17:19,121 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 13:17:19,121 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 13:17:19,122 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:17:19,122 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 13:17:19,122 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 13:17:19,122 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 13:17:19,123 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:17:19,123 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 13:17:19,124 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:17:19,125 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:17:19,125 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:17:19,125 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:17:19,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:17:19 BoogieIcfgContainer [2018-11-23 13:17:19,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:17:19,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:17:19,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:17:19,138 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:17:19,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:34" (3/4) ... [2018-11-23 13:17:19,143 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:17:19,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:17:19,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:17:19,151 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:17:19,156 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 13:17:19,156 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:17:19,157 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:17:19,209 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops-crafted-1/nested5_true-unreach-call.c-witness.graphml [2018-11-23 13:17:19,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:17:19,215 INFO L168 Benchmark]: Toolchain (without parser) took 45582.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -325.7 MB). Peak memory consumption was 404.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:17:19,216 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:17:19,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:17:19,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:17:19,219 INFO L168 Benchmark]: Boogie Preprocessor took 36.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:17:19,220 INFO L168 Benchmark]: RCFGBuilder took 749.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:17:19,221 INFO L168 Benchmark]: TraceAbstraction took 44301.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 421.7 MB). Peak memory consumption was 421.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:17:19,221 INFO L168 Benchmark]: Witness Printer took 71.95 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:17:19,231 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 389.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 749.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44301.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 421.7 MB). Peak memory consumption was 421.7 MB. Max. memory is 7.1 GB. * Witness Printer took 71.95 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (v <= 0 && 0 < v / 4294967296 + 1) || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (v <= 0 && 0 <= v) || (10 <= v % 4294967296 && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (v <= 0 && 0 <= v) || (10 <= v % 4294967296 && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (v <= 0 && 0 <= v) || (10 <= v % 4294967296 && (v + 4294967295) % 4294967296 < 10) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (v <= 0 && 0 <= v) || (10 <= v % 4294967296 && (v + 4294967295) % 4294967296 < 10) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 44.2s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 27.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 86 SDslu, 240 SDs, 0 SdLazy, 128 SolverSat, 22 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 31 NumberOfFragments, 121 HoareAnnotationTreeSize, 16 FomulaSimplifications, 31 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 136 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 128 ConstructedInterpolants, 2 QuantifiedInterpolants, 6262 SizeOfPredicates, 4 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 9/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...