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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 15:51:09,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 15:51:09,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 15:51:09,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 15:51:09,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 15:51:09,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 15:51:09,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 15:51:09,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 15:51:09,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 15:51:09,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 15:51:09,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 15:51:09,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 15:51:09,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 15:51:09,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 15:51:09,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 15:51:09,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 15:51:09,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 15:51:09,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 15:51:09,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 15:51:09,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 15:51:09,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 15:51:09,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 15:51:09,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 15:51:09,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 15:51:09,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 15:51:09,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 15:51:09,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 15:51:09,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 15:51:09,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 15:51:09,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 15:51:09,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 15:51:09,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 15:51:09,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 15:51:09,501 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 15:51:09,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 15:51:09,504 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 15:51:09,504 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 15:51:09,531 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 15:51:09,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 15:51:09,532 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 15:51:09,532 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 15:51:09,533 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 15:51:09,533 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 15:51:09,534 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 15:51:09,534 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 15:51:09,534 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 15:51:09,534 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 15:51:09,534 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 15:51:09,535 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 15:51:09,536 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 15:51:09,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 15:51:09,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 15:51:09,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 15:51:09,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 15:51:09,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 15:51:09,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 15:51:09,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 15:51:09,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 15:51:09,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 15:51:09,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 15:51:09,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:51:09,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 15:51:09,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 15:51:09,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 15:51:09,540 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 15:51:09,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 15:51:09,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 15:51:09,541 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 15:51:09,541 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 15:51:09,542 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 15:51:09,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 15:51:09,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 15:51:09,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 15:51:09,639 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 15:51:09,639 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 15:51:09,640 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-09-14 15:51:09,996 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b2c3c47/79d9c2253a9049aab2d2ffbe33f65f11/FLAGea26cd808 [2018-09-14 15:51:10,165 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 15:51:10,166 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-09-14 15:51:10,172 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b2c3c47/79d9c2253a9049aab2d2ffbe33f65f11/FLAGea26cd808 [2018-09-14 15:51:10,187 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b2c3c47/79d9c2253a9049aab2d2ffbe33f65f11 [2018-09-14 15:51:10,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 15:51:10,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 15:51:10,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 15:51:10,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 15:51:10,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 15:51:10,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e5782b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10, skipping insertion in model container [2018-09-14 15:51:10,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,225 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 15:51:10,416 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:51:10,434 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 15:51:10,442 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:51:10,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10 WrapperNode [2018-09-14 15:51:10,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 15:51:10,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 15:51:10,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 15:51:10,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 15:51:10,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 15:51:10,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 15:51:10,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 15:51:10,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 15:51:10,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (1/1) ... [2018-09-14 15:51:10,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 15:51:10,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 15:51:10,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 15:51:10,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 15:51:10,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (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-09-14 15:51:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 15:51:10,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 15:51:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 15:51:10,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 15:51:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 15:51:10,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 15:51:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-14 15:51:10,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-14 15:51:11,141 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 15:51:11,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:51:11 BoogieIcfgContainer [2018-09-14 15:51:11,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 15:51:11,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 15:51:11,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 15:51:11,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 15:51:11,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 03:51:10" (1/3) ... [2018-09-14 15:51:11,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613bdbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:51:11, skipping insertion in model container [2018-09-14 15:51:11,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:10" (2/3) ... [2018-09-14 15:51:11,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613bdbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:51:11, skipping insertion in model container [2018-09-14 15:51:11,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:51:11" (3/3) ... [2018-09-14 15:51:11,153 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-09-14 15:51:11,163 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 15:51:11,172 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 15:51:11,218 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 15:51:11,218 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 15:51:11,219 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 15:51:11,219 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 15:51:11,219 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 15:51:11,219 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 15:51:11,219 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 15:51:11,220 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 15:51:11,220 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 15:51:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-09-14 15:51:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-14 15:51:11,248 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:11,249 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:11,250 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1538012201, now seen corresponding path program 1 times [2018-09-14 15:51:11,259 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:11,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:11,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:11,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:11,312 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:11,380 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:51:11,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-14 15:51:11,381 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:11,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-14 15:51:11,401 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-14 15:51:11,402 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-14 15:51:11,405 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-09-14 15:51:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:11,439 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-09-14 15:51:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-14 15:51:11,441 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-09-14 15:51:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:11,453 INFO L225 Difference]: With dead ends: 63 [2018-09-14 15:51:11,453 INFO L226 Difference]: Without dead ends: 30 [2018-09-14 15:51:11,458 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-09-14 15:51:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-14 15:51:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-14 15:51:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-14 15:51:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-09-14 15:51:11,501 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 14 [2018-09-14 15:51:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:11,502 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-09-14 15:51:11,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-14 15:51:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-09-14 15:51:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-14 15:51:11,504 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:11,504 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:11,505 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1856547447, now seen corresponding path program 1 times [2018-09-14 15:51:11,506 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:11,507 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:11,620 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:51:11,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 15:51:11,620 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:11,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 15:51:11,622 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 15:51:11,622 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:51:11,623 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-09-14 15:51:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:11,841 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-09-14 15:51:11,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-14 15:51:11,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-09-14 15:51:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:11,843 INFO L225 Difference]: With dead ends: 36 [2018-09-14 15:51:11,843 INFO L226 Difference]: Without dead ends: 34 [2018-09-14 15:51:11,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-14 15:51:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-14 15:51:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-14 15:51:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-14 15:51:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-09-14 15:51:11,861 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2018-09-14 15:51:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:11,861 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-09-14 15:51:11,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 15:51:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-09-14 15:51:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-14 15:51:11,863 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:11,863 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:11,863 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1929535109, now seen corresponding path program 1 times [2018-09-14 15:51:11,863 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:11,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:11,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:11,865 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:12,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:12,184 INFO L197 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-09-14 15:51:12,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:12,198 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:12,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:12,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:12,600 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 15:51:12,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 13 [2018-09-14 15:51:12,601 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:12,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 15:51:12,602 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 15:51:12,602 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-09-14 15:51:12,603 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2018-09-14 15:51:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:12,809 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-09-14 15:51:12,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 15:51:12,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-09-14 15:51:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:12,812 INFO L225 Difference]: With dead ends: 50 [2018-09-14 15:51:12,812 INFO L226 Difference]: Without dead ends: 48 [2018-09-14 15:51:12,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-09-14 15:51:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-14 15:51:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-14 15:51:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-14 15:51:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-09-14 15:51:12,826 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 21 [2018-09-14 15:51:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:12,826 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-09-14 15:51:12,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 15:51:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2018-09-14 15:51:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-14 15:51:12,828 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:12,828 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:12,828 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1060690802, now seen corresponding path program 1 times [2018-09-14 15:51:12,829 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:12,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:12,830 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-14 15:51:13,010 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:13,010 INFO L197 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-09-14 15:51:13,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:13,029 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:13,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-14 15:51:13,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-14 15:51:13,400 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 15:51:13,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 11 [2018-09-14 15:51:13,400 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:13,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 15:51:13,401 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 15:51:13,401 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-14 15:51:13,401 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 6 states. [2018-09-14 15:51:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:13,552 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-09-14 15:51:13,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 15:51:13,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-09-14 15:51:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:13,561 INFO L225 Difference]: With dead ends: 57 [2018-09-14 15:51:13,561 INFO L226 Difference]: Without dead ends: 55 [2018-09-14 15:51:13,562 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-14 15:51:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-14 15:51:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-09-14 15:51:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-14 15:51:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-09-14 15:51:13,584 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 29 [2018-09-14 15:51:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:13,585 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-09-14 15:51:13,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 15:51:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-09-14 15:51:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-14 15:51:13,587 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:13,587 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:13,588 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash 578348401, now seen corresponding path program 1 times [2018-09-14 15:51:13,588 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:13,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:13,594 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-14 15:51:13,731 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:13,731 INFO L197 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-09-14 15:51:13,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:13,744 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:13,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-14 15:51:13,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-14 15:51:14,093 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 15:51:14,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-09-14 15:51:14,093 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:14,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-14 15:51:14,094 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-14 15:51:14,094 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-09-14 15:51:14,094 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 7 states. [2018-09-14 15:51:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:14,379 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-09-14 15:51:14,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 15:51:14,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-09-14 15:51:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:14,386 INFO L225 Difference]: With dead ends: 73 [2018-09-14 15:51:14,386 INFO L226 Difference]: Without dead ends: 66 [2018-09-14 15:51:14,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-09-14 15:51:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-14 15:51:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-09-14 15:51:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-14 15:51:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2018-09-14 15:51:14,411 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 32 [2018-09-14 15:51:14,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:14,411 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2018-09-14 15:51:14,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-14 15:51:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2018-09-14 15:51:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-14 15:51:14,414 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:14,414 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:14,414 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 434465614, now seen corresponding path program 1 times [2018-09-14 15:51:14,415 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:14,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:14,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:14,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:14,417 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-14 15:51:14,673 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:14,673 INFO L197 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-09-14 15:51:14,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:14,682 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:14,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-14 15:51:14,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-14 15:51:14,968 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 15:51:14,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [10] total 17 [2018-09-14 15:51:14,969 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:14,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-14 15:51:14,969 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-14 15:51:14,970 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-09-14 15:51:14,970 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 8 states. [2018-09-14 15:51:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:15,181 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2018-09-14 15:51:15,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 15:51:15,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-09-14 15:51:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:15,185 INFO L225 Difference]: With dead ends: 75 [2018-09-14 15:51:15,186 INFO L226 Difference]: Without dead ends: 73 [2018-09-14 15:51:15,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-09-14 15:51:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-14 15:51:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-09-14 15:51:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-14 15:51:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-09-14 15:51:15,207 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 34 [2018-09-14 15:51:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:15,207 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-09-14 15:51:15,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-14 15:51:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-09-14 15:51:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-14 15:51:15,210 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:15,210 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:15,210 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2058374368, now seen corresponding path program 1 times [2018-09-14 15:51:15,211 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:15,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:15,213 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-14 15:51:15,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:15,483 INFO L197 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-09-14 15:51:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:15,492 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:15,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-09-14 15:51:15,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-09-14 15:51:16,092 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:16,092 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:51:16,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:16,117 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:16,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-14 15:51:16,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-14 15:51:16,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:51:16,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 9, 9] total 27 [2018-09-14 15:51:16,883 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:51:16,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-14 15:51:16,884 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-14 15:51:16,885 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2018-09-14 15:51:16,885 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 18 states. [2018-09-14 15:51:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:17,882 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2018-09-14 15:51:17,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-14 15:51:17,883 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-09-14 15:51:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:17,887 INFO L225 Difference]: With dead ends: 108 [2018-09-14 15:51:17,887 INFO L226 Difference]: Without dead ends: 96 [2018-09-14 15:51:17,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 209 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2018-09-14 15:51:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-14 15:51:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-14 15:51:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-14 15:51:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-09-14 15:51:17,904 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 58 [2018-09-14 15:51:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:17,904 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-09-14 15:51:17,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-14 15:51:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-09-14 15:51:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-14 15:51:17,905 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:17,906 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:17,906 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash 574589245, now seen corresponding path program 1 times [2018-09-14 15:51:17,907 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:17,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:17,908 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-09-14 15:51:18,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:18,073 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:51:18,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:18,087 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:18,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-14 15:51:18,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-14 15:51:18,391 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:18,391 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:51:18,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:18,407 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:18,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-14 15:51:18,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-14 15:51:18,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:51:18,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 9, 9] total 16 [2018-09-14 15:51:18,635 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:51:18,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-14 15:51:18,636 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-14 15:51:18,636 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-09-14 15:51:18,637 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 16 states. [2018-09-14 15:51:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:19,034 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-09-14 15:51:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 15:51:19,034 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-09-14 15:51:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:19,036 INFO L225 Difference]: With dead ends: 106 [2018-09-14 15:51:19,036 INFO L226 Difference]: Without dead ends: 104 [2018-09-14 15:51:19,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 222 SyntacticMatches, 14 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-09-14 15:51:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-14 15:51:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-14 15:51:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-14 15:51:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-09-14 15:51:19,054 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 60 [2018-09-14 15:51:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:19,054 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-09-14 15:51:19,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-14 15:51:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2018-09-14 15:51:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-14 15:51:19,056 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:19,056 INFO L376 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:19,057 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1079113108, now seen corresponding path program 2 times [2018-09-14 15:51:19,057 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:19,058 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 44 proven. 50 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-09-14 15:51:19,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:19,799 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:51:19,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:51:19,820 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:51:19,871 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:51:19,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:51:19,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 68 proven. 38 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-09-14 15:51:21,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 68 proven. 38 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-09-14 15:51:22,597 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:22,597 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:51:22,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:51:22,613 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:51:22,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:51:22,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:51:22,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 48 proven. 34 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-09-14 15:51:22,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 48 proven. 34 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-09-14 15:51:23,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:51:23,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14, 14, 13] total 32 [2018-09-14 15:51:23,082 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:51:23,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-14 15:51:23,082 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-14 15:51:23,083 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-09-14 15:51:23,083 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 20 states. [2018-09-14 15:51:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:24,055 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-09-14 15:51:24,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-14 15:51:24,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-09-14 15:51:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:24,058 INFO L225 Difference]: With dead ends: 115 [2018-09-14 15:51:24,059 INFO L226 Difference]: Without dead ends: 113 [2018-09-14 15:51:24,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 317 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=477, Invalid=1779, Unknown=0, NotChecked=0, Total=2256 [2018-09-14 15:51:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-14 15:51:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-09-14 15:51:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-14 15:51:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-09-14 15:51:24,074 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 86 [2018-09-14 15:51:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:24,075 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-09-14 15:51:24,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-14 15:51:24,075 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-09-14 15:51:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-14 15:51:24,078 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:24,078 INFO L376 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:24,078 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:24,078 INFO L82 PathProgramCache]: Analyzing trace with hash -795584450, now seen corresponding path program 2 times [2018-09-14 15:51:24,079 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:24,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:24,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:51:24,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:24,080 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:24,868 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-09-14 15:51:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 64 proven. 81 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-09-14 15:51:25,024 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:25,024 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:51:25,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:51:25,036 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:51:25,067 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:51:25,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:51:25,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 118 proven. 29 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-09-14 15:51:25,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 107 proven. 40 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-09-14 15:51:25,685 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:25,685 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:51:25,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:51:25,701 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:51:25,765 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:51:25,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:51:25,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 68 proven. 25 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-09-14 15:51:25,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 68 proven. 25 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-09-14 15:51:26,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:51:26,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 11, 10] total 26 [2018-09-14 15:51:26,051 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:51:26,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-14 15:51:26,052 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-14 15:51:26,052 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-09-14 15:51:26,053 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 20 states. [2018-09-14 15:51:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:26,682 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-09-14 15:51:26,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-14 15:51:26,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 110 [2018-09-14 15:51:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:26,690 INFO L225 Difference]: With dead ends: 108 [2018-09-14 15:51:26,690 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 15:51:26,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 415 SyntacticMatches, 14 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=280, Invalid=1126, Unknown=0, NotChecked=0, Total=1406 [2018-09-14 15:51:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 15:51:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 15:51:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 15:51:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 15:51:26,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-09-14 15:51:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:26,692 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 15:51:26,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-14 15:51:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 15:51:26,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 15:51:26,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 15:51:26,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:51:26,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:51:27,065 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-09-14 15:51:27,173 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-09-14 15:51:27,373 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-09-14 15:51:27,678 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-09-14 15:51:27,999 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-09-14 15:51:28,187 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-09-14 15:51:28,190 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-14 15:51:28,190 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:51:28,190 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:51:28,190 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-14 15:51:28,190 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 15:51:28,190 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 15:51:28,191 INFO L422 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= 1 main_~in~0)) (.cse3 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse4 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse5) (= main_~buf~0 0)) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 2) .cse1 (<= 2 main_~buf~0))))) [2018-09-14 15:51:28,191 INFO L422 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse2 (<= 1 main_~in~0)) (.cse4 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse3 (<= (+ main_~buf~0 3) main_~bufferlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0)) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 2) .cse1 (<= 2 main_~buf~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse5) (= main_~buf~0 0))))) [2018-09-14 15:51:28,191 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-09-14 15:51:28,191 INFO L426 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-09-14 15:51:28,191 INFO L426 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-09-14 15:51:28,191 INFO L426 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-09-14 15:51:28,192 INFO L422 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse2 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (let ((.cse1 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) .cse2 .cse0 (<= .cse1 main_~bufferlen~0) .cse3)) (and (<= main_~buf~0 2) .cse2 .cse0 (<= 3 main_~inlen~0) .cse3))) [2018-09-14 15:51:28,192 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-14 15:51:28,192 INFO L422 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 .cse4 (<= 2 main_~buf~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse3 (<= 3 main_~buf~0) .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse2 (<= main_~in~0 1) .cse3 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-09-14 15:51:28,192 INFO L422 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= 1 main_~in~0)) (.cse3 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 (<= main_~in~0 2) .cse1 .cse4 (<= 2 main_~buf~0)) (and .cse0 .cse2 .cse3 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-09-14 15:51:28,193 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-14 15:51:28,193 INFO L429 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-09-14 15:51:28,193 INFO L422 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 .cse4 (<= 2 main_~buf~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse3 (<= 3 main_~buf~0) .cse1 .cse2 .cse4) (and .cse0 .cse3 (<= 0 main_~in~0) .cse2 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 .cse1 .cse2 (<= main_~in~0 1) .cse3 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-09-14 15:51:28,193 INFO L426 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-09-14 15:51:28,194 INFO L426 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-09-14 15:51:28,194 INFO L426 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-09-14 15:51:28,194 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-09-14 15:51:28,194 INFO L422 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-09-14 15:51:28,194 INFO L422 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-09-14 15:51:28,194 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-09-14 15:51:28,195 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-09-14 15:51:28,195 INFO L426 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-09-14 15:51:28,195 INFO L426 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-09-14 15:51:28,195 INFO L422 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse2 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (let ((.cse1 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) .cse2 .cse0 (<= .cse1 main_~bufferlen~0) .cse3)) (and (<= main_~buf~0 2) .cse2 .cse0 (<= 3 main_~inlen~0) .cse3))) [2018-09-14 15:51:28,195 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-14 15:51:28,196 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-14 15:51:28,196 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-14 15:51:28,196 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-14 15:51:28,196 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-14 15:51:28,196 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-14 15:51:28,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 03:51:28 BoogieIcfgContainer [2018-09-14 15:51:28,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 15:51:28,214 INFO L168 Benchmark]: Toolchain (without parser) took 18016.03 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 804.6 MB. Max. memory is 7.1 GB. [2018-09-14 15:51:28,215 INFO L168 Benchmark]: CDTParser took 0.21 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-09-14 15:51:28,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.96 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-09-14 15:51:28,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.01 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-09-14 15:51:28,217 INFO L168 Benchmark]: Boogie Preprocessor took 22.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 15:51:28,218 INFO L168 Benchmark]: RCFGBuilder took 641.32 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.2 GB in the end (delta: -753.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-09-14 15:51:28,219 INFO L168 Benchmark]: TraceAbstraction took 17068.32 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 337.1 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -350.2 MB). Peak memory consumption was 838.1 MB. Max. memory is 7.1 GB. [2018-09-14 15:51:28,224 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.21 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 254.96 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.01 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 22.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 641.32 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.2 GB in the end (delta: -753.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17068.32 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 337.1 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -350.2 MB). Peak memory consumption was 838.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((bufferlen + 1 <= inlen && 1 <= in) && buflim + 2 <= bufferlen) && in <= 2) && bufferlen <= buflim + 2) && buf + 2 <= bufferlen) && 2 <= buf) || ((((((bufferlen + 1 <= inlen && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && 3 <= buf) && 1 <= in) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && bufferlen <= buflim + 2) && 0 <= in) && buflim + 2 <= bufferlen) && in <= 0) && buf == 0) && 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && 1 <= in) && buflim + 2 <= bufferlen) && in <= 1) && bufferlen <= buflim + 2) && 1 <= buf) && buf < buflim + 1) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 16.9s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 384 SDtfs, 436 SDslu, 1568 SDs, 0 SdLazy, 1546 SolverSat, 453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1630 GetRequests, 1377 SyntacticMatches, 61 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 58 PreInvPairs, 100 NumberOfFragments, 768 HoareAnnotationTreeSize, 58 FomulaSimplifications, 839 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 902 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 1204 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1914 ConstructedInterpolants, 0 QuantifiedInterpolants, 638836 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1453 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 4433/4988 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sendmail-close-angle_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_15-51-28-239.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sendmail-close-angle_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_15-51-28-239.csv Received shutdown request...