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.0_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:03:48,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:03:48,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:03:48,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:03:48,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:03:48,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:03:48,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:03:48,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:03:48,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:03:48,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:03:48,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:03:48,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:03:48,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:03:48,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:03:48,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:03:48,238 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:03:48,241 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:03:48,243 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:03:48,244 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:03:48,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:03:48,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:03:48,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:03:48,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:03:48,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:03:48,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:03:48,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:03:48,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:03:48,253 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:03:48,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:03:48,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:03:48,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:03:48,254 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:03:48,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:03:48,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:03:48,264 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:03:48,264 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:03:48,264 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:03:48,264 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:03:48,264 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:03:48,265 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:03:48,265 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:03:48,265 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:03:48,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:03:48,265 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:03:48,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:03:48,266 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:03:48,266 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:03:48,266 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:03:48,266 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:03:48,266 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:03:48,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:03:48,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:03:48,267 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:03:48,267 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:03:48,267 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:03:48,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:03:48,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:03:48,268 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:03:48,268 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:03:48,268 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:03:48,268 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:03:48,268 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:03:48,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:03:48,268 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:03:48,269 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:03:48,269 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:03:48,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:03:48,316 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:03:48,319 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:03:48,321 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:03:48,321 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:03:48,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i [2018-01-24 13:03:48,476 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:03:48,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:03:48,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:03:48,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:03:48,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:03:48,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a76578b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48, skipping insertion in model container [2018-01-24 13:03:48,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,505 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:03:48,545 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:03:48,669 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:03:48,687 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:03:48,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48 WrapperNode [2018-01-24 13:03:48,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:03:48,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:03:48,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:03:48,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:03:48,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48" (1/1) ... [2018-01-24 13:03:48,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:03:48,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:03:48,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:03:48,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:03:48,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03: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:03:48,813 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:03:48,813 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:03:48,813 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 13:03:48,814 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 13:03:48,814 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:03:48,814 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:03:48,814 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:03:48,814 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:03:48,814 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:03:48,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:03:48,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:03:48,815 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:03:48,815 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:03:48,815 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:03:48,815 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:03:48,815 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 13:03:48,816 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 13:03:48,816 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:03:48,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:03:48,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:03:49,198 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:03:49,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:03:49 BoogieIcfgContainer [2018-01-24 13:03:49,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:03:49,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:03:49,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:03:49,203 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:03:49,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:03:48" (1/3) ... [2018-01-24 13:03:49,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa68fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:03:49, skipping insertion in model container [2018-01-24 13:03:49,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:03:48" (2/3) ... [2018-01-24 13:03:49,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa68fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:03:49, skipping insertion in model container [2018-01-24 13:03:49,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:03:49" (3/3) ... [2018-01-24 13:03:49,207 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-01-24 13:03:49,214 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:03:49,220 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 13:03:49,264 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:03:49,264 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:03:49,264 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:03:49,264 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:03:49,264 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:03:49,264 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:03:49,265 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:03:49,265 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:03:49,265 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:03:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 13:03:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 13:03:49,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:49,287 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:49,287 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:03:49,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 13:03:49,294 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:49,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:49,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:49,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:49,336 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:49,406 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:49,456 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:03:49,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:49,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:03:49,460 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:49,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 13:03:49,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 13:03:49,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:03:49,486 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 13:03:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:49,605 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 13:03:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 13:03:49,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 13:03:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:49,619 INFO L225 Difference]: With dead ends: 92 [2018-01-24 13:03:49,619 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 13:03:49,622 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:03:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 13:03:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 13:03:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 13:03:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 13:03:49,660 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 13:03:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:49,660 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 13:03:49,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 13:03:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 13:03:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:03:49,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:49,661 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:49,661 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:03:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 13:03:49,661 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:49,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:49,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:49,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:49,663 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:49,689 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:49,725 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:03:49,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:49,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:03:49,725 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:49,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:03:49,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:03:49,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:03:49,728 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 13:03:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:49,759 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 13:03:49,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:03:49,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 13:03:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:49,760 INFO L225 Difference]: With dead ends: 87 [2018-01-24 13:03:49,760 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 13:03:49,761 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:03:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 13:03:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 13:03:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 13:03:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 13:03:49,768 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 13:03:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:49,768 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 13:03:49,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:03:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 13:03:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:03:49,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:49,769 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:49,769 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:03:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 13:03:49,770 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:49,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:49,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:49,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:49,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:49,797 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:49,867 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:03:49,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:49,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:03:49,868 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:49,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:03:49,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:03:49,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:03:49,868 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 13:03:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:49,911 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 13:03:49,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:03:49,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 13:03:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:49,914 INFO L225 Difference]: With dead ends: 145 [2018-01-24 13:03:49,914 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 13:03:49,915 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:03:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 13:03:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 13:03:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 13:03:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 13:03:49,932 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 13:03:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:49,933 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 13:03:49,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:03:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 13:03:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:03:49,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:49,933 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:49,934 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:03:49,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 13:03:49,934 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:49,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:49,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:49,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:49,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:49,955 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:49,985 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:03:49,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:49,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:03:49,985 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:49,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:03:49,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:03:49,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:03:49,986 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 13:03:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:50,068 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 13:03:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:03:50,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 13:03:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:50,070 INFO L225 Difference]: With dead ends: 148 [2018-01-24 13:03:50,071 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 13:03:50,071 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:03:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 13:03:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 13:03:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 13:03:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 13:03:50,089 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 13:03:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:50,089 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 13:03:50,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:03:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 13:03:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:03:50,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:50,091 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:50,091 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:03:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 13:03:50,091 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:50,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:50,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:50,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:50,093 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:50,110 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:50,164 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:03:50,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:50,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:03:50,165 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:50,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:03:50,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:03:50,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:03:50,166 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 13:03:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:50,284 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 13:03:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:03:50,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 13:03:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:50,287 INFO L225 Difference]: With dead ends: 385 [2018-01-24 13:03:50,288 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 13:03:50,289 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:03:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 13:03:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 13:03:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 13:03:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 13:03:50,317 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 13:03:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:50,318 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 13:03:50,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:03:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 13:03:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:03:50,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:50,319 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:03:50,319 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:03:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 13:03:50,320 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:50,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:50,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:50,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:50,321 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:50,336 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:50,377 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:03:50,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:50,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:03:50,378 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:50,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:03:50,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:03:50,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:03:50,379 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 13:03:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:50,550 INFO L93 Difference]: Finished difference Result 392 states and 582 transitions. [2018-01-24 13:03:50,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:03:50,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:03:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:50,555 INFO L225 Difference]: With dead ends: 392 [2018-01-24 13:03:50,555 INFO L226 Difference]: Without dead ends: 388 [2018-01-24 13:03:50,556 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:03:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-01-24 13:03:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-01-24 13:03:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 13:03:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 13:03:50,586 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 13:03:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:50,587 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 13:03:50,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:03:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 13:03:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:03:50,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:50,588 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:03:50,588 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:03:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 13:03:50,588 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:50,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:50,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:50,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:50,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:50,605 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:50,719 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:03:50,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:50,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:03:50,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:50,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:03:50,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:03:50,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:03:50,721 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 13:03:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:50,876 INFO L93 Difference]: Finished difference Result 491 states and 729 transitions. [2018-01-24 13:03:50,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:03:50,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:03:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:50,881 INFO L225 Difference]: With dead ends: 491 [2018-01-24 13:03:50,881 INFO L226 Difference]: Without dead ends: 487 [2018-01-24 13:03:50,882 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:03:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-01-24 13:03:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-01-24 13:03:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 13:03:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 13:03:50,921 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 13:03:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:50,922 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 13:03:50,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:03:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 13:03:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:03:50,923 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:50,923 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:03:50,923 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:03:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 13:03:50,924 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:50,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:50,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:50,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:50,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:50,941 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:51,013 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:03:51,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:51,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:03:51,014 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:51,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:03:51,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:03:51,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:03:51,015 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 13:03:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:51,108 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 13:03:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:03:51,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 13:03:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:51,113 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 13:03:51,113 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 13:03:51,116 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:03:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 13:03:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 13:03:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 13:03:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 13:03:51,162 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 13:03:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:51,162 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 13:03:51,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:03:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 13:03:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:03:51,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:51,164 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:03:51,164 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:03:51,164 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 13:03:51,164 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:51,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:51,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:51,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:51,165 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:51,180 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:51,288 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:03:51,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:51,288 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:03:51,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:51,307 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:51,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:51,538 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:03:51,538 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:51,888 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:03:51,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:51,910 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:03:51,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:51,914 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:52,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:52,045 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:03:52,045 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:52,163 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:03:52,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:52,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8, 6, 6] total 12 [2018-01-24 13:03:52,173 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:52,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:03:52,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:03:52,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:03:52,174 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-01-24 13:03:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:52,939 INFO L93 Difference]: Finished difference Result 2243 states and 3305 transitions. [2018-01-24 13:03:52,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 13:03:52,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 13:03:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:52,949 INFO L225 Difference]: With dead ends: 2243 [2018-01-24 13:03:52,949 INFO L226 Difference]: Without dead ends: 1420 [2018-01-24 13:03:52,953 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:03:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-01-24 13:03:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-01-24 13:03:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-01-24 13:03:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-01-24 13:03:53,044 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-01-24 13:03:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:53,045 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-01-24 13:03:53,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:03:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-01-24 13:03:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:03:53,046 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:53,046 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:03:53,047 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:03:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-01-24 13:03:53,047 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:53,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:53,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:53,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:53,048 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:53,065 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:53,261 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:03:53,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:53,269 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:03:53,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:53,277 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:53,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:53,363 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:03:53,364 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:53,462 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:03:53,497 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:03:53,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2018-01-24 13:03:53,497 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:53,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:03:53,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:03:53,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:03:53,498 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 5 states. [2018-01-24 13:03:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:53,678 INFO L93 Difference]: Finished difference Result 3159 states and 4560 transitions. [2018-01-24 13:03:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:03:53,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-24 13:03:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:53,687 INFO L225 Difference]: With dead ends: 3159 [2018-01-24 13:03:53,687 INFO L226 Difference]: Without dead ends: 1896 [2018-01-24 13:03:53,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 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:03:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2018-01-24 13:03:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1874. [2018-01-24 13:03:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2018-01-24 13:03:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2743 transitions. [2018-01-24 13:03:53,775 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2743 transitions. Word has length 27 [2018-01-24 13:03:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:53,775 INFO L432 AbstractCegarLoop]: Abstraction has 1874 states and 2743 transitions. [2018-01-24 13:03:53,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:03:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2743 transitions. [2018-01-24 13:03:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 13:03:53,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:53,777 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:03:53,777 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:03:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-01-24 13:03:53,777 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:53,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:53,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:53,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:53,779 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:53,796 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:53,952 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:03:53,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:53,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:03:53,952 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:53,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:03:53,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:03:53,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:03:53,953 INFO L87 Difference]: Start difference. First operand 1874 states and 2743 transitions. Second operand 7 states. [2018-01-24 13:03:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:54,652 INFO L93 Difference]: Finished difference Result 2629 states and 3704 transitions. [2018-01-24 13:03:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:03:54,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 13:03:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:54,656 INFO L225 Difference]: With dead ends: 2629 [2018-01-24 13:03:54,656 INFO L226 Difference]: Without dead ends: 664 [2018-01-24 13:03:54,661 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:03:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-01-24 13:03:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 565. [2018-01-24 13:03:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-01-24 13:03:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 745 transitions. [2018-01-24 13:03:54,700 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 745 transitions. Word has length 31 [2018-01-24 13:03:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:54,701 INFO L432 AbstractCegarLoop]: Abstraction has 565 states and 745 transitions. [2018-01-24 13:03:54,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:03:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 745 transitions. [2018-01-24 13:03:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:03:54,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:54,703 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:03:54,703 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:03:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-01-24 13:03:54,703 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:54,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:54,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:54,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:54,705 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:54,724 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:54,849 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:03:54,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:54,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 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:03:54,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:54,863 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:54,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:54,987 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:03:54,988 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:55,088 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:03:55,124 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:03:55,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 10 [2018-01-24 13:03:55,125 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:55,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:03:55,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:03:55,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:03:55,126 INFO L87 Difference]: Start difference. First operand 565 states and 745 transitions. Second operand 4 states. [2018-01-24 13:03:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:55,239 INFO L93 Difference]: Finished difference Result 1134 states and 1499 transitions. [2018-01-24 13:03:55,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:03:55,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-24 13:03:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:55,243 INFO L225 Difference]: With dead ends: 1134 [2018-01-24 13:03:55,243 INFO L226 Difference]: Without dead ends: 574 [2018-01-24 13:03:55,245 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:03:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-01-24 13:03:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 568. [2018-01-24 13:03:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-01-24 13:03:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 748 transitions. [2018-01-24 13:03:55,283 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 748 transitions. Word has length 38 [2018-01-24 13:03:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:55,283 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 748 transitions. [2018-01-24 13:03:55,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:03:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 748 transitions. [2018-01-24 13:03:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:03:55,285 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:55,285 INFO L322 BasicCegarLoop]: trace histogram [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:03:55,285 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:03:55,285 INFO L82 PathProgramCache]: Analyzing trace with hash 38071788, now seen corresponding path program 1 times [2018-01-24 13:03:55,285 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:55,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:55,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:55,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:55,287 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:55,307 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:55,439 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:03:55,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:55,440 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:03:55,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:55,450 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:55,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:55,617 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:55,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:55,928 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:03:55,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:55,935 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:56,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:56,119 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:03:56,119 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:56,348 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:03:56,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:56,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 8, 8] total 14 [2018-01-24 13:03:56,350 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:56,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:03:56,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:03:56,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:03:56,352 INFO L87 Difference]: Start difference. First operand 568 states and 748 transitions. Second operand 11 states. [2018-01-24 13:03:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:57,669 INFO L93 Difference]: Finished difference Result 3064 states and 4279 transitions. [2018-01-24 13:03:57,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 13:03:57,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-24 13:03:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:57,685 INFO L225 Difference]: With dead ends: 3064 [2018-01-24 13:03:57,685 INFO L226 Difference]: Without dead ends: 2504 [2018-01-24 13:03:57,689 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2018-01-24 13:03:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2018-01-24 13:03:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2179. [2018-01-24 13:03:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2179 states. [2018-01-24 13:03:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2911 transitions. [2018-01-24 13:03:57,831 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2911 transitions. Word has length 38 [2018-01-24 13:03:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:57,831 INFO L432 AbstractCegarLoop]: Abstraction has 2179 states and 2911 transitions. [2018-01-24 13:03:57,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:03:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2911 transitions. [2018-01-24 13:03:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:03:57,832 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:57,833 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:57,833 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:03:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1056748287, now seen corresponding path program 1 times [2018-01-24 13:03:57,833 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:57,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:57,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:57,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:57,834 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:57,849 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:58,090 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 21 DAG size of output 17 [2018-01-24 13:03:58,210 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 19 DAG size of output 15 [2018-01-24 13:03:58,293 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:03:58,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:58,294 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:03:58,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:58,303 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:58,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 13:03:58,677 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:58,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:58,909 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:03:58,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:58,918 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:59,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:59,109 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:03:59,109 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:59,270 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:03:59,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:59,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11, 8, 8] total 29 [2018-01-24 13:03:59,273 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:59,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 13:03:59,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 13:03:59,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-01-24 13:03:59,276 INFO L87 Difference]: Start difference. First operand 2179 states and 2911 transitions. Second operand 16 states. [2018-01-24 13:04:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:00,431 INFO L93 Difference]: Finished difference Result 6045 states and 8224 transitions. [2018-01-24 13:04:00,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 13:04:00,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-01-24 13:04:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:00,456 INFO L225 Difference]: With dead ends: 6045 [2018-01-24 13:04:00,456 INFO L226 Difference]: Without dead ends: 3820 [2018-01-24 13:04:00,465 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=525, Invalid=2555, Unknown=0, NotChecked=0, Total=3080 [2018-01-24 13:04:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2018-01-24 13:04:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3242. [2018-01-24 13:04:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3242 states. [2018-01-24 13:04:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 4116 transitions. [2018-01-24 13:04:00,709 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 4116 transitions. Word has length 41 [2018-01-24 13:04:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:00,709 INFO L432 AbstractCegarLoop]: Abstraction has 3242 states and 4116 transitions. [2018-01-24 13:04:00,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 13:04:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 4116 transitions. [2018-01-24 13:04:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 13:04:00,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:00,710 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:04:00,710 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:04:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-01-24 13:04:00,711 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:00,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:00,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:00,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:00,712 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:00,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:00,865 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:04:00,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:00,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 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:04:00,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:00,872 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:00,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:00,963 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:04:00,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:01,079 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:04:01,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:01,099 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:04:01,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:01,102 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:01,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:01,190 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:04:01,190 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:01,248 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:04:01,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:04:01,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8, 8, 8] total 18 [2018-01-24 13:04:01,250 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:04:01,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:04:01,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:04:01,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:04:01,251 INFO L87 Difference]: Start difference. First operand 3242 states and 4116 transitions. Second operand 14 states. [2018-01-24 13:04:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:01,965 INFO L93 Difference]: Finished difference Result 7764 states and 10075 transitions. [2018-01-24 13:04:01,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-24 13:04:01,965 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-01-24 13:04:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:01,982 INFO L225 Difference]: With dead ends: 7764 [2018-01-24 13:04:01,982 INFO L226 Difference]: Without dead ends: 4557 [2018-01-24 13:04:01,989 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 173 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=434, Invalid=1636, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 13:04:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2018-01-24 13:04:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4232. [2018-01-24 13:04:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4232 states. [2018-01-24 13:04:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 5478 transitions. [2018-01-24 13:04:02,172 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 5478 transitions. Word has length 42 [2018-01-24 13:04:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:02,172 INFO L432 AbstractCegarLoop]: Abstraction has 4232 states and 5478 transitions. [2018-01-24 13:04:02,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:04:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 5478 transitions. [2018-01-24 13:04:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 13:04:02,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:02,173 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:04:02,173 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:04:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-01-24 13:04:02,174 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:02,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:02,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:02,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:02,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:02,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:02,383 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:04:02,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:02,384 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:04:02,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:02,410 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:02,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:02,691 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:04:02,691 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:02,826 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:04:02,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:02,846 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:04:02,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:02,852 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:02,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:02,946 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:04:02,946 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:03,015 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:04:03,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:04:03,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 16 [2018-01-24 13:04:03,017 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:04:03,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:04:03,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:04:03,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:04:03,018 INFO L87 Difference]: Start difference. First operand 4232 states and 5478 transitions. Second operand 11 states. [2018-01-24 13:04:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:03,565 INFO L93 Difference]: Finished difference Result 9677 states and 12883 transitions. [2018-01-24 13:04:03,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:04:03,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-01-24 13:04:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:03,632 INFO L225 Difference]: With dead ends: 9677 [2018-01-24 13:04:03,632 INFO L226 Difference]: Without dead ends: 5480 [2018-01-24 13:04:03,645 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 209 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-01-24 13:04:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5480 states. [2018-01-24 13:04:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5480 to 4232. [2018-01-24 13:04:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4232 states. [2018-01-24 13:04:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 5478 transitions. [2018-01-24 13:04:04,005 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 5478 transitions. Word has length 54 [2018-01-24 13:04:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:04,005 INFO L432 AbstractCegarLoop]: Abstraction has 4232 states and 5478 transitions. [2018-01-24 13:04:04,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:04:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 5478 transitions. [2018-01-24 13:04:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 13:04:04,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:04,007 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:04:04,007 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:04:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-01-24 13:04:04,007 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:04,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:04,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:04,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:04,008 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:04,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:04,125 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:04:04,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:04,126 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:04:04,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:04,135 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:04,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:04,280 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:04:04,280 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:04,363 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:04:04,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:04,382 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:04:04,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:04,385 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:04,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:04,538 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:04:04,538 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:04,656 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 15 DAG size of output 9 [2018-01-24 13:04:04,827 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:04:04,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:04:04,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8, 8] total 17 [2018-01-24 13:04:04,829 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:04:04,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:04:04,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:04:04,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:04:04,830 INFO L87 Difference]: Start difference. First operand 4232 states and 5478 transitions. Second operand 15 states. [2018-01-24 13:04:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:05,463 INFO L93 Difference]: Finished difference Result 11321 states and 15419 transitions. [2018-01-24 13:04:05,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 13:04:05,463 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-01-24 13:04:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:05,496 INFO L225 Difference]: With dead ends: 11321 [2018-01-24 13:04:05,496 INFO L226 Difference]: Without dead ends: 6976 [2018-01-24 13:04:05,509 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 13:04:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6976 states. [2018-01-24 13:04:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6976 to 5822. [2018-01-24 13:04:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-01-24 13:04:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 7704 transitions. [2018-01-24 13:04:05,919 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 7704 transitions. Word has length 54 [2018-01-24 13:04:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:05,920 INFO L432 AbstractCegarLoop]: Abstraction has 5822 states and 7704 transitions. [2018-01-24 13:04:05,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:04:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 7704 transitions. [2018-01-24 13:04:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 13:04:05,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:05,922 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:04:05,922 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:04:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-01-24 13:04:05,922 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:05,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:05,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:05,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:05,923 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:05,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:06,050 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:04:06,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:06,051 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:04:06,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:06,060 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:06,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:06,181 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:04:06,182 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:06,350 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:04:06,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:06,383 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:04:06,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:06,389 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:06,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:06,512 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:04:06,512 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:06,669 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:04:06,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:04:06,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 14 [2018-01-24 13:04:06,672 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:04:06,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:04:06,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:04:06,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:04:06,672 INFO L87 Difference]: Start difference. First operand 5822 states and 7704 transitions. Second operand 11 states. [2018-01-24 13:04:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:07,118 INFO L93 Difference]: Finished difference Result 12757 states and 17185 transitions. [2018-01-24 13:04:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:04:07,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-01-24 13:04:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:07,142 INFO L225 Difference]: With dead ends: 12757 [2018-01-24 13:04:07,142 INFO L226 Difference]: Without dead ends: 6970 [2018-01-24 13:04:07,154 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 264 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:04:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2018-01-24 13:04:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 6912. [2018-01-24 13:04:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6912 states. [2018-01-24 13:04:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 9330 transitions. [2018-01-24 13:04:07,444 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 9330 transitions. Word has length 68 [2018-01-24 13:04:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:07,445 INFO L432 AbstractCegarLoop]: Abstraction has 6912 states and 9330 transitions. [2018-01-24 13:04:07,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:04:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 9330 transitions. [2018-01-24 13:04:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 13:04:07,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:07,446 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:04:07,447 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:04:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-01-24 13:04:07,447 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:07,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:07,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:07,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:07,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:07,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:07,700 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:04:07,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:07,700 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:04:07,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:07,705 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:07,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:07,834 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:04:07,834 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:08,000 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:04:08,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:08,020 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:04:08,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:08,023 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:08,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:08,141 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:04:08,142 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:08,229 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:04:08,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:04:08,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12, 11, 12] total 25 [2018-01-24 13:04:08,231 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:04:08,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 13:04:08,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 13:04:08,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:04:08,231 INFO L87 Difference]: Start difference. First operand 6912 states and 9330 transitions. Second operand 18 states. [2018-01-24 13:04:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:09,541 INFO L93 Difference]: Finished difference Result 18733 states and 26275 transitions. [2018-01-24 13:04:09,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 13:04:09,542 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-01-24 13:04:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:09,575 INFO L225 Difference]: With dead ends: 18733 [2018-01-24 13:04:09,575 INFO L226 Difference]: Without dead ends: 11706 [2018-01-24 13:04:09,592 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 271 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=1451, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 13:04:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11706 states. [2018-01-24 13:04:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11706 to 8814. [2018-01-24 13:04:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8814 states. [2018-01-24 13:04:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8814 states to 8814 states and 11818 transitions. [2018-01-24 13:04:10,038 INFO L78 Accepts]: Start accepts. Automaton has 8814 states and 11818 transitions. Word has length 70 [2018-01-24 13:04:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:10,038 INFO L432 AbstractCegarLoop]: Abstraction has 8814 states and 11818 transitions. [2018-01-24 13:04:10,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 13:04:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8814 states and 11818 transitions. [2018-01-24 13:04:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 13:04:10,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:10,040 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:04:10,040 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:04:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-01-24 13:04:10,041 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:10,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:10,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:10,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:10,042 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:10,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:10,409 WARN L146 SmtUtils]: Spent 276ms on a formula simplification. DAG size of input: 21 DAG size of output 17 [2018-01-24 13:04:10,554 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 19 DAG size of output 15 [2018-01-24 13:04:10,788 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:04:10,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:10,789 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:04:10,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:10,803 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:10,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:10,989 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:04:10,989 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:11,110 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:04:11,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:11,130 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:04:11,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:11,133 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:11,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:11,244 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:04:11,244 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:11,338 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:04:11,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:04:11,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 9] total 20 [2018-01-24 13:04:11,340 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:04:11,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:04:11,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:04:11,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-01-24 13:04:11,341 INFO L87 Difference]: Start difference. First operand 8814 states and 11818 transitions. Second operand 17 states. [2018-01-24 13:04:12,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:12,475 INFO L93 Difference]: Finished difference Result 20095 states and 27506 transitions. [2018-01-24 13:04:12,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 13:04:12,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-01-24 13:04:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:12,497 INFO L225 Difference]: With dead ends: 20095 [2018-01-24 13:04:12,497 INFO L226 Difference]: Without dead ends: 11068 [2018-01-24 13:04:12,510 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=270, Invalid=990, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 13:04:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2018-01-24 13:04:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 8236. [2018-01-24 13:04:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8236 states. [2018-01-24 13:04:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 10823 transitions. [2018-01-24 13:04:12,958 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 10823 transitions. Word has length 84 [2018-01-24 13:04:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:12,959 INFO L432 AbstractCegarLoop]: Abstraction has 8236 states and 10823 transitions. [2018-01-24 13:04:12,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:04:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 10823 transitions. [2018-01-24 13:04:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 13:04:12,960 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:12,960 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:04:12,960 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:04:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-01-24 13:04:12,961 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:12,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:12,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:12,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:12,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:12,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:13,151 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:04:13,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:13,152 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:04:13,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:13,158 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:13,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:13,292 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:04:13,292 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:13,421 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:04:13,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:13,441 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:04:13,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:13,444 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:13,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:13,588 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:04:13,588 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:13,686 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:04:13,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:04:13,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11, 9, 9] total 25 [2018-01-24 13:04:13,688 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:04:13,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:04:13,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:04:13,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:04:13,689 INFO L87 Difference]: Start difference. First operand 8236 states and 10823 transitions. Second operand 17 states. [2018-01-24 13:04:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:15,866 INFO L93 Difference]: Finished difference Result 22498 states and 29876 transitions. [2018-01-24 13:04:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-01-24 13:04:15,867 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-01-24 13:04:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:15,897 INFO L225 Difference]: With dead ends: 22498 [2018-01-24 13:04:15,897 INFO L226 Difference]: Without dead ends: 14165 [2018-01-24 13:04:15,913 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 340 SyntacticMatches, 16 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1523, Invalid=6849, Unknown=0, NotChecked=0, Total=8372 [2018-01-24 13:04:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14165 states. [2018-01-24 13:04:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14165 to 12550. [2018-01-24 13:04:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12550 states. [2018-01-24 13:04:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 16604 transitions. [2018-01-24 13:04:16,632 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 16604 transitions. Word has length 87 [2018-01-24 13:04:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:16,632 INFO L432 AbstractCegarLoop]: Abstraction has 12550 states and 16604 transitions. [2018-01-24 13:04:16,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:04:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 16604 transitions. [2018-01-24 13:04:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-24 13:04:16,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:16,636 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:04:16,636 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:04:16,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-01-24 13:04:16,636 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:16,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:16,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:16,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:16,637 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:16,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:16,822 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:04:16,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:16,823 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:04:16,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:16,830 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:16,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:17,147 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:04:17,147 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:17,473 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:04:17,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:04:17,493 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:04:17,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:17,496 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:04:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:17,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:04:17,651 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:04:17,651 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:04:17,801 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:04:17,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:04:17,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14, 11, 14] total 26 [2018-01-24 13:04:17,803 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:04:17,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 13:04:17,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 13:04:17,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-01-24 13:04:17,804 INFO L87 Difference]: Start difference. First operand 12550 states and 16604 transitions. Second operand 20 states. [2018-01-24 13:04:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:25,948 INFO L93 Difference]: Finished difference Result 49422 states and 66791 transitions. [2018-01-24 13:04:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-01-24 13:04:25,948 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-01-24 13:04:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:26,014 INFO L225 Difference]: With dead ends: 49422 [2018-01-24 13:04:26,015 INFO L226 Difference]: Without dead ends: 36445 [2018-01-24 13:04:26,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 434 SyntacticMatches, 8 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16648 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5567, Invalid=37075, Unknown=0, NotChecked=0, Total=42642 [2018-01-24 13:04:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36445 states. Received shutdown request... [2018-01-24 13:04:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36445 to 30650. [2018-01-24 13:04:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30650 states. [2018-01-24 13:04:27,843 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:04:27,848 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:04:27,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:04:27 BoogieIcfgContainer [2018-01-24 13:04:27,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:04:27,849 INFO L168 Benchmark]: Toolchain (without parser) took 39372.26 ms. Allocated memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 261.4 MB in the beginning and 896.9 MB in the end (delta: -635.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 13:04:27,850 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:04:27,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.46 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 249.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:04:27,850 INFO L168 Benchmark]: Boogie Preprocessor took 47.97 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 247.5 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:04:27,851 INFO L168 Benchmark]: RCFGBuilder took 454.60 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 222.5 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:04:27,851 INFO L168 Benchmark]: TraceAbstraction took 38648.55 ms. Allocated memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 222.5 MB in the beginning and 896.9 MB in the end (delta: -674.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 13:04:27,852 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 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.46 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 249.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.97 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 454.60 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 222.5 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 38648.55 ms. Allocated memory was 302.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 222.5 MB in the beginning and 896.9 MB in the end (delta: -674.3 MB). Peak memory consumption was 1.1 GB. 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 ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 38.5s OverallTime, 22 OverallIterations, 7 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2269 SDtfs, 6566 SDslu, 5414 SDs, 0 SdLazy, 12509 SolverSat, 2116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3483 GetRequests, 2768 SyntacticMatches, 78 SemanticMatches, 637 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21567 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12550occurred in iteration=21, 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.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 11451 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2259 NumberOfCodeBlocks, 2259 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3580 ConstructedInterpolants, 0 QuantifiedInterpolants, 647278 SizeOfPredicates, 155 NumberOfNonLiveVariables, 10525 ConjunctsInSsa, 335 ConjunctsInUnsatCore, 70 InterpolantComputations, 13 PerfectInterpolantSequences, 3066/3962 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.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-04-27-860.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-04-27-860.csv Completed graceful shutdown