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_Camel+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 11:58:11,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:58:11,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:58:11,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:58:11,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:58:11,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:58:11,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:58:11,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:58:11,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:58:11,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:58:11,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:58:11,101 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:58:11,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:58:11,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:58:11,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:58:11,106 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:58:11,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:58:11,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:58:11,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:58:11,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:58:11,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:58:11,115 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:58:11,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:58:11,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:58:11,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:58:11,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:58:11,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:58:11,119 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:58:11,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:58:11,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:58:11,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:58:11,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:58:11,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:58:11,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:58:11,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:58:11,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:58:11,131 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:58:11,131 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:58:11,132 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:58:11,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:58:11,132 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:58:11,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:58:11,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:58:11,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:58:11,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:58:11,133 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:58:11,134 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:58:11,134 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:58:11,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:58:11,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:58:11,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:58:11,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:58:11,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:58:11,135 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:58:11,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:58:11,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:58:11,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:58:11,136 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:58:11,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:58:11,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:58:11,136 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:58:11,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:58:11,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:58:11,137 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:58:11,138 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:58:11,138 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:58:11,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:58:11,184 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:58:11,188 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:58:11,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:58:11,190 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:58:11,190 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 11:58:11,380 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:58:11,385 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:58:11,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:58:11,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:58:11,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:58:11,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4430c394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11, skipping insertion in model container [2018-01-24 11:58:11,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,413 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:58:11,452 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:58:11,567 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:58:11,586 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:58:11,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11 WrapperNode [2018-01-24 11:58:11,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:58:11,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:58:11,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:58:11,597 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:58:11,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (1/1) ... [2018-01-24 11:58:11,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:58:11,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:58:11,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:58:11,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:58:11,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (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 11:58:11,690 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:58:11,690 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:58:11,690 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 11:58:11,691 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 11:58:11,691 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:58:11,691 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 11:58:11,691 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 11:58:11,691 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:58:11,691 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:58:11,691 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:58:11,691 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:58:11,691 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:58:11,692 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 11:58:11,692 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 11:58:11,692 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:58:11,692 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 11:58:11,692 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 11:58:11,692 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:58:11,692 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:58:11,692 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:58:12,019 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:58:12,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:58:12 BoogieIcfgContainer [2018-01-24 11:58:12,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:58:12,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:58:12,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:58:12,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:58:12,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:58:11" (1/3) ... [2018-01-24 11:58:12,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d586cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:58:12, skipping insertion in model container [2018-01-24 11:58:12,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:58:11" (2/3) ... [2018-01-24 11:58:12,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d586cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:58:12, skipping insertion in model container [2018-01-24 11:58:12,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:58:12" (3/3) ... [2018-01-24 11:58:12,025 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-01-24 11:58:12,031 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:58:12,038 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 11:58:12,075 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:58:12,076 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:58:12,076 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:58:12,076 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:58:12,076 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:58:12,076 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:58:12,076 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:58:12,077 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:58:12,077 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:58:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 11:58:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 11:58:12,103 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:12,104 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:12,104 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 11:58:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 11:58:12,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:12,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:12,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:12,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:12,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:12,255 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 11:58:12,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:12,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:58:12,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 11:58:12,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 11:58:12,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 11:58:12,278 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 11:58:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:12,380 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 11:58:12,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 11:58:12,381 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 11:58:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:12,391 INFO L225 Difference]: With dead ends: 92 [2018-01-24 11:58:12,391 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 11:58:12,393 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 11:58:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 11:58:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 11:58:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 11:58:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 11:58:12,428 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 11:58:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:12,429 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 11:58:12,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 11:58:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 11:58:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 11:58:12,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:12,430 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:12,430 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 11:58:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 11:58:12,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:12,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:12,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:12,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:12,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:12,494 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 11:58:12,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:12,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:58:12,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:58:12,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:58:12,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:58:12,497 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 11:58:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:12,518 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 11:58:12,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:58:12,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 11:58:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:12,520 INFO L225 Difference]: With dead ends: 87 [2018-01-24 11:58:12,520 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 11:58:12,521 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 11:58:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 11:58:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 11:58:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 11:58:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 11:58:12,530 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 11:58:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:12,530 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 11:58:12,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:58:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 11:58:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 11:58:12,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:12,532 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:12,532 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 11:58:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 11:58:12,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:12,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:12,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:12,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:12,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:12,623 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 11:58:12,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:12,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:58:12,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:58:12,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:58:12,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:58:12,624 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 11:58:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:12,664 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 11:58:12,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:58:12,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 11:58:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:12,667 INFO L225 Difference]: With dead ends: 145 [2018-01-24 11:58:12,667 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 11:58:12,668 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 11:58:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 11:58:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 11:58:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 11:58:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 11:58:12,685 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 11:58:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:12,686 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 11:58:12,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:58:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 11:58:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:58:12,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:12,687 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:12,687 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 11:58:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 11:58:12,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:12,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:12,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:12,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:12,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:12,738 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 11:58:12,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:12,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:58:12,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:58:12,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:58:12,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:58:12,740 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 11:58:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:12,822 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 11:58:12,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:58:12,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 11:58:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:12,824 INFO L225 Difference]: With dead ends: 148 [2018-01-24 11:58:12,824 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 11:58:12,825 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 11:58:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 11:58:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 11:58:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 11:58:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 11:58:12,840 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 11:58:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:12,840 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 11:58:12,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:58:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 11:58:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:58:12,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:12,841 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:12,841 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 11:58:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 11:58:12,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:12,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:12,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:12,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:12,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:12,929 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 11:58:12,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:12,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:58:12,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:58:12,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:58:12,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:58:12,930 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 11:58:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:13,028 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 11:58:13,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:58:13,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 11:58:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:13,032 INFO L225 Difference]: With dead ends: 385 [2018-01-24 11:58:13,032 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 11:58:13,034 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 11:58:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 11:58:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 11:58:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 11:58:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 11:58:13,059 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 11:58:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:13,059 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 11:58:13,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:58:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 11:58:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:58:13,060 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:13,060 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:13,060 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 11:58:13,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 11:58:13,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:13,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:13,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:13,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:13,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:13,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:13,101 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 11:58:13,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:13,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:58:13,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:58:13,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:58:13,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:58:13,102 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 11:58:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:13,222 INFO L93 Difference]: Finished difference Result 392 states and 582 transitions. [2018-01-24 11:58:13,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:58:13,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:58:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:13,227 INFO L225 Difference]: With dead ends: 392 [2018-01-24 11:58:13,227 INFO L226 Difference]: Without dead ends: 388 [2018-01-24 11:58:13,228 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 11:58:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-01-24 11:58:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-01-24 11:58:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 11:58:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 11:58:13,262 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 11:58:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:13,262 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 11:58:13,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:58:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 11:58:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:58:13,263 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:13,264 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:13,264 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 11:58:13,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 11:58:13,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:13,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:13,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:13,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:13,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:13,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:13,328 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 11:58:13,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:13,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:58:13,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:58:13,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:58:13,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:58:13,329 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 11:58:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:13,447 INFO L93 Difference]: Finished difference Result 491 states and 729 transitions. [2018-01-24 11:58:13,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:58:13,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:58:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:13,452 INFO L225 Difference]: With dead ends: 491 [2018-01-24 11:58:13,452 INFO L226 Difference]: Without dead ends: 487 [2018-01-24 11:58:13,453 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 11:58:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-01-24 11:58:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-01-24 11:58:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 11:58:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 11:58:13,487 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 11:58:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:13,487 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 11:58:13,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:58:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 11:58:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:58:13,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:13,488 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:13,489 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 11:58:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 11:58:13,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:13,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:13,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:13,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:13,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:13,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:13,555 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 11:58:13,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:13,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:58:13,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:58:13,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:58:13,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:58:13,557 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 11:58:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:13,664 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 11:58:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:58:13,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 11:58:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:13,671 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 11:58:13,671 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 11:58:13,674 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 11:58:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 11:58:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 11:58:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 11:58:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 11:58:13,734 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 11:58:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:13,735 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 11:58:13,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:58:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 11:58:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:58:13,737 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:13,737 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 11:58:13,738 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 11:58:13,738 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 11:58:13,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:13,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:13,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:13,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:13,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:13,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:13,848 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 11:58:13,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:13,849 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:58:13,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:13,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:14,014 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 11:58:14,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:14,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-01-24 11:58:14,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:58:14,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:58:14,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:58:14,048 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-01-24 11:58:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:14,658 INFO L93 Difference]: Finished difference Result 2243 states and 3305 transitions. [2018-01-24 11:58:14,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:58:14,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 11:58:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:14,668 INFO L225 Difference]: With dead ends: 2243 [2018-01-24 11:58:14,668 INFO L226 Difference]: Without dead ends: 1420 [2018-01-24 11:58:14,672 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:58:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-01-24 11:58:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-01-24 11:58:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-01-24 11:58:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-01-24 11:58:14,773 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-01-24 11:58:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:14,774 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-01-24 11:58:14,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:58:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-01-24 11:58:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:58:14,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:14,776 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 11:58:14,776 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 11:58:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-01-24 11:58:14,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:14,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:14,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:14,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:14,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:14,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:15,135 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 11:58:15,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:15,135 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:58:15,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:15,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:15,331 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 11:58:15,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:58:15,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-01-24 11:58:15,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:58:15,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:58:15,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:58:15,367 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 12 states. [2018-01-24 11:58:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:17,785 INFO L93 Difference]: Finished difference Result 6820 states and 10755 transitions. [2018-01-24 11:58:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-24 11:58:17,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-01-24 11:58:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:17,827 INFO L225 Difference]: With dead ends: 6820 [2018-01-24 11:58:17,828 INFO L226 Difference]: Without dead ends: 5557 [2018-01-24 11:58:17,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=648, Invalid=3012, Unknown=0, NotChecked=0, Total=3660 [2018-01-24 11:58:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2018-01-24 11:58:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 4580. [2018-01-24 11:58:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4580 states. [2018-01-24 11:58:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 6778 transitions. [2018-01-24 11:58:18,226 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 6778 transitions. Word has length 27 [2018-01-24 11:58:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:18,226 INFO L432 AbstractCegarLoop]: Abstraction has 4580 states and 6778 transitions. [2018-01-24 11:58:18,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:58:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 6778 transitions. [2018-01-24 11:58:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:58:18,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:18,228 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 11:58:18,229 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 11:58:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-01-24 11:58:18,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:18,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:18,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:18,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:18,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:18,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:18,375 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 11:58:18,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:18,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:58:18,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:58:18,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:58:18,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:58:18,376 INFO L87 Difference]: Start difference. First operand 4580 states and 6778 transitions. Second operand 7 states. [2018-01-24 11:58:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:18,773 INFO L93 Difference]: Finished difference Result 6637 states and 9415 transitions. [2018-01-24 11:58:18,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:58:18,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 11:58:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:18,783 INFO L225 Difference]: With dead ends: 6637 [2018-01-24 11:58:18,783 INFO L226 Difference]: Without dead ends: 1630 [2018-01-24 11:58:18,797 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 11:58:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2018-01-24 11:58:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1495. [2018-01-24 11:58:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2018-01-24 11:58:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1981 transitions. [2018-01-24 11:58:18,906 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1981 transitions. Word has length 31 [2018-01-24 11:58:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:18,906 INFO L432 AbstractCegarLoop]: Abstraction has 1495 states and 1981 transitions. [2018-01-24 11:58:18,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:58:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1981 transitions. [2018-01-24 11:58:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 11:58:18,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:18,908 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 11:58:18,908 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 11:58:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-01-24 11:58:18,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:18,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:18,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:18,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:18,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:18,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:19,022 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 11:58:19,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:19,023 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:58:19,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:19,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:19,124 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 11:58:19,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:58:19,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-01-24 11:58:19,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:58:19,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:58:19,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:58:19,176 INFO L87 Difference]: Start difference. First operand 1495 states and 1981 transitions. Second operand 10 states. [2018-01-24 11:58:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:20,483 INFO L93 Difference]: Finished difference Result 3747 states and 5060 transitions. [2018-01-24 11:58:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:58:20,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-24 11:58:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:20,495 INFO L225 Difference]: With dead ends: 3747 [2018-01-24 11:58:20,495 INFO L226 Difference]: Without dead ends: 2257 [2018-01-24 11:58:20,500 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:58:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2018-01-24 11:58:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2011. [2018-01-24 11:58:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2018-01-24 11:58:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2653 transitions. [2018-01-24 11:58:20,649 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2653 transitions. Word has length 38 [2018-01-24 11:58:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:20,649 INFO L432 AbstractCegarLoop]: Abstraction has 2011 states and 2653 transitions. [2018-01-24 11:58:20,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:58:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2653 transitions. [2018-01-24 11:58:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:58:20,652 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:20,652 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 11:58:20,652 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 11:58:20,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1056748287, now seen corresponding path program 1 times [2018-01-24 11:58:20,652 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:20,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:20,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:20,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:20,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:20,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:20,838 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 11:58:20,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:20,838 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:58:20,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:20,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:21,040 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 11:58:21,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:21,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-01-24 11:58:21,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:58:21,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:58:21,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:58:21,076 INFO L87 Difference]: Start difference. First operand 2011 states and 2653 transitions. Second operand 16 states. [2018-01-24 11:58:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:22,013 INFO L93 Difference]: Finished difference Result 3632 states and 4806 transitions. [2018-01-24 11:58:22,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 11:58:22,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-01-24 11:58:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:22,019 INFO L225 Difference]: With dead ends: 3632 [2018-01-24 11:58:22,019 INFO L226 Difference]: Without dead ends: 1575 [2018-01-24 11:58:22,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 11:58:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2018-01-24 11:58:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1325. [2018-01-24 11:58:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2018-01-24 11:58:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1656 transitions. [2018-01-24 11:58:22,090 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1656 transitions. Word has length 41 [2018-01-24 11:58:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:22,091 INFO L432 AbstractCegarLoop]: Abstraction has 1325 states and 1656 transitions. [2018-01-24 11:58:22,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:58:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1656 transitions. [2018-01-24 11:58:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 11:58:22,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:22,092 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 11:58:22,092 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 11:58:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-01-24 11:58:22,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:22,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:22,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:22,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:22,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:22,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:22,297 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 11:58:22,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:22,297 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:58:22,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:22,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:22,416 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 11:58:22,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:22,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-01-24 11:58:22,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:58:22,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:58:22,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:58:22,449 INFO L87 Difference]: Start difference. First operand 1325 states and 1656 transitions. Second operand 14 states. [2018-01-24 11:58:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:23,158 INFO L93 Difference]: Finished difference Result 3167 states and 4047 transitions. [2018-01-24 11:58:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-24 11:58:23,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-01-24 11:58:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:23,254 INFO L225 Difference]: With dead ends: 3167 [2018-01-24 11:58:23,254 INFO L226 Difference]: Without dead ends: 1879 [2018-01-24 11:58:23,259 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 11:58:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2018-01-24 11:58:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1698. [2018-01-24 11:58:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1698 states. [2018-01-24 11:58:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2143 transitions. [2018-01-24 11:58:23,396 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2143 transitions. Word has length 42 [2018-01-24 11:58:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:23,397 INFO L432 AbstractCegarLoop]: Abstraction has 1698 states and 2143 transitions. [2018-01-24 11:58:23,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:58:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2143 transitions. [2018-01-24 11:58:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 11:58:23,398 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:23,398 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 11:58:23,398 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 11:58:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-01-24 11:58:23,399 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:23,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:23,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:23,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:23,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:23,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:23,516 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 11:58:23,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:23,517 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:58:23,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:23,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:23,642 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 11:58:23,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:23,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-24 11:58:23,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:58:23,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:58:23,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:58:23,676 INFO L87 Difference]: Start difference. First operand 1698 states and 2143 transitions. Second operand 11 states. [2018-01-24 11:58:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:24,149 INFO L93 Difference]: Finished difference Result 3895 states and 5045 transitions. [2018-01-24 11:58:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:58:24,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-01-24 11:58:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:24,157 INFO L225 Difference]: With dead ends: 3895 [2018-01-24 11:58:24,158 INFO L226 Difference]: Without dead ends: 2234 [2018-01-24 11:58:24,161 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:58:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2018-01-24 11:58:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1742. [2018-01-24 11:58:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2018-01-24 11:58:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2209 transitions. [2018-01-24 11:58:24,250 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2209 transitions. Word has length 54 [2018-01-24 11:58:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:24,250 INFO L432 AbstractCegarLoop]: Abstraction has 1742 states and 2209 transitions. [2018-01-24 11:58:24,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:58:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2209 transitions. [2018-01-24 11:58:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 11:58:24,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:24,251 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 11:58:24,251 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 11:58:24,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-01-24 11:58:24,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:24,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:24,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:24,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:24,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:24,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:24,490 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 11:58:24,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:24,491 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:58:24,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:24,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:25,010 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 11:58:25,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:25,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-01-24 11:58:25,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:58:25,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:58:25,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:58:25,032 INFO L87 Difference]: Start difference. First operand 1742 states and 2209 transitions. Second operand 15 states. [2018-01-24 11:58:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:25,551 INFO L93 Difference]: Finished difference Result 4632 states and 6129 transitions. [2018-01-24 11:58:25,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:58:25,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-01-24 11:58:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:25,565 INFO L225 Difference]: With dead ends: 4632 [2018-01-24 11:58:25,565 INFO L226 Difference]: Without dead ends: 2877 [2018-01-24 11:58:25,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 11:58:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2018-01-24 11:58:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2379. [2018-01-24 11:58:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2018-01-24 11:58:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3045 transitions. [2018-01-24 11:58:25,763 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3045 transitions. Word has length 54 [2018-01-24 11:58:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:25,764 INFO L432 AbstractCegarLoop]: Abstraction has 2379 states and 3045 transitions. [2018-01-24 11:58:25,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:58:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3045 transitions. [2018-01-24 11:58:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 11:58:25,766 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:25,766 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 11:58:25,766 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 11:58:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-01-24 11:58:25,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:25,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:25,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:25,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:25,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:25,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:25,882 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 11:58:25,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:25,883 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:58:25,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:25,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:25,993 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 11:58:26,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:26,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-24 11:58:26,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:58:26,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:58:26,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:58:26,014 INFO L87 Difference]: Start difference. First operand 2379 states and 3045 transitions. Second operand 11 states. [2018-01-24 11:58:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:26,338 INFO L93 Difference]: Finished difference Result 5213 states and 6783 transitions. [2018-01-24 11:58:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:58:26,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-01-24 11:58:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:26,346 INFO L225 Difference]: With dead ends: 5213 [2018-01-24 11:58:26,347 INFO L226 Difference]: Without dead ends: 2871 [2018-01-24 11:58:26,353 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:58:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2018-01-24 11:58:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2840. [2018-01-24 11:58:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2840 states. [2018-01-24 11:58:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3705 transitions. [2018-01-24 11:58:26,518 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3705 transitions. Word has length 68 [2018-01-24 11:58:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:26,518 INFO L432 AbstractCegarLoop]: Abstraction has 2840 states and 3705 transitions. [2018-01-24 11:58:26,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:58:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3705 transitions. [2018-01-24 11:58:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 11:58:26,521 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:26,521 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 11:58:26,521 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 11:58:26,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-01-24 11:58:26,522 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:26,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:26,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:26,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:26,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:26,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:26,704 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 11:58:26,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:26,705 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:58:26,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:26,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:26,970 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 11:58:26,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:26,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-01-24 11:58:26,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 11:58:26,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 11:58:26,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:58:26,992 INFO L87 Difference]: Start difference. First operand 2840 states and 3705 transitions. Second operand 18 states. [2018-01-24 11:58:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:28,098 INFO L93 Difference]: Finished difference Result 7770 states and 10469 transitions. [2018-01-24 11:58:28,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 11:58:28,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-01-24 11:58:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:28,112 INFO L225 Difference]: With dead ends: 7770 [2018-01-24 11:58:28,112 INFO L226 Difference]: Without dead ends: 4901 [2018-01-24 11:58:28,121 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 11:58:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2018-01-24 11:58:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 3657. [2018-01-24 11:58:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-01-24 11:58:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4699 transitions. [2018-01-24 11:58:28,371 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4699 transitions. Word has length 70 [2018-01-24 11:58:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:28,372 INFO L432 AbstractCegarLoop]: Abstraction has 3657 states and 4699 transitions. [2018-01-24 11:58:28,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 11:58:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4699 transitions. [2018-01-24 11:58:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 11:58:28,374 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:28,374 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 11:58:28,374 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 11:58:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-01-24 11:58:28,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:28,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:28,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:28,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:28,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:28,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:28,602 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 11:58:28,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:28,603 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:58:28,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:28,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:28,835 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 11:58:28,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:28,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-24 11:58:28,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:58:28,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:58:28,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:58:28,856 INFO L87 Difference]: Start difference. First operand 3657 states and 4699 transitions. Second operand 17 states. [2018-01-24 11:58:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:29,699 INFO L93 Difference]: Finished difference Result 8474 states and 11169 transitions. [2018-01-24 11:58:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 11:58:29,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-01-24 11:58:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:29,712 INFO L225 Difference]: With dead ends: 8474 [2018-01-24 11:58:29,712 INFO L226 Difference]: Without dead ends: 4760 [2018-01-24 11:58:29,721 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 11:58:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2018-01-24 11:58:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 3571. [2018-01-24 11:58:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3571 states. [2018-01-24 11:58:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4537 transitions. [2018-01-24 11:58:29,956 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4537 transitions. Word has length 84 [2018-01-24 11:58:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:29,956 INFO L432 AbstractCegarLoop]: Abstraction has 3571 states and 4537 transitions. [2018-01-24 11:58:29,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:58:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4537 transitions. [2018-01-24 11:58:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 11:58:29,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:29,958 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 11:58:29,958 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 11:58:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-01-24 11:58:29,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:29,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:29,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:29,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:29,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:29,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:30,080 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 11:58:30,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:30,080 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:58:30,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:30,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:30,358 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 11:58:30,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:30,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-01-24 11:58:30,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:58:30,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:58:30,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:58:30,391 INFO L87 Difference]: Start difference. First operand 3571 states and 4537 transitions. Second operand 17 states. [2018-01-24 11:58:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:32,304 INFO L93 Difference]: Finished difference Result 11765 states and 15044 transitions. [2018-01-24 11:58:32,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-24 11:58:32,305 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-01-24 11:58:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:32,321 INFO L225 Difference]: With dead ends: 11765 [2018-01-24 11:58:32,322 INFO L226 Difference]: Without dead ends: 8227 [2018-01-24 11:58:32,330 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1105, Invalid=5537, Unknown=0, NotChecked=0, Total=6642 [2018-01-24 11:58:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8227 states. [2018-01-24 11:58:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8227 to 7332. [2018-01-24 11:58:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7332 states. [2018-01-24 11:58:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7332 states to 7332 states and 9345 transitions. [2018-01-24 11:58:32,727 INFO L78 Accepts]: Start accepts. Automaton has 7332 states and 9345 transitions. Word has length 87 [2018-01-24 11:58:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:32,727 INFO L432 AbstractCegarLoop]: Abstraction has 7332 states and 9345 transitions. [2018-01-24 11:58:32,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:58:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7332 states and 9345 transitions. [2018-01-24 11:58:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-24 11:58:32,729 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:32,729 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 11:58:32,729 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 11:58:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-01-24 11:58:32,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:32,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:32,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:32,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:32,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:32,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:33,104 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 11:58:33,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:33,105 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:58:33,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:33,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:33,384 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 11:58:33,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:33,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-01-24 11:58:33,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 11:58:33,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 11:58:33,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:58:33,467 INFO L87 Difference]: Start difference. First operand 7332 states and 9345 transitions. Second operand 20 states. [2018-01-24 11:58:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:40,448 INFO L93 Difference]: Finished difference Result 29106 states and 37870 transitions. [2018-01-24 11:58:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-01-24 11:58:40,448 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-01-24 11:58:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:40,493 INFO L225 Difference]: With dead ends: 29106 [2018-01-24 11:58:40,493 INFO L226 Difference]: Without dead ends: 21708 [2018-01-24 11:58:40,516 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15935 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4644, Invalid=34362, Unknown=0, NotChecked=0, Total=39006 [2018-01-24 11:58:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21708 states. [2018-01-24 11:58:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21708 to 17569. [2018-01-24 11:58:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17569 states. [2018-01-24 11:58:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17569 states to 17569 states and 22556 transitions. [2018-01-24 11:58:41,638 INFO L78 Accepts]: Start accepts. Automaton has 17569 states and 22556 transitions. Word has length 99 [2018-01-24 11:58:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:41,638 INFO L432 AbstractCegarLoop]: Abstraction has 17569 states and 22556 transitions. [2018-01-24 11:58:41,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 11:58:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 17569 states and 22556 transitions. [2018-01-24 11:58:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-24 11:58:41,641 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:41,641 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:41,641 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 11:58:41,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-01-24 11:58:41,642 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:41,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:41,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:41,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:41,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:41,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 11:58:41,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:41,975 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:58:41,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:42,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 11:58:42,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:42,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-24 11:58:42,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 11:58:42,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 11:58:42,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:58:42,367 INFO L87 Difference]: Start difference. First operand 17569 states and 22556 transitions. Second operand 20 states. [2018-01-24 11:58:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:45,767 INFO L93 Difference]: Finished difference Result 26063 states and 33588 transitions. [2018-01-24 11:58:45,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-24 11:58:45,867 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2018-01-24 11:58:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:45,931 INFO L225 Difference]: With dead ends: 26063 [2018-01-24 11:58:45,931 INFO L226 Difference]: Without dead ends: 26060 [2018-01-24 11:58:45,942 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 109 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=450, Invalid=2000, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 11:58:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26060 states. [2018-01-24 11:58:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26060 to 25197. [2018-01-24 11:58:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25197 states. [2018-01-24 11:58:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25197 states to 25197 states and 32302 transitions. [2018-01-24 11:58:47,598 INFO L78 Accepts]: Start accepts. Automaton has 25197 states and 32302 transitions. Word has length 105 [2018-01-24 11:58:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:47,599 INFO L432 AbstractCegarLoop]: Abstraction has 25197 states and 32302 transitions. [2018-01-24 11:58:47,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 11:58:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 25197 states and 32302 transitions. [2018-01-24 11:58:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-01-24 11:58:47,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:47,605 INFO L322 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:58:47,605 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:58:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1854918738, now seen corresponding path program 1 times [2018-01-24 11:58:47,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:47,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:47,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:47,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:47,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:47,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-01-24 11:58:47,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:58:47,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:58:47,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:58:47,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:58:47,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:58:47,860 INFO L87 Difference]: Start difference. First operand 25197 states and 32302 transitions. Second operand 6 states. [2018-01-24 11:58:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:49,828 INFO L93 Difference]: Finished difference Result 57479 states and 75303 transitions. [2018-01-24 11:58:49,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:58:49,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-01-24 11:58:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:49,894 INFO L225 Difference]: With dead ends: 57479 [2018-01-24 11:58:49,894 INFO L226 Difference]: Without dead ends: 32951 [2018-01-24 11:58:49,923 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:58:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32951 states. [2018-01-24 11:58:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32951 to 32933. [2018-01-24 11:58:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32933 states. [2018-01-24 11:58:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32933 states to 32933 states and 43766 transitions. [2018-01-24 11:58:52,147 INFO L78 Accepts]: Start accepts. Automaton has 32933 states and 43766 transitions. Word has length 131 [2018-01-24 11:58:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:52,148 INFO L432 AbstractCegarLoop]: Abstraction has 32933 states and 43766 transitions. [2018-01-24 11:58:52,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:58:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32933 states and 43766 transitions. [2018-01-24 11:58:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-24 11:58:52,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:52,158 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2018-01-24 11:58:52,158 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 11:58:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash 970215073, now seen corresponding path program 1 times [2018-01-24 11:58:52,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:52,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:52,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:52,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:52,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:52,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 188 proven. 21 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-01-24 11:58:52,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:52,313 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:58:52,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:58:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:52,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 210 proven. 4 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-01-24 11:58:52,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:58:52,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-24 11:58:52,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:58:52,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:58:52,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:58:52,528 INFO L87 Difference]: Start difference. First operand 32933 states and 43766 transitions. Second operand 11 states. Received shutdown request... [2018-01-24 11:58:54,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:58:54,227 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 11:58:54,232 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 11:58:54,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:58:54 BoogieIcfgContainer [2018-01-24 11:58:54,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:58:54,233 INFO L168 Benchmark]: Toolchain (without parser) took 42852.31 ms. Allocated memory was 299.9 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 259.9 MB in the beginning and 766.7 MB in the end (delta: -506.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-24 11:58:54,234 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:58:54,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.88 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 247.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:58:54,235 INFO L168 Benchmark]: Boogie Preprocessor took 37.86 ms. Allocated memory is still 299.9 MB. Free memory was 247.9 MB in the beginning and 245.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:58:54,235 INFO L168 Benchmark]: RCFGBuilder took 384.84 ms. Allocated memory is still 299.9 MB. Free memory was 245.9 MB in the beginning and 220.3 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-01-24 11:58:54,236 INFO L168 Benchmark]: TraceAbstraction took 42211.93 ms. Allocated memory was 299.9 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 220.3 MB in the beginning and 766.7 MB in the end (delta: -546.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 11:58:54,237 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.22 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.88 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 247.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.86 ms. Allocated memory is still 299.9 MB. Free memory was 247.9 MB in the beginning and 245.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 384.84 ms. Allocated memory is still 299.9 MB. Free memory was 245.9 MB in the beginning and 220.3 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42211.93 ms. Allocated memory was 299.9 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 220.3 MB in the beginning and 766.7 MB in the end (delta: -546.5 MB). Peak memory consumption was 1.2 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 BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (32933states) and interpolant automaton (currently 13 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (48148 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 42.1s OverallTime, 24 OverallIterations, 11 TraceHistogramMax, 27.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2671 SDtfs, 9062 SDslu, 6626 SDs, 0 SdLazy, 15191 SolverSat, 2924 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1789 GetRequests, 1088 SyntacticMatches, 19 SemanticMatches, 682 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21580 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32933occurred in iteration=23, 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: 7.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 11455 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2143 NumberOfCodeBlocks, 2143 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2105 ConstructedInterpolants, 10 QuantifiedInterpolants, 514251 SizeOfPredicates, 70 NumberOfNonLiveVariables, 6865 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 2574/3128 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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-58-54-246.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-58-54-246.csv Completed graceful shutdown