java -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.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:59:58,335 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:59:58,337 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:59:58,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:59:58,351 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:59:58,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:59:58,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:59:58,358 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:59:58,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:59:58,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:59:58,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:59:58,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:59:58,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:59:58,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:59:58,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:59:58,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:59:58,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:59:58,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:59:58,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:59:58,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:59:58,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:59:58,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:59:58,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:59:58,399 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:59:58,399 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:59:58,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:59:58,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:59:58,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:59:58,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:59:58,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:59:58,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:59:58,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:59:58,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:59:58,409 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:59:58,410 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:59:58,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:59:58,411 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:59:58,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:59:58,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:59:58,432 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:59:58,432 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:59:58,432 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:59:58,432 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:59:58,432 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:59:58,432 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:59:58,433 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:59:58,433 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:59:58,433 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:59:58,433 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:59:58,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:59:58,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:59:58,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:59:58,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:59:58,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:59:58,438 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:59:58,438 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:59:58,438 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:59:58,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:59:58,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:59:58,439 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:59:58,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:59:58,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:59:58,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:59:58,440 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:59:58,440 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:59:58,440 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:59:58,440 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:59:58,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:59:58,441 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:59:58,441 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:59:58,441 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:59:58,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:59:58,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:59:58,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:59:58,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:59:58,530 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:59:58,531 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call2_true-termination.i [2018-11-07 04:59:58,591 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c052cfa34/41861b3830194cdeb04c3a5378ceaa9b/FLAGd3bfa2fdd [2018-11-07 04:59:59,055 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:59:59,056 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call2_true-termination.i [2018-11-07 04:59:59,068 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c052cfa34/41861b3830194cdeb04c3a5378ceaa9b/FLAGd3bfa2fdd [2018-11-07 04:59:59,082 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c052cfa34/41861b3830194cdeb04c3a5378ceaa9b [2018-11-07 04:59:59,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:59:59,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:59:59,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:59:59,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:59:59,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:59:59,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ede70b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59, skipping insertion in model container [2018-11-07 04:59:59,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:59:59,134 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:59:59,309 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:59:59,313 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:59:59,328 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:59:59,346 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:59:59,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59 WrapperNode [2018-11-07 04:59:59,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:59:59,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:59:59,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:59:59,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:59:59,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:59:59,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:59:59,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:59:59,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:59:59,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (1/1) ... [2018-11-07 04:59:59,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:59:59,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:59:59,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:59:59,395 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:59:59,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (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-07 04:59:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:59:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:59:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:59:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:59:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:59:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:59:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:59:59,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:59:59,725 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:59:59,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:59:59 BoogieIcfgContainer [2018-11-07 04:59:59,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:59:59,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:59:59,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:59:59,730 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:59:59,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:59:59" (1/3) ... [2018-11-07 04:59:59,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481413c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:59:59, skipping insertion in model container [2018-11-07 04:59:59,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:59" (2/3) ... [2018-11-07 04:59:59,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481413c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:59:59, skipping insertion in model container [2018-11-07 04:59:59,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:59:59" (3/3) ... [2018-11-07 04:59:59,733 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call2_true-termination.i [2018-11-07 04:59:59,743 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:59:59,750 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:59:59,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:59:59,799 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:59:59,800 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:59:59,800 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:59:59,800 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:59:59,800 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:59:59,801 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:59:59,801 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:59:59,801 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:59:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-07 04:59:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 04:59:59,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:59,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:59,833 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:59,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-07 04:59:59,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:59,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:59,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:59,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:59,955 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-07 04:59:59,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:59:59,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:59:59,958 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:59:59,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:59:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:59:59,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:59:59,978 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-07 04:59:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:59,998 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-07 04:59:59,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:00:00,000 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 05:00:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:00,008 INFO L225 Difference]: With dead ends: 29 [2018-11-07 05:00:00,008 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 05:00:00,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:00:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 05:00:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 05:00:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 05:00:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 05:00:00,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 05:00:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:00,056 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 05:00:00,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:00:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 05:00:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 05:00:00,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:00,058 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:00,058 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:00,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-07 05:00:00,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,061 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:00,262 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-07 05:00:00,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:00:00,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:00:00,263 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:00:00,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:00:00,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:00:00,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:00:00,266 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 05:00:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:00,347 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 05:00:00,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:00:00,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 05:00:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:00,349 INFO L225 Difference]: With dead ends: 19 [2018-11-07 05:00:00,349 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 05:00:00,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:00:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 05:00:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 05:00:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 05:00:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 05:00:00,359 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 05:00:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:00,359 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 05:00:00,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:00:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 05:00:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 05:00:00,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:00,361 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:00,365 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:00,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-07 05:00:00,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:00,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:00,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,369 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:00,559 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-07 05:00:00,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:00,560 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:00,561 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 05:00:00,563 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-07 05:00:00,614 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:00:00,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:00:00,725 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:00:00,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:00:00,956 INFO L272 AbstractInterpreter]: Visited 12 different actions 64 times. Merged at 3 different actions 25 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 05:00:00,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:00,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:00:00,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:00,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:01,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:01,011 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:01,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:01,108 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-07 05:00:01,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:01,343 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-07 05:00:01,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:01,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 8 [2018-11-07 05:00:01,375 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:01,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 05:00:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 05:00:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:00:01,377 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-07 05:00:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:01,420 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 05:00:01,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 05:00:01,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 05:00:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:01,424 INFO L225 Difference]: With dead ends: 21 [2018-11-07 05:00:01,424 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 05:00:01,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:00:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 05:00:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 05:00:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 05:00:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 05:00:01,433 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 05:00:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:01,433 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 05:00:01,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 05:00:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 05:00:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 05:00:01,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:01,436 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:01,436 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:01,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:01,437 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-07 05:00:01,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:01,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:01,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:01,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:01,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:01,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:01,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:01,703 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:01,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:01,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:01,703 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:01,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:01,723 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:01,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 05:00:01,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:01,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:01,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:01,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:01,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 10 [2018-11-07 05:00:01,996 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:01,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:00:01,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:00:01,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:00:01,998 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-07 05:00:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:02,032 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 05:00:02,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:00:02,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 05:00:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:02,037 INFO L225 Difference]: With dead ends: 23 [2018-11-07 05:00:02,038 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 05:00:02,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:00:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 05:00:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 05:00:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 05:00:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 05:00:02,044 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 05:00:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:02,044 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 05:00:02,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:00:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 05:00:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:00:02,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:02,045 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:02,046 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:02,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-07 05:00:02,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:02,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:02,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:02,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:02,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:02,300 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:02,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:02,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:02,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:02,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:02,315 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:02,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:02,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:02,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:02,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:02,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:02,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 12 [2018-11-07 05:00:02,660 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:02,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:00:02,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:00:02,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:00:02,661 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-07 05:00:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:02,914 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 05:00:02,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:00:02,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 05:00:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:02,916 INFO L225 Difference]: With dead ends: 25 [2018-11-07 05:00:02,917 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 05:00:02,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:00:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 05:00:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 05:00:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 05:00:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 05:00:02,922 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 05:00:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:02,922 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 05:00:02,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:00:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 05:00:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 05:00:02,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:02,924 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:02,924 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:02,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-07 05:00:02,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:02,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:02,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:02,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:02,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:03,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:03,052 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:03,052 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:03,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:03,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:03,053 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:03,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:03,069 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:03,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:03,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:03,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:03,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 14 [2018-11-07 05:00:03,441 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:03,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:00:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:00:03,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:00:03,443 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-07 05:00:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:03,500 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 05:00:03,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:00:03,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 05:00:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:03,501 INFO L225 Difference]: With dead ends: 27 [2018-11-07 05:00:03,502 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 05:00:03,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:00:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 05:00:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 05:00:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 05:00:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 05:00:03,507 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 05:00:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:03,508 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 05:00:03,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:00:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 05:00:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 05:00:03,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:03,508 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:03,509 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:03,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-07 05:00:03,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:03,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:03,510 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:03,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:03,684 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:03,685 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:03,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:03,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:03,685 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:03,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:03,695 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:03,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 05:00:03,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:03,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:03,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:04,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 16 [2018-11-07 05:00:04,077 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:04,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:00:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:00:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:00:04,080 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-07 05:00:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:04,150 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-07 05:00:04,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:00:04,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 05:00:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:04,152 INFO L225 Difference]: With dead ends: 29 [2018-11-07 05:00:04,152 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 05:00:04,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:00:04,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 05:00:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 05:00:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 05:00:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 05:00:04,158 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-07 05:00:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:04,159 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 05:00:04,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:00:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 05:00:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 05:00:04,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:04,160 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:04,160 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:04,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-07 05:00:04,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:04,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:04,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:04,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:04,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 05:00:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 05:00:04,203 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 05:00:04,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:00:04 BoogieIcfgContainer [2018-11-07 05:00:04,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:00:04,244 INFO L168 Benchmark]: Toolchain (without parser) took 5151.08 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -512.8 MB). Peak memory consumption was 197.1 MB. Max. memory is 7.1 GB. [2018-11-07 05:00:04,247 INFO L168 Benchmark]: CDTParser took 0.22 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-07 05:00:04,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.31 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-07 05:00:04,249 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:00:04,250 INFO L168 Benchmark]: Boogie Preprocessor took 23.66 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-07 05:00:04,250 INFO L168 Benchmark]: RCFGBuilder took 330.59 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -761.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:00:04,253 INFO L168 Benchmark]: TraceAbstraction took 4516.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 238.1 MB). Peak memory consumption was 238.1 MB. Max. memory is 7.1 GB. [2018-11-07 05:00:04,260 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 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 252.31 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 23.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.66 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 330.59 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -761.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4516.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 238.1 MB). Peak memory consumption was 238.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(x != 6) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. UNSAFE Result, 4.4s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 0 SDslu, 239 SDs, 0 SdLazy, 133 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 134 SyntacticMatches, 21 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 17741 SizeOfPredicates, 0 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 0/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...