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-Const.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:29:19,973 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:29:19,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:29:19,988 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:29:19,988 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:29:19,989 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:29:19,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:29:19,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:29:19,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:29:19,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:29:19,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:29:20,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:29:20,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:29:20,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:29:20,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:29:20,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:29:20,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:29:20,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:29:20,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:29:20,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:29:20,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:29:20,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:29:20,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:29:20,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:29:20,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:29:20,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:29:20,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:29:20,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:29:20,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:29:20,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:29:20,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:29:20,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:29:20,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:29:20,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:29:20,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:29:20,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:29:20,037 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:29:20,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:29:20,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:29:20,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:29:20,053 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:29:20,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:29:20,054 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:29:20,054 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:29:20,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:29:20,054 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:29:20,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:29:20,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:29:20,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:29:20,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:29:20,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:29:20,055 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:29:20,055 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:29:20,056 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:29:20,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:29:20,056 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:29:20,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:29:20,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:29:20,057 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:29:20,057 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:29:20,057 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:29:20,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:29:20,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:29:20,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:29:20,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:29:20,058 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:29:20,058 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:29:20,059 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:29:20,059 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:29:20,059 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:29:20,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:29:20,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:29:20,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:29:20,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:29:20,139 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:29:20,139 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call3_true-termination.i [2018-11-14 18:29:20,212 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab70f9085/b1dd22529cfe4afdb36c27d25fd3310b/FLAG725820942 [2018-11-14 18:29:20,632 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:29:20,633 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call3_true-termination.i [2018-11-14 18:29:20,638 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab70f9085/b1dd22529cfe4afdb36c27d25fd3310b/FLAG725820942 [2018-11-14 18:29:20,660 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab70f9085/b1dd22529cfe4afdb36c27d25fd3310b [2018-11-14 18:29:20,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:29:20,676 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:29:20,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:29:20,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:29:20,681 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:29:20,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:29:20" (1/1) ... [2018-11-14 18:29:20,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53863ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:20, skipping insertion in model container [2018-11-14 18:29:20,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:29:20" (1/1) ... [2018-11-14 18:29:20,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:29:20,722 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:29:20,969 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:29:20,975 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:29:20,993 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:29:21,009 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:29:21,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21 WrapperNode [2018-11-14 18:29:21,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:29:21,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:29:21,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:29:21,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:29:21,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (1/1) ... [2018-11-14 18:29:21,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (1/1) ... [2018-11-14 18:29:21,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (1/1) ... [2018-11-14 18:29:21,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (1/1) ... [2018-11-14 18:29:21,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (1/1) ... [2018-11-14 18:29:21,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (1/1) ... [2018-11-14 18:29:21,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (1/1) ... [2018-11-14 18:29:21,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:29:21,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:29:21,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:29:21,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:29:21,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (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 18:29:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:29:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:29:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:29:21,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:29:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:29:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 18:29:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:29:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:29:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:29:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:29:21,567 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:29:21,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:29:21 BoogieIcfgContainer [2018-11-14 18:29:21,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:29:21,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:29:21,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:29:21,574 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:29:21,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:29:20" (1/3) ... [2018-11-14 18:29:21,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f543d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:29:21, skipping insertion in model container [2018-11-14 18:29:21,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:21" (2/3) ... [2018-11-14 18:29:21,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f543d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:29:21, skipping insertion in model container [2018-11-14 18:29:21,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:29:21" (3/3) ... [2018-11-14 18:29:21,578 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call3_true-termination.i [2018-11-14 18:29:21,589 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:29:21,599 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:29:21,613 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:29:21,652 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:29:21,653 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:29:21,653 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:29:21,654 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:29:21,654 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:29:21,654 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:29:21,654 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:29:21,654 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:29:21,654 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:29:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 18:29:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 18:29:21,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:21,687 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:21,690 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:21,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:21,696 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-14 18:29:21,700 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:21,700 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 18:29:21,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:21,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:21,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 18:29:21,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 18:29:21,827 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-14 18:29:21,827 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-14 18:29:21,828 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0bv32;~N~0 := #t~nondet0[16:0];havoc #t~nondet0; {21#true} is VALID [2018-11-14 18:29:21,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-14 18:29:21,830 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == 0bv32 then 1bv32 else 0bv32)); {22#false} is VALID [2018-11-14 18:29:21,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-14 18:29:21,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~cond == 0bv32; {22#false} is VALID [2018-11-14 18:29:21,831 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 18:29:21,834 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 18:29:21,834 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:21,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:21,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:29:21,844 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 18:29:21,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:21,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:29:21,896 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-14 18:29:21,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:29:21,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:29:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:29:21,908 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-14 18:29:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:21,987 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 18:29:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:29:21,988 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 18:29:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:29:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 18:29:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:29:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 18:29:22,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-14 18:29:22,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:22,253 INFO L225 Difference]: With dead ends: 29 [2018-11-14 18:29:22,253 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 18:29:22,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 18:29:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 18:29:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 18:29:22,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:22,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:22,341 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:22,341 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:22,345 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 18:29:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 18:29:22,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:22,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:22,347 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:22,347 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:22,352 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 18:29:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 18:29:22,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:22,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:22,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:22,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:29:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 18:29:22,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 18:29:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:22,361 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 18:29:22,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:29:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 18:29:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:29:22,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:22,362 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:22,362 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:22,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-14 18:29:22,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:22,363 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 18:29:22,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:22,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:22,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-14 18:29:22,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-14 18:29:22,593 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} #32#return; {133#true} is VALID [2018-11-14 18:29:22,593 INFO L256 TraceCheckUtils]: 3: Hoare triple {133#true} call #t~ret1 := main(); {133#true} is VALID [2018-11-14 18:29:22,607 INFO L273 TraceCheckUtils]: 4: Hoare triple {133#true} ~x~0 := 0bv32;~N~0 := #t~nondet0[16:0];havoc #t~nondet0; {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 18:29:22,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {150#(= main_~x~0 (_ bv0 32))} assume true; {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 18:29:22,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {150#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, ~zero_extendFrom16To32(~N~0)); {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 18:29:22,627 INFO L256 TraceCheckUtils]: 7: Hoare triple {150#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == 0bv32 then 1bv32 else 0bv32)); {160#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:22,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {160#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {164#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:22,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {164#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {134#false} is VALID [2018-11-14 18:29:22,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {134#false} assume !false; {134#false} is VALID [2018-11-14 18:29:22,632 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 18:29:22,632 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:22,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:22,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:29:22,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 18:29:22,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:22,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:29:22,688 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 18:29:22,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:29:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:29:22,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:29:22,689 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-14 18:29:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:22,920 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 18:29:22,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:29:22,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 18:29:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:29:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-14 18:29:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:29:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-14 18:29:22,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-14 18:29:22,964 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-14 18:29:22,966 INFO L225 Difference]: With dead ends: 19 [2018-11-14 18:29:22,966 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 18:29:22,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:29:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 18:29:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 18:29:22,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:22,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:22,982 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:22,982 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:22,984 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 18:29:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 18:29:22,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:22,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:22,985 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:22,985 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:22,986 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 18:29:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 18:29:22,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:22,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:22,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:22,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:29:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 18:29:22,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 18:29:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:22,990 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 18:29:22,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:29:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 18:29:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 18:29:22,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:22,991 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:22,991 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:22,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-14 18:29:22,992 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:22,992 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 18:29:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:23,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:23,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2018-11-14 18:29:23,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2018-11-14 18:29:23,484 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #32#return; {251#true} is VALID [2018-11-14 18:29:23,484 INFO L256 TraceCheckUtils]: 3: Hoare triple {251#true} call #t~ret1 := main(); {251#true} is VALID [2018-11-14 18:29:23,499 INFO L273 TraceCheckUtils]: 4: Hoare triple {251#true} ~x~0 := 0bv32;~N~0 := #t~nondet0[16:0];havoc #t~nondet0; {268#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 18:29:23,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {268#(= main_~x~0 (_ bv0 32))} assume true; {268#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 18:29:23,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {268#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, ~zero_extendFrom16To32(~N~0));~x~0 := ~bvadd32(2bv32, ~x~0); {275#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:23,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {275#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {275#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:23,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {275#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvult32(~x~0, ~zero_extendFrom16To32(~N~0)); {275#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:23,513 INFO L256 TraceCheckUtils]: 9: Hoare triple {275#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == 0bv32 then 1bv32 else 0bv32)); {285#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:23,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {289#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:23,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {289#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {252#false} is VALID [2018-11-14 18:29:23,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2018-11-14 18:29:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:23,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:29:23,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2018-11-14 18:29:23,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {299#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {252#false} is VALID [2018-11-14 18:29:23,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {303#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {299#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:29:23,805 INFO L256 TraceCheckUtils]: 9: Hoare triple {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == 0bv32 then 1bv32 else 0bv32)); {303#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:29:23,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} assume !~bvult32(~x~0, ~zero_extendFrom16To32(~N~0)); {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 18:29:23,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} assume true; {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 18:29:23,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, ~zero_extendFrom16To32(~N~0));~x~0 := ~bvadd32(2bv32, ~x~0); {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 18:29:23,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} assume true; {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 18:29:23,852 INFO L273 TraceCheckUtils]: 4: Hoare triple {251#true} ~x~0 := 0bv32;~N~0 := #t~nondet0[16:0];havoc #t~nondet0; {307#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 18:29:23,852 INFO L256 TraceCheckUtils]: 3: Hoare triple {251#true} call #t~ret1 := main(); {251#true} is VALID [2018-11-14 18:29:23,852 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #32#return; {251#true} is VALID [2018-11-14 18:29:23,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2018-11-14 18:29:23,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2018-11-14 18:29:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:29:23,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:29:23,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-14 18:29:23,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-14 18:29:23,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:23,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:29:23,891 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-14 18:29:23,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:29:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:29:23,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:29:23,893 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2018-11-14 18:29:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:24,112 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-14 18:29:24,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:29:24,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-14 18:29:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:29:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-14 18:29:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:29:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-14 18:29:24,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 18 transitions. [2018-11-14 18:29:24,187 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-14 18:29:24,187 INFO L225 Difference]: With dead ends: 17 [2018-11-14 18:29:24,187 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:29:24,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:29:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:29:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:29:24,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:24,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:24,190 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:24,190 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:24,191 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:29:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:29:24,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:24,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:24,191 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:24,196 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:24,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:24,196 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:29:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:29:24,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:24,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:24,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:24,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:29:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:29:24,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-14 18:29:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:24,198 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:29:24,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:29:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:29:24,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:24,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:29:24,577 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 18:29:24,577 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:29:24,577 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:29:24,577 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:29:24,578 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:29:24,578 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:29:24,578 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 16) the Hoare annotation is: true [2018-11-14 18:29:24,578 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 16) no Hoare annotation was computed. [2018-11-14 18:29:24,578 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 16) no Hoare annotation was computed. [2018-11-14 18:29:24,578 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 14) no Hoare annotation was computed. [2018-11-14 18:29:24,578 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 14) the Hoare annotation is: (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))) [2018-11-14 18:29:24,579 INFO L421 ceAbstractionStarter]: At program point L12-4(lines 12 14) the Hoare annotation is: (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))) [2018-11-14 18:29:24,579 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 18:29:24,579 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 18:29:24,579 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 18:29:24,579 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 18:29:24,580 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 18:29:24,580 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 18:29:24,581 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:29:24,582 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:29:24,582 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:29:24,582 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:29:24,583 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 18:29:24,583 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:29:24,583 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:29:24,583 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:29:24,583 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 18:29:24,583 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 18:29:24,583 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:29:24,584 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 18:29:24,584 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 18:29:24,584 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 18:29:24,584 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:29:24,584 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 18:29:24,584 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:29:24,584 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:29:24,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:29:24 BoogieIcfgContainer [2018-11-14 18:29:24,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:29:24,594 INFO L168 Benchmark]: Toolchain (without parser) took 3919.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -637.7 MB). Peak memory consumption was 111.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:29:24,599 INFO L168 Benchmark]: CDTParser took 0.18 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 18:29:24,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.18 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 18:29:24,601 INFO L168 Benchmark]: Boogie Preprocessor took 36.56 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 18:29:24,601 INFO L168 Benchmark]: RCFGBuilder took 520.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 18:29:24,603 INFO L168 Benchmark]: TraceAbstraction took 3023.40 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: 151.8 MB). Peak memory consumption was 151.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:29:24,608 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.18 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 333.18 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 36.56 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 520.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3023.40 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: 151.8 MB). Peak memory consumption was 151.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 0bv32 == ~bvurem32(x, 2bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 2 SDslu, 61 SDs, 0 SdLazy, 37 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 10 PreInvPairs, 15 NumberOfFragments, 15 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1209 SizeOfPredicates, 4 NumberOfNonLiveVariables, 62 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...