java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:06:29,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:29,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:29,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:29,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:29,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:29,885 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:29,887 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:29,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:29,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:29,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:29,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:29,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:29,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:29,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:29,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:29,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:29,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:29,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:29,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:29,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:29,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:29,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:29,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:29,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:29,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:29,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:29,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:29,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:29,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:29,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:29,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:29,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:29,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:29,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:29,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:29,917 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:06:29,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:29,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:29,946 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:06:29,947 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:06:29,947 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:29,947 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:29,948 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:29,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:29,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:06:29,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:29,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:06:29,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:29,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:06:29,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:06:29,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:06:29,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:06:29,954 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:29,954 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:29,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:06:29,955 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:29,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:29,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:06:29,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:06:29,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:29,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:29,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:06:29,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:06:29,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:29,956 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:06:29,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:06:29,957 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:06:30,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:30,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:30,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:30,018 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:30,019 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:30,019 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call2_true-termination.i [2018-11-23 13:06:30,074 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992620fea/f0af909f8e8143a69f42cdca20028cd3/FLAGc6e999a60 [2018-11-23 13:06:30,542 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:30,542 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call2_true-termination.i [2018-11-23 13:06:30,550 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992620fea/f0af909f8e8143a69f42cdca20028cd3/FLAGc6e999a60 [2018-11-23 13:06:30,897 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992620fea/f0af909f8e8143a69f42cdca20028cd3 [2018-11-23 13:06:30,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:30,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:30,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:30,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:30,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:30,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:30" (1/1) ... [2018-11-23 13:06:30,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179e68d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:30, skipping insertion in model container [2018-11-23 13:06:30,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:30" (1/1) ... [2018-11-23 13:06:30,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:30,953 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:31,174 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:31,179 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:31,196 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:31,211 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:31,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31 WrapperNode [2018-11-23 13:06:31,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:31,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:31,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:31,213 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:31,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:31,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:31,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:31,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:31,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... [2018-11-23 13:06:31,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:31,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:31,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:31,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:31,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:06:31,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:06:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:31,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:06:31,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:06:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:06:31,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:06:31,750 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:31,750 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:06:31,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:31 BoogieIcfgContainer [2018-11-23 13:06:31,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:31,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:06:31,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:06:31,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:06:31,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:06:30" (1/3) ... [2018-11-23 13:06:31,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3581d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:31, skipping insertion in model container [2018-11-23 13:06:31,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:31" (2/3) ... [2018-11-23 13:06:31,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3581d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:31, skipping insertion in model container [2018-11-23 13:06:31,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:31" (3/3) ... [2018-11-23 13:06:31,761 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call2_true-termination.i [2018-11-23 13:06:31,770 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:06:31,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:06:31,792 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:06:31,824 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:31,824 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:06:31,824 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:06:31,824 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:06:31,825 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:31,825 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:31,825 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:06:31,825 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:31,825 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:06:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:06:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:06:31,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:31,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:31,850 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:31,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:06:31,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:31,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:31,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:31,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:32,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 13:06:32,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 13:06:32,167 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 13:06:32,167 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 13:06:32,176 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 0;~y~0 := 1; {22#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:32,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {21#false} is VALID [2018-11-23 13:06:32,177 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {21#false} is VALID [2018-11-23 13:06:32,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 13:06:32,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2018-11-23 13:06:32,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 13:06:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:32,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:32,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:06:32,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:06:32,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:32,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:06:32,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:32,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:06:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:06:32,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:32,260 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 13:06:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:32,500 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:06:32,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:06:32,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:06:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:06:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:06:32,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 13:06:32,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:32,737 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:06:32,737 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:06:32,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:06:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:06:32,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:32,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:32,833 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:32,833 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:32,837 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:06:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:32,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:32,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:32,838 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:32,838 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:32,841 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:06:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:32,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:32,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:32,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:32,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:06:32,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:06:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:32,850 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:06:32,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:06:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:06:32,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:32,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:32,851 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:32,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:32,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 13:06:32,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:32,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:32,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:32,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:32,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:33,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:06:33,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:06:33,119 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:06:33,119 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret1 := main(); {108#true} is VALID [2018-11-23 13:06:33,128 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 0;~y~0 := 1; {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:33,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {111#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:33,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {109#false} is VALID [2018-11-23 13:06:33,143 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:06:33,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:06:33,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:06:33,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:06:33,145 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:06:33,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:33,145 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:06:33,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:33,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:33,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:06:33,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:06:33,289 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:06:33,289 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret1 := main(); {108#true} is VALID [2018-11-23 13:06:33,291 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 0;~y~0 := 1; {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:33,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:33,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {109#false} is VALID [2018-11-23 13:06:33,294 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:06:33,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:06:33,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:06:33,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:06:33,296 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:06:33,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:33,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:06:33,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:06:33,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:33,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:06:33,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:33,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:06:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:06:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:33,340 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 13:06:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:33,617 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:06:33,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:06:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:06:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:06:33,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 13:06:33,827 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:06:33,828 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:06:33,828 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:06:33,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 3 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:06:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:06:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:06:33,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:33,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:33,850 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:33,851 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:33,853 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:06:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:33,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:33,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:33,854 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:33,854 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:33,856 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:06:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:33,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:33,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:33,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:33,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:06:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:06:33,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:06:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:33,858 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:06:33,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:06:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:06:33,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:33,859 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:33,860 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:33,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2018-11-23 13:06:33,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:33,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:33,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:33,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:33,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:34,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:06:34,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:06:34,132 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:06:34,132 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret1 := main(); {222#true} is VALID [2018-11-23 13:06:34,133 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 0;~y~0 := 1; {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:34,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {225#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:34,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {226#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:34,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {223#false} is VALID [2018-11-23 13:06:34,137 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:06:34,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:06:34,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:06:34,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:06:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:34,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:34,139 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:06:34,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:34,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:34,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:34,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:34,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:06:34,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:06:34,260 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:06:34,260 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret1 := main(); {222#true} is VALID [2018-11-23 13:06:34,261 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 0;~y~0 := 1; {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:34,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {225#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:34,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {248#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:34,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {223#false} is VALID [2018-11-23 13:06:34,270 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:06:34,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:06:34,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:06:34,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:06:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:34,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:34,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:06:34,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:06:34,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:34,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:06:34,316 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:06:34,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:06:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:06:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:34,317 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 13:06:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:34,470 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:06:34,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:06:34,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:06:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:06:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:06:34,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 13:06:34,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:34,545 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:06:34,546 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:06:34,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 3 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:06:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:06:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:06:34,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:34,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:34,570 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:34,570 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:34,572 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:34,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:34,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:34,573 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:34,573 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:34,574 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:34,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:34,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:34,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:34,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:06:34,577 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:06:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:34,577 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:06:34,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:06:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:06:34,578 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:34,579 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:34,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:34,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2018-11-23 13:06:34,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:34,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:06:34,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:06:34,779 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:06:34,779 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret1 := main(); {346#true} is VALID [2018-11-23 13:06:34,780 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 0;~y~0 := 1; {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:34,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {349#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:34,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {350#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:34,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {351#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:34,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {347#false} is VALID [2018-11-23 13:06:34,789 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {347#false} is VALID [2018-11-23 13:06:34,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:06:34,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:06:34,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:06:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:34,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:34,792 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:06:34,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:34,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:06:34,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:34,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:34,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:06:34,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:06:34,916 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:06:34,916 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret1 := main(); {346#true} is VALID [2018-11-23 13:06:34,916 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 0;~y~0 := 1; {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:34,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {349#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:34,918 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {350#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:34,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {376#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:34,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {347#false} is VALID [2018-11-23 13:06:34,920 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {347#false} is VALID [2018-11-23 13:06:34,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:06:34,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:06:34,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:06:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:34,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:34,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:06:34,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:06:34,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:34,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:06:34,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:34,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:06:34,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:06:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:34,967 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2018-11-23 13:06:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,143 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:06:35,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:06:35,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:06:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:06:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:06:35,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2018-11-23 13:06:35,172 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:06:35,173 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:06:35,173 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:06:35,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:06:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:06:35,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:35,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:35,198 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:35,198 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,199 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:06:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:06:35,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:35,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:35,200 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:35,200 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,202 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:06:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:06:35,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:35,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:35,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:35,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:06:35,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-23 13:06:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:35,205 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:06:35,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:06:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:06:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:06:35,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:35,207 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:35,207 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:35,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:35,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2018-11-23 13:06:35,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:35,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:35,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:35,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:06:35,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:06:35,649 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #31#return; {480#true} is VALID [2018-11-23 13:06:35,650 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret1 := main(); {480#true} is VALID [2018-11-23 13:06:35,651 INFO L273 TraceCheckUtils]: 4: Hoare triple {480#true} ~x~0 := 0;~y~0 := 1; {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:35,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:35,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:35,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:35,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {486#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:35,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {481#false} is VALID [2018-11-23 13:06:35,657 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {481#false} is VALID [2018-11-23 13:06:35,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:06:35,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:06:35,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:06:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:35,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:35,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:35,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:35,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:35,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:35,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:35,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:06:35,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:06:35,915 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #31#return; {480#true} is VALID [2018-11-23 13:06:35,915 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret1 := main(); {480#true} is VALID [2018-11-23 13:06:35,916 INFO L273 TraceCheckUtils]: 4: Hoare triple {480#true} ~x~0 := 0;~y~0 := 1; {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:35,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:35,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:35,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:35,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {514#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:35,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 6); {481#false} is VALID [2018-11-23 13:06:35,922 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {481#false} is VALID [2018-11-23 13:06:35,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:06:35,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:06:35,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:06:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:35,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:35,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:06:35,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 13:06:35,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:35,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:06:35,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:35,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:06:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:06:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:06:35,964 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-11-23 13:06:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:36,175 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:06:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:06:36,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 13:06:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:06:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:06:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:06:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:06:36,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2018-11-23 13:06:36,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:36,204 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:06:36,204 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:06:36,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:06:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:06:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:06:36,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:36,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:36,242 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:36,242 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:36,244 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:36,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:36,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:36,245 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:36,245 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:36,247 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:36,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:36,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:36,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:36,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:06:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:06:36,250 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 13:06:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:36,250 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:06:36,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:06:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:06:36,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:36,251 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:36,252 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:36,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2018-11-23 13:06:36,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:36,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:36,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:36,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:36,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:36,838 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-23 13:06:36,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 13:06:36,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 13:06:36,852 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #31#return; {624#true} is VALID [2018-11-23 13:06:36,852 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret1 := main(); {624#true} is VALID [2018-11-23 13:06:36,853 INFO L273 TraceCheckUtils]: 4: Hoare triple {624#true} ~x~0 := 0;~y~0 := 1; {626#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:36,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {626#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {627#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:36,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {627#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:36,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {629#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:36,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:36,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {631#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:36,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {631#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {625#false} is VALID [2018-11-23 13:06:36,864 INFO L256 TraceCheckUtils]: 11: Hoare triple {625#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {625#false} is VALID [2018-11-23 13:06:36,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2018-11-23 13:06:36,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2018-11-23 13:06:36,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 13:06:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:36,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:36,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:36,882 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:36,900 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 13:06:36,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:36,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:37,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 13:06:37,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 13:06:37,019 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #31#return; {624#true} is VALID [2018-11-23 13:06:37,020 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret1 := main(); {624#true} is VALID [2018-11-23 13:06:37,024 INFO L273 TraceCheckUtils]: 4: Hoare triple {624#true} ~x~0 := 0;~y~0 := 1; {626#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:37,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {626#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {627#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:37,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {627#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:37,027 INFO L273 TraceCheckUtils]: 7: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {629#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:37,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:37,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:37,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {625#false} is VALID [2018-11-23 13:06:37,030 INFO L256 TraceCheckUtils]: 11: Hoare triple {625#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {625#false} is VALID [2018-11-23 13:06:37,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2018-11-23 13:06:37,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2018-11-23 13:06:37,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 13:06:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:37,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:37,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:06:37,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:06:37,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:37,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:06:37,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:37,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:06:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:06:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:37,068 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-11-23 13:06:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:37,298 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:06:37,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:06:37,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:06:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:06:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:06:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:06:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:06:37,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2018-11-23 13:06:37,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:37,337 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:06:37,337 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:06:37,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:06:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:06:37,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:37,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:37,353 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:37,353 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:37,355 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:06:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:06:37,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:37,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:37,356 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:37,356 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:37,358 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:06:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:06:37,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:37,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:37,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:37,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:06:37,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-23 13:06:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:37,361 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:06:37,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:06:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:06:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:06:37,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:37,362 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:37,362 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:37,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:37,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2018-11-23 13:06:37,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:37,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:37,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:37,412 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #31#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 0;~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=1, main_~y~0=2] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=2, main_~y~0=4] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=3, main_~y~0=8] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=4, main_~y~0=16] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=5, main_~y~0=32] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=6, main_~y~0=64] [?] assume !(~x~0 % 4294967296 < 6); VAL [main_~x~0=6, main_~y~0=64] [?] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] assume !(~x~0 % 4294967296 < 6); VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] assume !(~x~0 % 4294967296 < 6); VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(x != 6) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:06:37,448 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:06:37,448 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:06:37,448 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:06:37,448 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:06:37,448 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:06:37,449 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:06:37,449 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:06:37,449 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:06:37,449 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:06:37,449 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:06:37,449 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:06:37,449 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:06:37,450 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:06:37,450 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:06:37,450 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-23 13:06:37,450 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-23 13:06:37,450 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:06:37,450 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:06:37,450 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 13:06:37,451 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:06:37,451 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:06:37,451 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:06:37,451 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:06:37,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:06:37 BoogieIcfgContainer [2018-11-23 13:06:37,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:06:37,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:06:37,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:06:37,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:06:37,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:31" (3/4) ... [2018-11-23 13:06:37,458 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #31#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 0;~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=1, main_~y~0=2] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=2, main_~y~0=4] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=3, main_~y~0=8] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=4, main_~y~0=16] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=5, main_~y~0=32] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=6, main_~y~0=64] [?] assume !(~x~0 % 4294967296 < 6); VAL [main_~x~0=6, main_~y~0=64] [?] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] assume !(~x~0 % 4294967296 < 6); VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] assume !(~x~0 % 4294967296 < 6); VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(x != 6) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:06:37,523 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/underapprox_false-unreach-call2_true-termination.i-witness.graphml [2018-11-23 13:06:37,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:06:37,525 INFO L168 Benchmark]: Toolchain (without parser) took 6617.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -393.1 MB). Peak memory consumption was 335.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:37,526 INFO L168 Benchmark]: CDTParser took 0.22 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:06:37,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.33 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:06:37,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.42 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:06:37,528 INFO L168 Benchmark]: Boogie Preprocessor took 20.19 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:06:37,528 INFO L168 Benchmark]: RCFGBuilder took 495.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:37,529 INFO L168 Benchmark]: TraceAbstraction took 5700.56 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: 386.5 MB). Peak memory consumption was 386.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:37,530 INFO L168 Benchmark]: Witness Printer took 69.69 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:06:37,534 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.22 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 302.33 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 22.42 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 20.19 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 495.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5700.56 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: 386.5 MB). Peak memory consumption was 386.5 MB. Max. memory is 7.1 GB. * Witness Printer took 69.69 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: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(x != 6) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. UNSAFE Result, 5.6s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 0 SDslu, 206 SDs, 0 SdLazy, 141 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 4835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...