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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:40:55,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:40:55,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:40:55,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:40:55,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:40:55,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:40:55,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:40:55,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:40:55,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:40:55,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:40:55,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:40:55,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:40:55,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:40:55,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:40:55,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:40:55,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:40:55,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:40:55,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:40:55,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:40:55,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:40:55,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:40:55,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:40:55,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:40:55,054 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:40:55,055 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:40:55,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:40:55,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:40:55,058 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:40:55,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:40:55,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:40:55,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:40:55,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:40:55,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:40:55,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:40:55,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:40:55,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:40:55,064 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:40:55,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:40:55,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:40:55,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:40:55,081 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:40:55,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:40:55,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:40:55,082 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:40:55,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:40:55,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:40:55,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:40:55,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:40:55,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:40:55,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:40:55,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:40:55,084 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:40:55,084 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:40:55,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:40:55,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:40:55,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:40:55,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:40:55,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:40:55,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:40:55,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:40:55,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:40:55,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:40:55,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:40:55,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:40:55,086 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:40:55,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:40:55,087 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:40:55,087 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:40:55,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:40:55,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:40:55,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:40:55,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:40:55,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:40:55,151 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:40:55,151 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i [2018-11-14 16:40:55,214 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1aeb5c23/b619d79b0d6b4535acb688275b269fe4/FLAGb8fe8dd4f [2018-11-14 16:40:55,652 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:40:55,653 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i [2018-11-14 16:40:55,662 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1aeb5c23/b619d79b0d6b4535acb688275b269fe4/FLAGb8fe8dd4f [2018-11-14 16:40:55,679 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1aeb5c23/b619d79b0d6b4535acb688275b269fe4 [2018-11-14 16:40:55,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:40:55,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:40:55,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:40:55,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:40:55,700 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:40:55,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:40:55" (1/1) ... [2018-11-14 16:40:55,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e73d3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:55, skipping insertion in model container [2018-11-14 16:40:55,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:40:55" (1/1) ... [2018-11-14 16:40:55,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:40:55,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:40:56,006 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:40:56,014 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:40:56,034 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:40:56,053 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:40:56,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56 WrapperNode [2018-11-14 16:40:56,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:40:56,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:40:56,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:40:56,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:40:56,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (1/1) ... [2018-11-14 16:40:56,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (1/1) ... [2018-11-14 16:40:56,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (1/1) ... [2018-11-14 16:40:56,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (1/1) ... [2018-11-14 16:40:56,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (1/1) ... [2018-11-14 16:40:56,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (1/1) ... [2018-11-14 16:40:56,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (1/1) ... [2018-11-14 16:40:56,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:40:56,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:40:56,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:40:56,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:40:56,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (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-14 16:40:56,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:40:56,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:40:56,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:40:56,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:40:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:40:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:40:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 16:40:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:40:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:40:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:40:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:40:56,717 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:40:56,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:40:56 BoogieIcfgContainer [2018-11-14 16:40:56,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:40:56,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:40:56,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:40:56,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:40:56,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:40:55" (1/3) ... [2018-11-14 16:40:56,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688dc656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:40:56, skipping insertion in model container [2018-11-14 16:40:56,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:56" (2/3) ... [2018-11-14 16:40:56,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688dc656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:40:56, skipping insertion in model container [2018-11-14 16:40:56,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:40:56" (3/3) ... [2018-11-14 16:40:56,727 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_true-unreach-call2_false-termination.i [2018-11-14 16:40:56,737 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:40:56,747 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:40:56,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:40:56,794 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:40:56,795 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:40:56,795 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:40:56,796 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:40:56,796 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:40:56,796 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:40:56,796 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:40:56,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:40:56,797 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:40:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 16:40:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:40:56,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:56,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:56,827 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:56,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1994259344, now seen corresponding path program 1 times [2018-11-14 16:40:56,838 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:56,839 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:56,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:56,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:56,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 16:40:56,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 16:40:56,972 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #42#return; {23#true} is VALID [2018-11-14 16:40:56,973 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-14 16:40:56,973 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 1bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2018-11-14 16:40:56,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!~bvugt32(~y~0, 0bv32); {23#true} is VALID [2018-11-14 16:40:56,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-14 16:40:56,981 INFO L256 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-14 16:40:56,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-14 16:40:56,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume ~cond == 0bv32; {24#false} is VALID [2018-11-14 16:40:56,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 16:40:56,984 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-14 16:40:56,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:40:56,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:40:56,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:40:56,997 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:40:57,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:57,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:40:57,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:57,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:40:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:40:57,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:40:57,060 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-14 16:40:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:57,210 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 16:40:57,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:40:57,210 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:40:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:40:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-14 16:40:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:40:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-14 16:40:57,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-14 16:40:57,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:57,583 INFO L225 Difference]: With dead ends: 31 [2018-11-14 16:40:57,583 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 16:40:57,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:40:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 16:40:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 16:40:57,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:57,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 16:40:57,648 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:40:57,648 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:40:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:57,652 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 16:40:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 16:40:57,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:57,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:57,653 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:40:57,653 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:40:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:57,658 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 16:40:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 16:40:57,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:57,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:57,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:57,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:40:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-14 16:40:57,665 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-11-14 16:40:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:57,665 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-14 16:40:57,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:40:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 16:40:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:40:57,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:57,667 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:57,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:57,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2119643788, now seen corresponding path program 1 times [2018-11-14 16:40:57,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:57,668 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:57,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:57,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:58,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2018-11-14 16:40:58,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {146#true} assume true; {146#true} is VALID [2018-11-14 16:40:58,082 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} #42#return; {146#true} is VALID [2018-11-14 16:40:58,082 INFO L256 TraceCheckUtils]: 3: Hoare triple {146#true} call #t~ret3 := main(); {146#true} is VALID [2018-11-14 16:40:58,084 INFO L273 TraceCheckUtils]: 4: Hoare triple {146#true} ~x~0 := 1bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {163#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:58,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {163#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvugt32(~y~0, 0bv32); {167#(and (bvugt main_~y~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:58,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {167#(and (bvugt main_~y~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {167#(and (bvugt main_~y~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:58,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {167#(and (bvugt main_~y~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvult32(~x~0, ~y~0); {174#(and (bvugt main_~y~0 (_ bv0 32)) (not (bvult main_~x~0 main_~y~0)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:58,089 INFO L256 TraceCheckUtils]: 8: Hoare triple {174#(and (bvugt main_~y~0 (_ bv0 32)) (not (bvult main_~x~0 main_~y~0)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1bv32 else 0bv32)); {178#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:58,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {178#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {182#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:58,096 INFO L273 TraceCheckUtils]: 10: Hoare triple {182#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {147#false} is VALID [2018-11-14 16:40:58,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {147#false} assume !false; {147#false} is VALID [2018-11-14 16:40:58,100 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-14 16:40:58,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:40:58,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:40:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:40:58,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-14 16:40:58,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:58,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:40:58,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:58,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:40:58,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:40:58,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:40:58,133 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-11-14 16:40:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:58,941 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 16:40:58,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:40:58,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-14 16:40:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:40:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-14 16:40:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:40:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-14 16:40:58,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2018-11-14 16:40:59,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:59,100 INFO L225 Difference]: With dead ends: 22 [2018-11-14 16:40:59,100 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 16:40:59,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:40:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 16:40:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-14 16:40:59,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:59,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-14 16:40:59,154 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 16:40:59,154 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 16:40:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:59,156 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-14 16:40:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 16:40:59,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:59,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:59,157 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 16:40:59,157 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 16:40:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:59,159 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-14 16:40:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 16:40:59,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:59,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:59,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:59,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:40:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-14 16:40:59,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2018-11-14 16:40:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:59,163 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-14 16:40:59,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:40:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 16:40:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:40:59,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:59,164 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:59,165 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:59,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1089190421, now seen corresponding path program 1 times [2018-11-14 16:40:59,166 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:59,166 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:59,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:59,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:59,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2018-11-14 16:40:59,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2018-11-14 16:40:59,425 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #42#return; {281#true} is VALID [2018-11-14 16:40:59,425 INFO L256 TraceCheckUtils]: 3: Hoare triple {281#true} call #t~ret3 := main(); {281#true} is VALID [2018-11-14 16:40:59,427 INFO L273 TraceCheckUtils]: 4: Hoare triple {281#true} ~x~0 := 1bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {298#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:59,428 INFO L273 TraceCheckUtils]: 5: Hoare triple {298#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvugt32(~y~0, 0bv32); {298#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:59,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {298#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {298#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:59,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {298#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, ~y~0); {308#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvult main_~x~0 main_~y~0))} is VALID [2018-11-14 16:40:59,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {308#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvult main_~x~0 main_~y~0))} assume !~bvult32(~x~0, ~bvudiv32(~y~0, ~x~0));#t~post2 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {282#false} is VALID [2018-11-14 16:40:59,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#false} assume true; {282#false} is VALID [2018-11-14 16:40:59,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {282#false} assume !~bvult32(~x~0, ~y~0); {282#false} is VALID [2018-11-14 16:40:59,433 INFO L256 TraceCheckUtils]: 11: Hoare triple {282#false} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1bv32 else 0bv32)); {282#false} is VALID [2018-11-14 16:40:59,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {282#false} ~cond := #in~cond; {282#false} is VALID [2018-11-14 16:40:59,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {282#false} assume ~cond == 0bv32; {282#false} is VALID [2018-11-14 16:40:59,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {282#false} assume !false; {282#false} is VALID [2018-11-14 16:40:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:40:59,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:40:59,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:40:59,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:40:59,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 16:40:59,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:59,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:40:59,505 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-14 16:40:59,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:40:59,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:40:59,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:40:59,506 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 4 states. [2018-11-14 16:40:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:59,603 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 16:40:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:40:59,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 16:40:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:40:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 16:40:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:40:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 16:40:59,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2018-11-14 16:40:59,698 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-14 16:40:59,698 INFO L225 Difference]: With dead ends: 19 [2018-11-14 16:40:59,698 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:40:59,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:40:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:40:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:40:59,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:59,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:59,700 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:59,700 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:59,700 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:40:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:59,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:59,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:59,701 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:59,701 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:59,701 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:40:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:59,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:59,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:59,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:59,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:40:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:40:59,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-14 16:40:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:59,703 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:40:59,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:40:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:59,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:59,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:40:59,946 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-14 16:41:00,040 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 16:41:00,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:41:00,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:41:00,041 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:41:00,041 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:41:00,042 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:41:00,042 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 22) the Hoare annotation is: true [2018-11-14 16:41:00,042 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2018-11-14 16:41:00,042 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2018-11-14 16:41:00,043 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-14 16:41:00,043 INFO L425 ceAbstractionStarter]: For program point L14-1(lines 14 20) no Hoare annotation was computed. [2018-11-14 16:41:00,043 INFO L421 ceAbstractionStarter]: At program point L15-2(lines 14 20) the Hoare annotation is: (and (bvugt main_~y~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-14 16:41:00,043 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2018-11-14 16:41:00,043 INFO L421 ceAbstractionStarter]: At program point L14-3(lines 14 20) the Hoare annotation is: (and (bvugt main_~y~0 (_ bv0 32)) (not (bvult main_~x~0 main_~y~0)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-14 16:41:00,044 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-14 16:41:00,044 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-14 16:41:00,044 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-14 16:41:00,044 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-14 16:41:00,044 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-14 16:41:00,044 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-14 16:41:00,046 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:41:00,047 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 16:41:00,047 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:41:00,047 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:41:00,047 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:41:00,047 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 16:41:00,048 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 16:41:00,048 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:41:00,048 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:41:00,048 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:41:00,048 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:41:00,048 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 16:41:00,057 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-14 16:41:00,057 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-14 16:41:00,057 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-14 16:41:00,057 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:41:00,057 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 16:41:00,058 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 16:41:00,058 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:41:00,058 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 16:41:00,058 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 16:41:00,058 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 16:41:00,058 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:41:00,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:41:00 BoogieIcfgContainer [2018-11-14 16:41:00,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:41:00,068 INFO L168 Benchmark]: Toolchain (without parser) took 4377.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -638.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. [2018-11-14 16:41:00,069 INFO L168 Benchmark]: CDTParser took 0.25 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-14 16:41:00,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.19 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-14 16:41:00,071 INFO L168 Benchmark]: Boogie Preprocessor took 37.37 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-14 16:41:00,071 INFO L168 Benchmark]: RCFGBuilder took 625.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:41:00,072 INFO L168 Benchmark]: TraceAbstraction took 3346.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 145.1 MB). Peak memory consumption was 145.1 MB. Max. memory is 7.1 GB. [2018-11-14 16:41:00,076 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.25 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 361.19 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 Preprocessor took 37.37 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 625.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3346.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 145.1 MB). Peak memory consumption was 145.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ~bvugt32(y, 0bv32) && ~bvadd64(x, 4294967295bv32) == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 9 SDslu, 36 SDs, 0 SdLazy, 31 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 27 HoareAnnotationTreeSize, 9 FomulaSimplifications, 13 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 1137 SizeOfPredicates, 2 NumberOfNonLiveVariables, 66 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...