java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:02:48,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:02:48,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:02:48,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:02:48,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:02:48,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:02:48,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:02:48,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:02:48,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:02:48,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:02:48,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:02:48,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:02:48,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:02:48,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:02:48,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:02:48,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:02:48,474 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:02:48,476 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:02:48,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:02:48,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:02:48,481 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:02:48,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:02:48,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:02:48,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:02:48,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:02:48,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:02:48,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:02:48,486 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:02:48,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:02:48,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:02:48,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:02:48,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:02:48,498 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:02:48,498 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:02:48,499 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:02:48,499 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:02:48,499 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:02:48,500 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:02:48,500 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:02:48,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:02:48,501 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:02:48,501 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:02:48,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:02:48,501 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:02:48,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:02:48,501 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:02:48,502 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:02:48,502 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:02:48,502 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:02:48,502 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:02:48,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:02:48,503 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:02:48,503 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:02:48,503 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:02:48,503 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:02:48,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:02:48,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:02:48,504 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:02:48,504 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:02:48,504 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:02:48,504 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:02:48,504 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:02:48,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:02:48,505 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:02:48,506 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:02:48,506 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:02:48,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:02:48,554 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:02:48,558 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:02:48,560 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:02:48,560 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:02:48,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-01-24 13:02:48,729 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:02:48,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:02:48,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:02:48,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:02:48,743 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:02:48,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48, skipping insertion in model container [2018-01-24 13:02:48,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,766 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:02:48,810 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:02:48,929 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:02:48,953 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:02:48,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48 WrapperNode [2018-01-24 13:02:48,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:02:48,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:02:48,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:02:48,961 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:02:48,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (1/1) ... [2018-01-24 13:02:48,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:02:48,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:02:48,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:02:48,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:02:48,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (1/1) ... No working directory specified, using /storage/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-01-24 13:02:49,046 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:02:49,046 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:02:49,046 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 13:02:49,046 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 13:02:49,046 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:02:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:02:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:02:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:02:49,046 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:02:49,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:02:49,048 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:02:49,388 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:02:49,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:02:49 BoogieIcfgContainer [2018-01-24 13:02:49,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:02:49,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:02:49,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:02:49,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:02:49,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:02:48" (1/3) ... [2018-01-24 13:02:49,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:02:49, skipping insertion in model container [2018-01-24 13:02:49,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:48" (2/3) ... [2018-01-24 13:02:49,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:02:49, skipping insertion in model container [2018-01-24 13:02:49,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:02:49" (3/3) ... [2018-01-24 13:02:49,395 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-01-24 13:02:49,404 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:02:49,414 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 13:02:49,464 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:02:49,464 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:02:49,465 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:02:49,465 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:02:49,465 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:02:49,465 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:02:49,465 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:02:49,465 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:02:49,466 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:02:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 13:02:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 13:02:49,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:49,499 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:49,499 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:49,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 13:02:49,508 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:49,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:49,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:49,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:49,565 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:49,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:49,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:49,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:02:49,687 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:49,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 13:02:49,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 13:02:49,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:02:49,710 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 13:02:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:49,830 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 13:02:49,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 13:02:49,831 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 13:02:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:49,847 INFO L225 Difference]: With dead ends: 92 [2018-01-24 13:02:49,847 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 13:02:49,851 INFO L525 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-01-24 13:02:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 13:02:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 13:02:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 13:02:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 13:02:49,887 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 13:02:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:49,887 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 13:02:49,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 13:02:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 13:02:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:02:49,888 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:49,888 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:49,888 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 13:02:49,889 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:49,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:49,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:49,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:49,891 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:49,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:49,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:49,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:49,971 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:49,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:02:49,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:02:49,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:49,973 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 13:02:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:49,996 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 13:02:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:02:49,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 13:02:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:49,998 INFO L225 Difference]: With dead ends: 87 [2018-01-24 13:02:49,999 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 13:02:50,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 13:02:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 13:02:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 13:02:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 13:02:50,010 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 13:02:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:50,010 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 13:02:50,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:02:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 13:02:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:02:50,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:50,011 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:50,011 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 13:02:50,012 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:50,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:50,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,013 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:50,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:50,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:50,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:50,120 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:50,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:02:50,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:02:50,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:50,121 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 13:02:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:50,176 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 13:02:50,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:02:50,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 13:02:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:50,178 INFO L225 Difference]: With dead ends: 145 [2018-01-24 13:02:50,178 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 13:02:50,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 13:02:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 13:02:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 13:02:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 13:02:50,193 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 13:02:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:50,193 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 13:02:50,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:02:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 13:02:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:02:50,194 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:50,194 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:50,194 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 13:02:50,195 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:50,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:50,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,196 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:50,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:50,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:50,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:02:50,237 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:50,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:02:50,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:02:50,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:50,238 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 13:02:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:50,309 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 13:02:50,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:02:50,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 13:02:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:50,313 INFO L225 Difference]: With dead ends: 148 [2018-01-24 13:02:50,313 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 13:02:50,313 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 13:02:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 13:02:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 13:02:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 13:02:50,332 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 13:02:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:50,332 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 13:02:50,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:02:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 13:02:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:02:50,333 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:50,334 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:50,334 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 13:02:50,334 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:50,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:50,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,336 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:50,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:50,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:50,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:02:50,420 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:50,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:02:50,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:02:50,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:50,421 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 13:02:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:50,538 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 13:02:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:02:50,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 13:02:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:50,542 INFO L225 Difference]: With dead ends: 385 [2018-01-24 13:02:50,542 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 13:02:50,545 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-01-24 13:02:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 13:02:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 13:02:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 13:02:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 13:02:50,573 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 13:02:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:50,573 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 13:02:50,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:02:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 13:02:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:02:50,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:50,574 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:50,574 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 13:02:50,575 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:50,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:50,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,576 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:50,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:50,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:50,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:50,629 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:50,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:02:50,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:02:50,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:02:50,629 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 13:02:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:50,784 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-24 13:02:50,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:02:50,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:02:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:50,789 INFO L225 Difference]: With dead ends: 390 [2018-01-24 13:02:50,789 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 13:02:50,790 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 13:02:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-24 13:02:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 13:02:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 13:02:50,826 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 13:02:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:50,826 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 13:02:50,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:02:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 13:02:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:02:50,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:50,828 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:50,828 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 13:02:50,828 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:50,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:50,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:50,830 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:50,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:50,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:50,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:50,901 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:50,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:02:50,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:02:50,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:02:50,902 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 13:02:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:51,078 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-24 13:02:51,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:02:51,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:02:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:51,085 INFO L225 Difference]: With dead ends: 489 [2018-01-24 13:02:51,085 INFO L226 Difference]: Without dead ends: 485 [2018-01-24 13:02:51,086 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-24 13:02:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-24 13:02:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 13:02:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 13:02:51,128 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 13:02:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:51,128 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 13:02:51,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:02:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 13:02:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:02:51,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:51,130 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:51,130 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 13:02:51,131 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:51,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:51,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:51,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:51,132 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:51,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:51,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:51,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:02:51,205 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:51,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:02:51,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:02:51,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:51,206 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 13:02:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:51,303 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 13:02:51,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:02:51,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 13:02:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:51,311 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 13:02:51,311 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 13:02:51,315 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-01-24 13:02:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 13:02:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 13:02:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 13:02:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 13:02:51,374 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 13:02:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:51,375 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 13:02:51,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:02:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 13:02:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:02:51,377 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:51,377 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:51,377 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:51,377 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 13:02:51,377 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:51,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:51,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:51,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:51,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:51,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:51,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:51,469 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:02:51,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:51,480 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:51,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:51,618 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:51,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:51,858 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:02:51,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:51,865 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:51,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:51,992 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:52,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:02:52,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8, 6, 6] total 12 [2018-01-24 13:02:52,170 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:02:52,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:02:52,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:02:52,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:02:52,171 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-01-24 13:02:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:52,747 INFO L93 Difference]: Finished difference Result 2243 states and 3305 transitions. [2018-01-24 13:02:52,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 13:02:52,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 13:02:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:52,756 INFO L225 Difference]: With dead ends: 2243 [2018-01-24 13:02:52,756 INFO L226 Difference]: Without dead ends: 1420 [2018-01-24 13:02:52,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:02:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-01-24 13:02:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-01-24 13:02:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-01-24 13:02:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-01-24 13:02:52,851 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-01-24 13:02:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:52,852 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-01-24 13:02:52,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:02:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-01-24 13:02:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:02:52,853 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:52,854 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 13:02:52,854 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-01-24 13:02:52,854 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:52,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:52,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:52,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:52,855 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:52,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:53,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:53,066 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:02:53,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:53,075 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:53,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:53,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:53,294 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:02:53,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2018-01-24 13:02:53,295 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:53,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:02:53,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:02:53,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:02:53,296 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 5 states. [2018-01-24 13:02:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:53,475 INFO L93 Difference]: Finished difference Result 3159 states and 4560 transitions. [2018-01-24 13:02:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:02:53,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-24 13:02:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:53,486 INFO L225 Difference]: With dead ends: 3159 [2018-01-24 13:02:53,487 INFO L226 Difference]: Without dead ends: 1896 [2018-01-24 13:02:53,491 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:02:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2018-01-24 13:02:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1874. [2018-01-24 13:02:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2018-01-24 13:02:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2743 transitions. [2018-01-24 13:02:53,627 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2743 transitions. Word has length 27 [2018-01-24 13:02:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:53,627 INFO L432 AbstractCegarLoop]: Abstraction has 1874 states and 2743 transitions. [2018-01-24 13:02:53,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:02:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2743 transitions. [2018-01-24 13:02:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 13:02:53,629 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:53,629 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:53,629 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-01-24 13:02:53,629 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:53,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:53,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:53,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:53,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:53,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:53,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:53,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:02:53,821 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:53,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:02:53,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:02:53,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:02:53,822 INFO L87 Difference]: Start difference. First operand 1874 states and 2743 transitions. Second operand 7 states. [2018-01-24 13:02:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:54,104 INFO L93 Difference]: Finished difference Result 2629 states and 3704 transitions. [2018-01-24 13:02:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:02:54,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 13:02:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:54,108 INFO L225 Difference]: With dead ends: 2629 [2018-01-24 13:02:54,108 INFO L226 Difference]: Without dead ends: 664 [2018-01-24 13:02:54,113 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:02:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-01-24 13:02:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 565. [2018-01-24 13:02:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-01-24 13:02:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 745 transitions. [2018-01-24 13:02:54,151 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 745 transitions. Word has length 31 [2018-01-24 13:02:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:54,152 INFO L432 AbstractCegarLoop]: Abstraction has 565 states and 745 transitions. [2018-01-24 13:02:54,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:02:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 745 transitions. [2018-01-24 13:02:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:02:54,153 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:54,153 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:54,153 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:54,154 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-01-24 13:02:54,154 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:54,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:54,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:54,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:54,155 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:54,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:54,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:54,314 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:02:54,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:54,321 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:54,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 13:02:54,446 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-24 13:02:54,551 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:02:54,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 10 [2018-01-24 13:02:54,552 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:54,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:02:54,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:02:54,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:02:54,553 INFO L87 Difference]: Start difference. First operand 565 states and 745 transitions. Second operand 4 states. [2018-01-24 13:02:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:54,644 INFO L93 Difference]: Finished difference Result 1276 states and 1688 transitions. [2018-01-24 13:02:54,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:02:54,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-24 13:02:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:54,648 INFO L225 Difference]: With dead ends: 1276 [2018-01-24 13:02:54,648 INFO L226 Difference]: Without dead ends: 716 [2018-01-24 13:02:54,650 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:02:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-01-24 13:02:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 683. [2018-01-24 13:02:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-01-24 13:02:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 909 transitions. [2018-01-24 13:02:54,697 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 909 transitions. Word has length 38 [2018-01-24 13:02:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:54,698 INFO L432 AbstractCegarLoop]: Abstraction has 683 states and 909 transitions. [2018-01-24 13:02:54,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:02:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 909 transitions. [2018-01-24 13:02:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:02:54,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:54,699 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:54,699 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1140831984, now seen corresponding path program 1 times [2018-01-24 13:02:54,700 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:54,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:54,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:54,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:54,701 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:54,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:54,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:54,880 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:02:54,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:54,890 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:54,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:55,133 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:55,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:55,434 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --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 cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:02:55,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:55,444 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:55,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:55,675 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:56,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:02:56,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 8, 8] total 18 [2018-01-24 13:02:56,050 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:02:56,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:02:56,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:02:56,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:02:56,051 INFO L87 Difference]: Start difference. First operand 683 states and 909 transitions. Second operand 13 states. [2018-01-24 13:02:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:57,465 INFO L93 Difference]: Finished difference Result 3215 states and 4497 transitions. [2018-01-24 13:02:57,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 13:02:57,465 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-01-24 13:02:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:57,475 INFO L225 Difference]: With dead ends: 3215 [2018-01-24 13:02:57,476 INFO L226 Difference]: Without dead ends: 2537 [2018-01-24 13:02:57,478 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 138 SyntacticMatches, 15 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-01-24 13:02:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2018-01-24 13:02:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2209. [2018-01-24 13:02:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2018-01-24 13:02:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2966 transitions. [2018-01-24 13:02:57,583 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2966 transitions. Word has length 38 [2018-01-24 13:02:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:57,583 INFO L432 AbstractCegarLoop]: Abstraction has 2209 states and 2966 transitions. [2018-01-24 13:02:57,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:02:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2966 transitions. [2018-01-24 13:02:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:02:57,584 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:57,584 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:57,584 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:57,584 INFO L82 PathProgramCache]: Analyzing trace with hash -510703423, now seen corresponding path program 1 times [2018-01-24 13:02:57,585 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:57,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:57,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:57,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:57,586 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:57,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:02:57,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:57,796 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:02:57,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:57,802 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:57,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 13:02:57,951 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:58,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:58,088 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --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 cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:02:58,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:58,093 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:58,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:58,387 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:58,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:02:58,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10, 8, 8] total 28 [2018-01-24 13:02:58,597 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:02:58,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:02:58,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:02:58,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-01-24 13:02:58,599 INFO L87 Difference]: Start difference. First operand 2209 states and 2966 transitions. Second operand 15 states. [2018-01-24 13:02:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:59,578 INFO L93 Difference]: Finished difference Result 5178 states and 6971 transitions. [2018-01-24 13:02:59,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 13:02:59,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-24 13:02:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:59,589 INFO L225 Difference]: With dead ends: 5178 [2018-01-24 13:02:59,589 INFO L226 Difference]: Without dead ends: 2920 [2018-01-24 13:02:59,593 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=2097, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 13:02:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2018-01-24 13:02:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2742. [2018-01-24 13:02:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2742 states. [2018-01-24 13:02:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 3605 transitions. [2018-01-24 13:02:59,704 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 3605 transitions. Word has length 41 [2018-01-24 13:02:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:59,704 INFO L432 AbstractCegarLoop]: Abstraction has 2742 states and 3605 transitions. [2018-01-24 13:02:59,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:02:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 3605 transitions. [2018-01-24 13:02:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 13:02:59,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:59,705 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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-01-24 13:02:59,705 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-01-24 13:02:59,705 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:59,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:59,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:59,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:59,706 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:59,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 13:02:59,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:59,850 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:02:59,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:59,862 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:59,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:00,149 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:00,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:00,449 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --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 cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:00,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:00,452 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:00,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:00,540 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:00,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:00,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8, 8] total 16 [2018-01-24 13:03:00,620 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:00,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:03:00,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:03:00,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:03:00,621 INFO L87 Difference]: Start difference. First operand 2742 states and 3605 transitions. Second operand 12 states. [2018-01-24 13:03:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:01,024 INFO L93 Difference]: Finished difference Result 6537 states and 8742 transitions. [2018-01-24 13:03:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 13:03:01,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-01-24 13:03:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:01,039 INFO L225 Difference]: With dead ends: 6537 [2018-01-24 13:03:01,039 INFO L226 Difference]: Without dead ends: 3827 [2018-01-24 13:03:01,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 162 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:03:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2018-01-24 13:03:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3604. [2018-01-24 13:03:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2018-01-24 13:03:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4826 transitions. [2018-01-24 13:03:01,199 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4826 transitions. Word has length 42 [2018-01-24 13:03:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:01,199 INFO L432 AbstractCegarLoop]: Abstraction has 3604 states and 4826 transitions. [2018-01-24 13:03:01,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:03:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4826 transitions. [2018-01-24 13:03:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 13:03:01,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:01,201 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 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-01-24 13:03:01,201 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:03:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-01-24 13:03:01,201 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:01,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:01,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:01,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:01,202 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:01,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:03:01,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:01,371 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:03:01,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:01,379 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:01,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:03:01,544 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:03:01,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:01,747 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --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 cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:01,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:01,751 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:01,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:03:01,862 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:03:01,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:01,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 16 [2018-01-24 13:03:01,940 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:01,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:03:01,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:03:01,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:03:01,940 INFO L87 Difference]: Start difference. First operand 3604 states and 4826 transitions. Second operand 11 states. [2018-01-24 13:03:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:02,441 INFO L93 Difference]: Finished difference Result 8241 states and 11310 transitions. [2018-01-24 13:03:02,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:03:02,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-01-24 13:03:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:02,466 INFO L225 Difference]: With dead ends: 8241 [2018-01-24 13:03:02,466 INFO L226 Difference]: Without dead ends: 4669 [2018-01-24 13:03:02,477 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 209 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-01-24 13:03:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2018-01-24 13:03:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 3604. [2018-01-24 13:03:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2018-01-24 13:03:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4826 transitions. [2018-01-24 13:03:02,734 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4826 transitions. Word has length 54 [2018-01-24 13:03:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:02,734 INFO L432 AbstractCegarLoop]: Abstraction has 3604 states and 4826 transitions. [2018-01-24 13:03:02,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:03:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4826 transitions. [2018-01-24 13:03:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 13:03:02,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:02,736 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:02,736 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:03:02,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-01-24 13:03:02,736 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:02,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:02,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:02,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:02,737 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:02,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:03:02,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:02,866 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:02,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:02,874 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:02,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:03:03,144 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 13:03:03,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:03,312 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --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 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:03,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:03,315 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:03,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:03:03,414 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 13:03:03,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:03,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8, 8] total 17 [2018-01-24 13:03:03,522 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:03,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:03:03,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:03:03,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:03:03,523 INFO L87 Difference]: Start difference. First operand 3604 states and 4826 transitions. Second operand 15 states. [2018-01-24 13:03:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:04,201 INFO L93 Difference]: Finished difference Result 9615 states and 13447 transitions. [2018-01-24 13:03:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 13:03:04,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-01-24 13:03:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:04,229 INFO L225 Difference]: With dead ends: 9615 [2018-01-24 13:03:04,229 INFO L226 Difference]: Without dead ends: 5927 [2018-01-24 13:03:04,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 13:03:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2018-01-24 13:03:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 4934. [2018-01-24 13:03:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4934 states. [2018-01-24 13:03:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 6730 transitions. [2018-01-24 13:03:04,598 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 6730 transitions. Word has length 54 [2018-01-24 13:03:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:04,599 INFO L432 AbstractCegarLoop]: Abstraction has 4934 states and 6730 transitions. [2018-01-24 13:03:04,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:03:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 6730 transitions. [2018-01-24 13:03:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 13:03:04,601 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:04,601 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 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-01-24 13:03:04,601 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:03:04,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-01-24 13:03:04,601 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:04,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:04,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:04,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:04,602 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:04,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-24 13:03:04,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:04,753 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:04,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:04,762 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:04,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-24 13:03:04,875 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-24 13:03:05,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:05,066 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --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 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:05,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:05,075 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:05,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-24 13:03:05,226 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-24 13:03:05,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:05,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 14 [2018-01-24 13:03:05,315 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:05,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:03:05,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:03:05,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:03:05,316 INFO L87 Difference]: Start difference. First operand 4934 states and 6730 transitions. Second operand 11 states. [2018-01-24 13:03:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:05,795 INFO L93 Difference]: Finished difference Result 10823 states and 15001 transitions. [2018-01-24 13:03:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:03:05,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-01-24 13:03:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:05,815 INFO L225 Difference]: With dead ends: 10823 [2018-01-24 13:03:05,815 INFO L226 Difference]: Without dead ends: 5921 [2018-01-24 13:03:05,823 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 264 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:03:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5921 states. [2018-01-24 13:03:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5921 to 5874. [2018-01-24 13:03:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5874 states. [2018-01-24 13:03:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5874 states to 5874 states and 8166 transitions. [2018-01-24 13:03:06,078 INFO L78 Accepts]: Start accepts. Automaton has 5874 states and 8166 transitions. Word has length 68 [2018-01-24 13:03:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:06,078 INFO L432 AbstractCegarLoop]: Abstraction has 5874 states and 8166 transitions. [2018-01-24 13:03:06,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:03:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5874 states and 8166 transitions. [2018-01-24 13:03:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 13:03:06,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:06,080 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:06,080 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:03:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-01-24 13:03:06,081 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:06,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:06,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:06,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:06,081 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:06,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:06,319 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-01-24 13:03:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 13:03:06,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:06,501 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:06,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:06,513 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:06,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:03:06,655 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 55 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:03:06,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:06,932 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --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 19 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:06,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:06,935 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:07,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:03:07,057 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 55 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:03:07,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:07,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12, 11, 12] total 25 [2018-01-24 13:03:07,163 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:07,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 13:03:07,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 13:03:07,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:03:07,164 INFO L87 Difference]: Start difference. First operand 5874 states and 8166 transitions. Second operand 18 states. [2018-01-24 13:03:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:08,276 INFO L93 Difference]: Finished difference Result 15939 states and 22926 transitions. [2018-01-24 13:03:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 13:03:08,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-01-24 13:03:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:08,307 INFO L225 Difference]: With dead ends: 15939 [2018-01-24 13:03:08,308 INFO L226 Difference]: Without dead ends: 9980 [2018-01-24 13:03:08,326 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 271 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=1451, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 13:03:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9980 states. [2018-01-24 13:03:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9980 to 7441. [2018-01-24 13:03:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2018-01-24 13:03:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 10268 transitions. [2018-01-24 13:03:08,758 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 10268 transitions. Word has length 70 [2018-01-24 13:03:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:08,758 INFO L432 AbstractCegarLoop]: Abstraction has 7441 states and 10268 transitions. [2018-01-24 13:03:08,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 13:03:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 10268 transitions. [2018-01-24 13:03:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 13:03:08,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:08,759 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:08,760 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:03:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-01-24 13:03:08,760 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:08,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:08,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:08,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:08,761 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:08,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-24 13:03:08,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:08,970 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:08,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:08,976 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:09,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-24 13:03:09,130 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-24 13:03:09,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:09,255 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --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 21 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:09,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:09,258 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:09,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-24 13:03:09,374 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-24 13:03:09,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:09,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 9] total 20 [2018-01-24 13:03:09,474 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:09,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:03:09,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:03:09,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-01-24 13:03:09,475 INFO L87 Difference]: Start difference. First operand 7441 states and 10268 transitions. Second operand 17 states. [2018-01-24 13:03:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:10,624 INFO L93 Difference]: Finished difference Result 17314 states and 24435 transitions. [2018-01-24 13:03:10,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 13:03:10,627 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-01-24 13:03:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:10,658 INFO L225 Difference]: With dead ends: 17314 [2018-01-24 13:03:10,658 INFO L226 Difference]: Without dead ends: 9737 [2018-01-24 13:03:10,675 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=990, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 13:03:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9737 states. [2018-01-24 13:03:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9737 to 7255. [2018-01-24 13:03:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7255 states. [2018-01-24 13:03:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7255 states to 7255 states and 9885 transitions. [2018-01-24 13:03:11,230 INFO L78 Accepts]: Start accepts. Automaton has 7255 states and 9885 transitions. Word has length 84 [2018-01-24 13:03:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:11,230 INFO L432 AbstractCegarLoop]: Abstraction has 7255 states and 9885 transitions. [2018-01-24 13:03:11,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:03:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7255 states and 9885 transitions. [2018-01-24 13:03:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 13:03:11,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:11,233 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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-01-24 13:03:11,233 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:03:11,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-01-24 13:03:11,233 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:11,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:11,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:11,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:11,234 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:11,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-24 13:03:11,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:11,387 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:11,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:11,394 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:11,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:03:11,560 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 64 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 13:03:11,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:11,711 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --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 23 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:11,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:11,714 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:11,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 44 proven. 60 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-24 13:03:11,912 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-24 13:03:12,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:12,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11, 9, 9] total 25 [2018-01-24 13:03:12,009 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:12,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:03:12,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:03:12,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:03:12,010 INFO L87 Difference]: Start difference. First operand 7255 states and 9885 transitions. Second operand 17 states. [2018-01-24 13:03:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:14,226 INFO L93 Difference]: Finished difference Result 22684 states and 31009 transitions. [2018-01-24 13:03:14,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-24 13:03:14,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-01-24 13:03:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:14,273 INFO L225 Difference]: With dead ends: 22684 [2018-01-24 13:03:14,273 INFO L226 Difference]: Without dead ends: 15329 [2018-01-24 13:03:14,293 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 340 SyntacticMatches, 16 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2336 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1506, Invalid=6684, Unknown=0, NotChecked=0, Total=8190 [2018-01-24 13:03:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15329 states. [2018-01-24 13:03:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15329 to 13587. [2018-01-24 13:03:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13587 states. [2018-01-24 13:03:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13587 states to 13587 states and 18443 transitions. [2018-01-24 13:03:15,095 INFO L78 Accepts]: Start accepts. Automaton has 13587 states and 18443 transitions. Word has length 87 [2018-01-24 13:03:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:15,095 INFO L432 AbstractCegarLoop]: Abstraction has 13587 states and 18443 transitions. [2018-01-24 13:03:15,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:03:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13587 states and 18443 transitions. [2018-01-24 13:03:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-24 13:03:15,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:15,097 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:15,097 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:03:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-01-24 13:03:15,098 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:15,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:15,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:15,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:15,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:15,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-24 13:03:15,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:15,277 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:15,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:15,282 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:15,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 81 proven. 41 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 13:03:15,429 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 90 proven. 49 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-24 13:03:15,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:15,648 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 25 with cvc4 --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 25 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:15,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:15,651 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:15,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 81 proven. 41 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 13:03:15,791 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 90 proven. 49 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-24 13:03:15,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:15,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14, 11, 14] total 26 [2018-01-24 13:03:15,934 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:15,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 13:03:15,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 13:03:15,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-01-24 13:03:15,935 INFO L87 Difference]: Start difference. First operand 13587 states and 18443 transitions. Second operand 20 states. [2018-01-24 13:03:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:23,872 INFO L93 Difference]: Finished difference Result 49221 states and 68318 transitions. [2018-01-24 13:03:23,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-01-24 13:03:23,872 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-01-24 13:03:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:23,956 INFO L225 Difference]: With dead ends: 49221 [2018-01-24 13:03:23,956 INFO L226 Difference]: Without dead ends: 35319 [2018-01-24 13:03:23,982 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 434 SyntacticMatches, 8 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16839 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5663, Invalid=37393, Unknown=0, NotChecked=0, Total=43056 [2018-01-24 13:03:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35319 states. [2018-01-24 13:03:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35319 to 29651. [2018-01-24 13:03:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29651 states. [2018-01-24 13:03:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29651 states to 29651 states and 40595 transitions. [2018-01-24 13:03:25,657 INFO L78 Accepts]: Start accepts. Automaton has 29651 states and 40595 transitions. Word has length 99 [2018-01-24 13:03:25,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:25,657 INFO L432 AbstractCegarLoop]: Abstraction has 29651 states and 40595 transitions. [2018-01-24 13:03:25,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 13:03:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 29651 states and 40595 transitions. [2018-01-24 13:03:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-24 13:03:25,663 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:25,663 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 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] [2018-01-24 13:03:25,663 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:03:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-01-24 13:03:25,664 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:25,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:25,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:25,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:25,665 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:25,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 13:03:26,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:26,055 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:26,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:26,063 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:26,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 13:03:26,665 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:26,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-24 13:03:26,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:26,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:03:26,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-01-24 13:03:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 50 proven. 92 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 13:03:27,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:27,018 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 27 with cvc4 --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 27 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:27,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:27,021 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:27,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:27,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:03:27,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:27,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:03:27,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:03:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 13:03:27,340 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 50 proven. 92 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 13:03:27,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:27,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 10, 10] total 32 [2018-01-24 13:03:27,514 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:27,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 13:03:27,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 13:03:27,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 13:03:27,515 INFO L87 Difference]: Start difference. First operand 29651 states and 40595 transitions. Second operand 20 states. [2018-01-24 13:03:29,299 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 38 DAG size of output 30 Received shutdown request... [2018-01-24 13:03:30,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 13:03:30,022 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:03:30,028 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:03:30,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:03:30 BoogieIcfgContainer [2018-01-24 13:03:30,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:03:30,030 INFO L168 Benchmark]: Toolchain (without parser) took 41300.11 ms. Allocated memory was 308.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 268.3 MB in the beginning and 896.1 MB in the end (delta: -627.8 MB). Peak memory consumption was 480.5 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:30,031 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:03:30,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.33 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 256.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:30,032 INFO L168 Benchmark]: Boogie Preprocessor took 35.67 ms. Allocated memory is still 308.3 MB. Free memory was 256.3 MB in the beginning and 254.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:30,032 INFO L168 Benchmark]: RCFGBuilder took 391.98 ms. Allocated memory is still 308.3 MB. Free memory was 254.3 MB in the beginning and 228.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:30,033 INFO L168 Benchmark]: TraceAbstraction took 40639.86 ms. Allocated memory was 308.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 227.8 MB in the beginning and 896.1 MB in the end (delta: -668.4 MB). Peak memory consumption was 440.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:30,034 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.33 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 256.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.67 ms. Allocated memory is still 308.3 MB. Free memory was 256.3 MB in the beginning and 254.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 391.98 ms. Allocated memory is still 308.3 MB. Free memory was 254.3 MB in the beginning and 228.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 40639.86 ms. Allocated memory was 308.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 227.8 MB in the beginning and 896.1 MB in the end (delta: -668.4 MB). Peak memory consumption was 440.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (29651states) and interpolant automaton (currently 33 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (9943 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 40.5s OverallTime, 23 OverallIterations, 8 TraceHistogramMax, 21.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2495 SDtfs, 8083 SDslu, 5757 SDs, 0 SdLazy, 14058 SolverSat, 2404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3930 GetRequests, 3156 SyntacticMatches, 101 SemanticMatches, 673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22055 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29651occurred in iteration=22, 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, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 15712 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2574 NumberOfCodeBlocks, 2574 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 4100 ConstructedInterpolants, 20 QuantifiedInterpolants, 1278316 SizeOfPredicates, 159 NumberOfNonLiveVariables, 12297 ConjunctsInSsa, 484 ConjunctsInUnsatCore, 75 InterpolantComputations, 13 PerfectInterpolantSequences, 3677/5022 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-03-30-043.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-03-30-043.csv Completed graceful shutdown