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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:12:27,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:12:27,097 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:12:27,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:12:27,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:12:27,107 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:12:27,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:12:27,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:12:27,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:12:27,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:12:27,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:12:27,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:12:27,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:12:27,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:12:27,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:12:27,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:12:27,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:12:27,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:12:27,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:12:27,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:12:27,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:12:27,123 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:12:27,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:12:27,124 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:12:27,125 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:12:27,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:12:27,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:12:27,126 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:12:27,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:12:27,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:12:27,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:12:27,128 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 14:12:27,137 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:12:27,137 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:12:27,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:12:27,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:12:27,139 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:12:27,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:12:27,139 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:12:27,139 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:12:27,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:12:27,139 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:12:27,140 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:12:27,140 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:12:27,140 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:12:27,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:12:27,140 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:12:27,140 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:12:27,140 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:12:27,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:12:27,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:12:27,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:12:27,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:12:27,141 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:12:27,141 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:12:27,141 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:12:27,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:12:27,181 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:12:27,184 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:12:27,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:12:27,185 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:12:27,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-04 14:12:27,346 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:12:27,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:12:27,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:12:27,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:12:27,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:12:27,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27, skipping insertion in model container [2018-02-04 14:12:27,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,372 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:12:27,409 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:12:27,495 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:12:27,508 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:12:27,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27 WrapperNode [2018-02-04 14:12:27,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:12:27,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:12:27,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:12:27,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:12:27,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (1/1) ... [2018-02-04 14:12:27,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:12:27,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:12:27,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:12:27,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:12:27,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 14:12:27,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:12:27,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:12:27,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 14:12:27,581 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 14:12:27,582 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 14:12:27,582 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 14:12:27,582 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 14:12:27,582 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 14:12:27,582 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:12:27,582 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 14:12:27,582 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 14:12:27,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:12:27,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:12:27,582 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:12:27,582 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 14:12:27,582 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 14:12:27,582 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:12:27,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:12:27,731 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:12:27,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:12:27 BoogieIcfgContainer [2018-02-04 14:12:27,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:12:27,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:12:27,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:12:27,734 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:12:27,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:12:27" (1/3) ... [2018-02-04 14:12:27,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f5d346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:12:27, skipping insertion in model container [2018-02-04 14:12:27,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:27" (2/3) ... [2018-02-04 14:12:27,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f5d346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:12:27, skipping insertion in model container [2018-02-04 14:12:27,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:12:27" (3/3) ... [2018-02-04 14:12:27,736 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-04 14:12:27,741 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:12:27,746 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 14:12:27,779 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:12:27,779 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:12:27,779 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:12:27,780 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:12:27,780 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:12:27,780 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:12:27,780 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:12:27,780 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:12:27,781 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:12:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-04 14:12:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 14:12:27,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:27,801 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 14:12:27,801 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash 3262148, now seen corresponding path program 1 times [2018-02-04 14:12:27,807 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:27,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:27,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:27,857 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:27,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:27,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:27,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:27,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:12:27,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:12:27,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:12:27,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:12:27,959 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-04 14:12:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:28,122 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 14:12:28,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:12:28,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 14:12:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:28,129 INFO L225 Difference]: With dead ends: 79 [2018-02-04 14:12:28,129 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 14:12:28,130 INFO L554 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-02-04 14:12:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 14:12:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-04 14:12:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 14:12:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 14:12:28,159 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-04 14:12:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:28,159 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 14:12:28,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:12:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 14:12:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 14:12:28,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:28,159 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 14:12:28,160 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash 3262149, now seen corresponding path program 1 times [2018-02-04 14:12:28,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:28,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:28,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:28,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:28,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:28,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:28,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:12:28,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:12:28,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:12:28,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:12:28,214 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-02-04 14:12:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:28,254 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-04 14:12:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:12:28,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 14:12:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:28,256 INFO L225 Difference]: With dead ends: 116 [2018-02-04 14:12:28,256 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 14:12:28,257 INFO L554 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-02-04 14:12:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 14:12:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-04 14:12:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 14:12:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-04 14:12:28,265 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-04 14:12:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:28,266 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-04 14:12:28,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:12:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-04 14:12:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:12:28,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:28,267 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 14:12:28,267 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751463, now seen corresponding path program 1 times [2018-02-04 14:12:28,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:28,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:28,269 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,269 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:28,269 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:28,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:28,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:28,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:28,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:28,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:28,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:28,355 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-02-04 14:12:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:28,544 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-02-04 14:12:28,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:12:28,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 14:12:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:28,546 INFO L225 Difference]: With dead ends: 122 [2018-02-04 14:12:28,546 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 14:12:28,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:12:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 14:12:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-02-04 14:12:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 14:12:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-04 14:12:28,555 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-02-04 14:12:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:28,556 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-04 14:12:28,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-04 14:12:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:12:28,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:28,557 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 14:12:28,557 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:28,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751462, now seen corresponding path program 1 times [2018-02-04 14:12:28,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:28,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:28,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:28,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:28,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:28,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:28,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:12:28,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:28,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:28,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:28,613 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-02-04 14:12:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:28,639 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2018-02-04 14:12:28,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:28,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 14:12:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:28,641 INFO L225 Difference]: With dead ends: 120 [2018-02-04 14:12:28,641 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 14:12:28,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 14:12:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 14:12:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 14:12:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-04 14:12:28,648 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-02-04 14:12:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:28,648 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-04 14:12:28,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-04 14:12:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:12:28,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:28,649 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 14:12:28,649 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:28,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1288261138, now seen corresponding path program 1 times [2018-02-04 14:12:28,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:28,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:28,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,650 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:28,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:28,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:28,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:28,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:28,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:12:28,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:12:28,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:28,709 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-02-04 14:12:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:28,730 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 14:12:28,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:12:28,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 14:12:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:28,731 INFO L225 Difference]: With dead ends: 77 [2018-02-04 14:12:28,731 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 14:12:28,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 14:12:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 14:12:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 14:12:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 14:12:28,736 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-02-04 14:12:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:28,736 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 14:12:28,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:12:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 14:12:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:12:28,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:28,737 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 14:12:28,737 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:28,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1988329134, now seen corresponding path program 1 times [2018-02-04 14:12:28,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:28,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:28,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,739 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:28,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:28,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:28,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:28,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:12:28,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:28,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:28,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:28,784 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-02-04 14:12:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:28,799 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-04 14:12:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:28,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 14:12:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:28,800 INFO L225 Difference]: With dead ends: 69 [2018-02-04 14:12:28,800 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 14:12:28,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 14:12:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 14:12:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 14:12:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 14:12:28,804 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-02-04 14:12:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:28,804 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 14:12:28,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 14:12:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 14:12:28,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:28,804 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 14:12:28,805 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813492, now seen corresponding path program 1 times [2018-02-04 14:12:28,805 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:28,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:28,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:28,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:28,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:28,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:28,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:28,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:28,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:28,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:28,839 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-04 14:12:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:28,852 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 14:12:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:28,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 14:12:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:28,853 INFO L225 Difference]: With dead ends: 68 [2018-02-04 14:12:28,853 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 14:12:28,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 14:12:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 14:12:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 14:12:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-04 14:12:28,855 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-02-04 14:12:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:28,855 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-04 14:12:28,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-04 14:12:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 14:12:28,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:28,856 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 14:12:28,856 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813493, now seen corresponding path program 1 times [2018-02-04 14:12:28,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:28,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:28,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,857 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:28,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:28,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:28,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:28,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:28,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:28,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:28,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:28,915 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-02-04 14:12:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:28,983 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-04 14:12:28,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:28,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 14:12:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:28,985 INFO L225 Difference]: With dead ends: 67 [2018-02-04 14:12:28,985 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 14:12:28,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 14:12:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 14:12:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 14:12:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 14:12:28,988 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-02-04 14:12:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:28,988 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 14:12:28,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 14:12:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 14:12:28,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:28,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:28,989 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash 840727273, now seen corresponding path program 1 times [2018-02-04 14:12:28,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:28,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:28,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:28,990 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:28,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:29,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:29,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-02-04 14:12:29,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:29,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:12:29,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:12:29,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:12:29,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:12:29,102 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-02-04 14:12:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:29,307 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-04 14:12:29,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:12:29,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 14:12:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:29,307 INFO L225 Difference]: With dead ends: 75 [2018-02-04 14:12:29,308 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 14:12:29,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:12:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 14:12:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 14:12:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 14:12:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 14:12:29,310 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-04 14:12:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:29,310 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 14:12:29,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:12:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 14:12:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 14:12:29,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:29,310 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:29,311 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash 840727274, now seen corresponding path program 1 times [2018-02-04 14:12:29,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:29,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:29,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:29,312 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:29,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:29,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:29,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:29,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:12:29,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:12:29,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:12:29,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:12:29,448 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 10 states. [2018-02-04 14:12:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:29,784 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-04 14:12:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:12:29,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-04 14:12:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:29,785 INFO L225 Difference]: With dead ends: 68 [2018-02-04 14:12:29,785 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 14:12:29,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-02-04 14:12:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 14:12:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-02-04 14:12:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 14:12:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-04 14:12:29,789 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-02-04 14:12:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:29,789 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-04 14:12:29,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:12:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-04 14:12:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 14:12:29,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:29,790 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:29,790 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash -229619546, now seen corresponding path program 1 times [2018-02-04 14:12:29,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:29,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:29,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:29,796 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:29,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:29,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:29,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:29,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:12:29,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:12:29,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:12:29,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:12:29,940 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-02-04 14:12:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:30,149 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-04 14:12:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:12:30,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 14:12:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:30,150 INFO L225 Difference]: With dead ends: 68 [2018-02-04 14:12:30,150 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 14:12:30,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:12:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 14:12:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 14:12:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 14:12:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 14:12:30,152 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 32 [2018-02-04 14:12:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:30,153 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 14:12:30,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:12:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 14:12:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 14:12:30,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:30,153 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:30,153 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1621100812, now seen corresponding path program 1 times [2018-02-04 14:12:30,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:30,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:30,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:30,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:30,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:30,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:30,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:12:30,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:30,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:30,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:30,192 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-04 14:12:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:30,211 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-04 14:12:30,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:30,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 14:12:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:30,215 INFO L225 Difference]: With dead ends: 60 [2018-02-04 14:12:30,215 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 14:12:30,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 14:12:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 14:12:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 14:12:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-04 14:12:30,217 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 34 [2018-02-04 14:12:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:30,217 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-04 14:12:30,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-04 14:12:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 14:12:30,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:30,218 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:30,218 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash -945807698, now seen corresponding path program 1 times [2018-02-04 14:12:30,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:30,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:30,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,219 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:30,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:30,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:30,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:30,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:12:30,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:12:30,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:12:30,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:12:30,301 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-02-04 14:12:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:30,395 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 14:12:30,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:12:30,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-04 14:12:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:30,396 INFO L225 Difference]: With dead ends: 53 [2018-02-04 14:12:30,396 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:12:30,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:12:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:12:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 14:12:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 14:12:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 14:12:30,398 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 40 [2018-02-04 14:12:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:30,398 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 14:12:30,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:12:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 14:12:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 14:12:30,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:30,399 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:30,399 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 744732401, now seen corresponding path program 1 times [2018-02-04 14:12:30,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:30,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:30,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,401 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:30,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:30,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:30,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:30,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:12:30,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:12:30,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:12:30,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:12:30,489 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-02-04 14:12:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:30,632 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-02-04 14:12:30,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:12:30,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-04 14:12:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:30,633 INFO L225 Difference]: With dead ends: 52 [2018-02-04 14:12:30,633 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 14:12:30,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:12:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 14:12:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 14:12:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 14:12:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-04 14:12:30,635 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 41 [2018-02-04 14:12:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:30,636 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-04 14:12:30,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:12:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-04 14:12:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 14:12:30,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:30,637 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:30,637 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash 744732402, now seen corresponding path program 1 times [2018-02-04 14:12:30,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:30,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:30,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:30,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:30,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:30,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:30,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:12:30,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:12:30,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:12:30,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:12:30,710 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-02-04 14:12:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:30,807 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-04 14:12:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:12:30,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-04 14:12:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:30,808 INFO L225 Difference]: With dead ends: 51 [2018-02-04 14:12:30,808 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 14:12:30,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-04 14:12:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 14:12:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 14:12:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 14:12:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-04 14:12:30,809 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 41 [2018-02-04 14:12:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:30,809 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-04 14:12:30,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:12:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-04 14:12:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 14:12:30,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:30,810 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:30,810 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash 746273508, now seen corresponding path program 1 times [2018-02-04 14:12:30,810 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:30,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:30,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,811 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:30,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:30,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:30,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:30,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:30,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:12:30,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:12:30,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:30,840 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 5 states. [2018-02-04 14:12:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:30,865 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2018-02-04 14:12:30,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:12:30,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 14:12:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:30,866 INFO L225 Difference]: With dead ends: 50 [2018-02-04 14:12:30,866 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:12:30,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:12:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 14:12:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:12:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2018-02-04 14:12:30,868 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 41 [2018-02-04 14:12:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:30,869 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2018-02-04 14:12:30,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:12:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2018-02-04 14:12:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 14:12:30,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:30,869 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:30,870 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1423792391, now seen corresponding path program 1 times [2018-02-04 14:12:30,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:30,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:30,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,871 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:30,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:30,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:31,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:31,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 14:12:31,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 14:12:31,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 14:12:31,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:12:31,082 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand 14 states. [2018-02-04 14:12:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:31,412 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-02-04 14:12:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 14:12:31,412 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-02-04 14:12:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:31,413 INFO L225 Difference]: With dead ends: 49 [2018-02-04 14:12:31,413 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 14:12:31,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2018-02-04 14:12:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 14:12:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 14:12:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 14:12:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-02-04 14:12:31,414 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 45 [2018-02-04 14:12:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:31,415 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-02-04 14:12:31,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 14:12:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-02-04 14:12:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 14:12:31,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:31,415 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:31,416 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:31,416 INFO L82 PathProgramCache]: Analyzing trace with hash -897879172, now seen corresponding path program 1 times [2018-02-04 14:12:31,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:31,416 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:31,417 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:31,417 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:31,417 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:31,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:31,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:31,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 14:12:31,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:12:31,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:12:31,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:12:31,581 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 13 states. [2018-02-04 14:12:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:31,757 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-02-04 14:12:31,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:12:31,757 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 14:12:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:31,757 INFO L225 Difference]: With dead ends: 48 [2018-02-04 14:12:31,757 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:12:31,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:12:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:12:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:12:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:12:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:12:31,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-04 14:12:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:31,758 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:12:31,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:12:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:12:31,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:12:31,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:12:31 BoogieIcfgContainer [2018-02-04 14:12:31,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:12:31,762 INFO L168 Benchmark]: Toolchain (without parser) took 4415.64 ms. Allocated memory was 396.4 MB in the beginning and 716.7 MB in the end (delta: 320.3 MB). Free memory was 353.0 MB in the beginning and 657.4 MB in the end (delta: -304.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:31,763 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 396.4 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:12:31,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.18 ms. Allocated memory is still 396.4 MB. Free memory was 353.0 MB in the beginning and 339.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:31,763 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 338.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:31,763 INFO L168 Benchmark]: RCFGBuilder took 189.60 ms. Allocated memory is still 396.4 MB. Free memory was 338.5 MB in the beginning and 315.9 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:31,764 INFO L168 Benchmark]: TraceAbstraction took 4029.81 ms. Allocated memory was 396.4 MB in the beginning and 716.7 MB in the end (delta: 320.3 MB). Free memory was 315.9 MB in the beginning and 657.4 MB in the end (delta: -341.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:12:31,765 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.21 ms. Allocated memory is still 396.4 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.18 ms. Allocated memory is still 396.4 MB. Free memory was 353.0 MB in the beginning and 339.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.32 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 338.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 189.60 ms. Allocated memory is still 396.4 MB. Free memory was 338.5 MB in the beginning and 315.9 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4029.81 ms. Allocated memory was 396.4 MB in the beginning and 716.7 MB in the end (delta: 320.3 MB). Free memory was 315.9 MB in the beginning and 657.4 MB in the end (delta: -341.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1476]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. SAFE Result, 3.9s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 875 SDtfs, 768 SDslu, 2753 SDs, 0 SdLazy, 1905 SolverSat, 211 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 524 ConstructedInterpolants, 0 QuantifiedInterpolants, 111226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-12-31-770.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-12-31-770.csv Received shutdown request...