java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:30:45,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:30:45,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:30:45,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:30:45,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:30:45,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:30:45,982 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:30:45,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:30:45,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:30:45,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:30:45,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:30:45,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:30:45,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:30:45,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:30:45,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:30:45,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:30:45,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:30:45,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:30:45,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:30:45,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:30:45,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:30:46,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:30:46,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:30:46,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:30:46,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:30:46,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:30:46,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:30:46,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:30:46,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:30:46,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:30:46,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:30:46,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:30:46,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:30:46,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:30:46,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:30:46,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:30:46,011 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-23 11:30:46,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:30:46,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:30:46,031 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:30:46,031 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:30:46,031 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:30:46,032 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:30:46,032 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:30:46,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:30:46,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:30:46,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:30:46,035 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:30:46,035 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:30:46,035 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:30:46,035 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:30:46,036 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:30:46,036 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:30:46,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:30:46,036 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:30:46,036 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:30:46,037 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:30:46,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:30:46,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:30:46,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:30:46,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:30:46,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:46,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:30:46,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:30:46,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:30:46,038 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:30:46,040 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:30:46,040 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:30:46,040 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:30:46,040 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:30:46,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:30:46,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:30:46,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:30:46,102 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:30:46,103 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:30:46,104 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i [2018-11-23 11:30:46,165 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab66f7e52/d6928d88f65b40158308bb4e5494ba0b/FLAGf3c76d0ea [2018-11-23 11:30:46,658 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:30:46,659 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i [2018-11-23 11:30:46,667 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab66f7e52/d6928d88f65b40158308bb4e5494ba0b/FLAGf3c76d0ea [2018-11-23 11:30:47,015 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab66f7e52/d6928d88f65b40158308bb4e5494ba0b [2018-11-23 11:30:47,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:30:47,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:30:47,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:47,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:30:47,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:30:47,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339f1d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47, skipping insertion in model container [2018-11-23 11:30:47,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:30:47,073 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:30:47,300 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:47,307 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:30:47,325 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:47,342 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:30:47,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47 WrapperNode [2018-11-23 11:30:47,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:47,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:47,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:30:47,345 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:30:47,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:47,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:30:47,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:30:47,372 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:30:47,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... [2018-11-23 11:30:47,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:30:47,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:30:47,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:30:47,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:30:47,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:47,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:30:47,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:30:47,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:30:47,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:30:47,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:30:47,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:30:47,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:30:47,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:30:47,901 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:30:47,901 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:30:47,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:47 BoogieIcfgContainer [2018-11-23 11:30:47,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:30:47,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:30:47,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:30:47,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:30:47,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:47" (1/3) ... [2018-11-23 11:30:47,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d9c8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:47, skipping insertion in model container [2018-11-23 11:30:47,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:47" (2/3) ... [2018-11-23 11:30:47,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d9c8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:47, skipping insertion in model container [2018-11-23 11:30:47,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:47" (3/3) ... [2018-11-23 11:30:47,913 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call2_true-termination.i [2018-11-23 11:30:47,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:30:47,931 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:30:47,950 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:30:47,984 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:30:47,984 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:30:47,985 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:30:47,985 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:30:47,985 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:30:47,985 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:30:47,985 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:30:47,985 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:30:47,986 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:30:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:30:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:30:48,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:48,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:48,015 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:48,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:30:48,027 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:48,028 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-23 11:30:48,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:48,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:48,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:30:48,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:30:48,218 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:30:48,219 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 11:30:48,220 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 0bv32;~y~0 := 1bv32; {37#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:48,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {21#false} is VALID [2018-11-23 11:30:48,224 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 6bv32 == ~x~0 then 1bv32 else 0bv32)); {21#false} is VALID [2018-11-23 11:30:48,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 11:30:48,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:30:48,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:30:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:48,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:48,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:48,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:30:48,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:30:48,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:48,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:30:48,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:48,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:30:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:30:48,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:30:48,288 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 11:30:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:48,455 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:30:48,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:30:48,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:30:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:30:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:30:48,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 11:30:48,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:48,805 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:30:48,806 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:30:48,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:30:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:30:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:30:48,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:48,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:48,862 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:48,862 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:48,865 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:30:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:48,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:48,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:48,866 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:48,866 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:48,869 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:30:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:48,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:48,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:48,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:48,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:30:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:30:48,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:30:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:48,875 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:30:48,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:30:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:30:48,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:48,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:48,876 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:48,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:30:48,877 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:48,877 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-23 11:30:48,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:48,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:49,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:30:49,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:30:49,032 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:30:49,032 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret1 := main(); {135#true} is VALID [2018-11-23 11:30:49,032 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 0bv32;~y~0 := 1bv32; {152#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:49,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {156#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:49,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {136#false} is VALID [2018-11-23 11:30:49,034 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 6bv32 == ~x~0 then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:30:49,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:30:49,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:30:49,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:30:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:49,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:49,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:30:49,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:30:49,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:30:49,226 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 6bv32 == ~x~0 then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:30:49,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {184#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {136#false} is VALID [2018-11-23 11:30:49,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {184#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-23 11:30:49,232 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 0bv32;~y~0 := 1bv32; {188#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:49,232 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret1 := main(); {135#true} is VALID [2018-11-23 11:30:49,233 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:30:49,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:30:49,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:30:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:49,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:49,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:30:49,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:30:49,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:49,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:30:49,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:49,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:30:49,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:30:49,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:30:49,266 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 11:30:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:49,435 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:30:49,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:30:49,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:30:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:30:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:30:49,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2018-11-23 11:30:49,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:49,546 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:30:49,546 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:30:49,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:30:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:30:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:30:49,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:49,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:49,560 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:49,561 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:49,563 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:30:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:49,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:49,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:49,564 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:49,564 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:49,566 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:30:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:49,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:49,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:49,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:49,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:30:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:30:49,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:30:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:49,570 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:30:49,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:30:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:30:49,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:49,571 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:49,571 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:49,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:49,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 2 times [2018-11-23 11:30:49,572 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:49,573 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-23 11:30:49,589 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:30:49,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:30:49,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:30:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:49,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:50,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:30:50,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:30:50,096 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:30:50,097 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret1 := main(); {297#true} is VALID [2018-11-23 11:30:50,097 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 0bv32;~y~0 := 1bv32; {314#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:50,098 INFO L273 TraceCheckUtils]: 5: Hoare triple {314#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {318#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:50,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {322#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:30:50,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {326#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:50,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {330#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:30:50,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(= (_ bv4 32) main_~x~0)} assume !~bvult32(~x~0, 6bv32); {298#false} is VALID [2018-11-23 11:30:50,150 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert((if 6bv32 == ~x~0 then 1bv32 else 0bv32)); {298#false} is VALID [2018-11-23 11:30:50,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:30:50,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:30:50,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:30:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:50,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:50,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:30:50,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:30:50,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:30:50,421 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert((if 6bv32 == ~x~0 then 1bv32 else 0bv32)); {298#false} is VALID [2018-11-23 11:30:50,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {298#false} is VALID [2018-11-23 11:30:50,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {358#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-23 11:30:50,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {366#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {362#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:50,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {370#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {366#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:50,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {370#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:50,438 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 0bv32;~y~0 := 1bv32; {374#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:50,439 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret1 := main(); {297#true} is VALID [2018-11-23 11:30:50,439 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:30:50,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:30:50,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:30:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:50,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:50,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:30:50,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:30:50,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:50,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:30:50,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:50,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:30:50,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:30:50,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:30:50,497 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-11-23 11:30:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:50,906 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:30:50,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:30:50,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:30:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:30:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:30:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:30:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:30:50,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2018-11-23 11:30:50,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:50,959 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:30:50,959 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:30:50,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:30:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:30:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:30:50,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:50,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:50,973 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:50,973 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:50,975 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:30:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:30:50,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:50,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:50,976 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:50,976 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:50,978 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:30:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:30:50,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:50,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:50,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:50,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:30:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 11:30:50,981 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 11:30:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:50,981 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 11:30:50,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:30:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:30:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:30:50,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:50,983 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:50,983 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:50,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 3 times [2018-11-23 11:30:50,984 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:50,984 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:30:51,003 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:30:51,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:30:51,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:30:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:51,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:51,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 11:30:51,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 11:30:51,246 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {493#true} {493#true} #31#return; {493#true} is VALID [2018-11-23 11:30:51,247 INFO L256 TraceCheckUtils]: 3: Hoare triple {493#true} call #t~ret1 := main(); {493#true} is VALID [2018-11-23 11:30:51,247 INFO L273 TraceCheckUtils]: 4: Hoare triple {493#true} ~x~0 := 0bv32;~y~0 := 1bv32; {493#true} is VALID [2018-11-23 11:30:51,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {493#true} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {493#true} is VALID [2018-11-23 11:30:51,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {493#true} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {493#true} is VALID [2018-11-23 11:30:51,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {493#true} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {493#true} is VALID [2018-11-23 11:30:51,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {493#true} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {493#true} is VALID [2018-11-23 11:30:51,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {493#true} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {493#true} is VALID [2018-11-23 11:30:51,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {493#true} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {528#(bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:51,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {528#(bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {532#(and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv6 32)) (not (bvult main_~x~0 (_ bv6 32))))} is VALID [2018-11-23 11:30:51,259 INFO L256 TraceCheckUtils]: 12: Hoare triple {532#(and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv6 32)) (not (bvult main_~x~0 (_ bv6 32))))} call __VERIFIER_assert((if 6bv32 == ~x~0 then 1bv32 else 0bv32)); {536#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:51,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {536#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {540#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:51,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {540#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {494#false} is VALID [2018-11-23 11:30:51,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 11:30:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 11:30:51,262 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:51,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:51,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:30:51,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:30:51,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:51,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:30:51,285 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-23 11:30:51,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:30:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:30:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:30:51,286 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-23 11:30:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:51,494 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:30:51,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:30:51,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:30:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-23 11:30:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-11-23 11:30:51,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2018-11-23 11:30:51,519 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-23 11:30:51,519 INFO L225 Difference]: With dead ends: 17 [2018-11-23 11:30:51,519 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:30:51,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:30:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:30:51,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:30:51,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:51,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:51,521 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:51,521 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:51,522 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:30:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:51,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:51,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:51,522 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:51,523 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:51,523 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:30:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:51,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:51,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:51,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:51,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:30:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:30:51,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-11-23 11:30:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:51,524 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:30:51,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:30:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:51,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:51,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:30:51,765 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:30:51,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:30:51,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:30:51,766 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:30:51,766 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:30:51,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:30:51,767 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-11-23 11:30:51,767 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-11-23 11:30:51,767 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-11-23 11:30:51,767 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 14) the Hoare annotation is: (or (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv6 32)) (= main_~x~0 (_ bv0 32))) [2018-11-23 11:30:51,767 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv6 32)) (not (bvult main_~x~0 (_ bv6 32)))) [2018-11-23 11:30:51,767 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:30:51,768 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 11:30:51,768 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:30:51,768 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 11:30:51,768 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 11:30:51,768 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 11:30:51,770 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:30:51,771 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:30:51,773 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:30:51,773 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:30:51,778 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:30:51,778 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:30:51,778 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:30:51,778 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:30:51,778 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:30:51,779 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:30:51,779 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:30:51,779 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:30:51,779 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:30:51,779 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:30:51,779 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:30:51,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:51 BoogieIcfgContainer [2018-11-23 11:30:51,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:30:51,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:30:51,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:30:51,788 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:30:51,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:47" (3/4) ... [2018-11-23 11:30:51,792 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:30:51,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:30:51,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:30:51,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:30:51,803 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:30:51,803 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:30:51,804 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:30:51,844 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call2_true-termination.i-witness.graphml [2018-11-23 11:30:51,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:30:51,846 INFO L168 Benchmark]: Toolchain (without parser) took 4819.75 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -522.8 MB). Peak memory consumption was 181.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:51,847 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:51,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:51,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:51,850 INFO L168 Benchmark]: Boogie Preprocessor took 28.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:51,851 INFO L168 Benchmark]: RCFGBuilder took 501.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:51,852 INFO L168 Benchmark]: TraceAbstraction took 3882.48 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 210.4 MB). Peak memory consumption was 210.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:51,853 INFO L168 Benchmark]: Witness Printer took 56.85 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:51,858 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.23 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. * CACSL2BoogieTranslator took 315.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.68 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 501.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3882.48 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 210.4 MB). Peak memory consumption was 210.4 MB. Max. memory is 7.1 GB. * Witness Printer took 56.85 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant Derived loop invariant: ~bvult32(~bvadd64(x, 4294967295bv32), 6bv32) || x == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 4 OverallIterations, 6 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 2 SDslu, 112 SDs, 0 SdLazy, 65 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 24 HoareAnnotationTreeSize, 10 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 51 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1713 SizeOfPredicates, 5 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 21/43 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...