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/cav18-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-26d9e06-m [2018-02-02 09:33:02,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:33:02,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:33:02,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:33:02,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:33:02,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:33:02,081 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:33:02,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:33:02,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:33:02,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:33:02,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:33:02,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:33:02,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:33:02,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:33:02,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:33:02,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:33:02,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:33:02,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:33:02,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:33:02,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:33:02,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:33:02,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:33:02,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:33:02,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:33:02,106 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:33:02,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:33:02,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:33:02,107 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:33:02,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:33:02,108 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:33:02,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:33:02,108 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:33:02,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:33:02,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:33:02,119 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:33:02,119 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:33:02,119 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:33:02,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:33:02,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:33:02,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:33:02,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:33:02,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:33:02,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:33:02,120 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:33:02,120 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:33:02,120 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:33:02,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:33:02,120 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:33:02,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:33:02,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:33:02,121 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:33:02,121 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:33:02,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:33:02,121 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:33:02,121 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:33:02,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:33:02,122 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:33:02,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:33:02,158 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:33:02,161 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:33:02,162 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:33:02,162 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:33:02,163 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-02 09:33:02,312 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:33:02,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:33:02,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:33:02,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:33:02,318 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:33:02,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5969ab7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02, skipping insertion in model container [2018-02-02 09:33:02,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,331 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:33:02,370 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:33:02,465 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:33:02,477 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:33:02,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02 WrapperNode [2018-02-02 09:33:02,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:33:02,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:33:02,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:33:02,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:33:02,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (1/1) ... [2018-02-02 09:33:02,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:33:02,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:33:02,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:33:02,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:33:02,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (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-02 09:33:02,567 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:33:02,567 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:33:02,568 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 09:33:02,568 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-02 09:33:02,568 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-02 09:33:02,568 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-02 09:33:02,568 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-02 09:33:02,568 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 09:33:02,568 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:33:02,569 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 09:33:02,570 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-02 09:33:02,570 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-02 09:33:02,570 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-02 09:33:02,570 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-02 09:33:02,570 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 09:33:02,570 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:33:02,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:33:02,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:33:02,735 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:33:02,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:33:02 BoogieIcfgContainer [2018-02-02 09:33:02,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:33:02,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:33:02,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:33:02,738 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:33:02,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:33:02" (1/3) ... [2018-02-02 09:33:02,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a42f722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:33:02, skipping insertion in model container [2018-02-02 09:33:02,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:33:02" (2/3) ... [2018-02-02 09:33:02,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a42f722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:33:02, skipping insertion in model container [2018-02-02 09:33:02,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:33:02" (3/3) ... [2018-02-02 09:33:02,742 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-02 09:33:02,747 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:33:02,751 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 09:33:02,773 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:33:02,773 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:33:02,773 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:33:02,773 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:33:02,773 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:33:02,774 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:33:02,774 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:33:02,774 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:33:02,774 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:33:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-02 09:33:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 09:33:02,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:02,787 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 09:33:02,787 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-02 09:33:02,790 INFO L82 PathProgramCache]: Analyzing trace with hash 3262148, now seen corresponding path program 1 times [2018-02-02 09:33:02,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:02,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:02,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:02,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:02,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:02,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:02,933 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-02 09:33:02,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:02,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:33:02,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:33:02,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:33:02,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:33:02,948 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-02 09:33:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:03,117 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 09:33:03,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:33:03,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 09:33:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:03,125 INFO L225 Difference]: With dead ends: 79 [2018-02-02 09:33:03,125 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 09:33:03,126 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-02 09:33:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 09:33:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-02 09:33:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 09:33:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 09:33:03,152 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-02 09:33:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:03,152 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 09:33:03,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:33:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 09:33:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 09:33:03,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:03,153 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 09:33:03,153 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-02 09:33:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash 3262149, now seen corresponding path program 1 times [2018-02-02 09:33:03,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:03,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:03,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:03,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:03,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:33:03,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:03,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:33:03,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:33:03,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:33:03,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:33:03,207 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-02-02 09:33:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:03,257 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-02 09:33:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:33:03,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 09:33:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:03,259 INFO L225 Difference]: With dead ends: 116 [2018-02-02 09:33:03,259 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 09:33:03,260 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-02 09:33:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 09:33:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-02 09:33:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 09:33:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-02 09:33:03,270 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-02 09:33:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:03,270 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-02 09:33:03,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:33:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-02 09:33:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:33:03,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:03,271 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-02 09:33:03,271 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-02 09:33:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751463, now seen corresponding path program 1 times [2018-02-02 09:33:03,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:03,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:03,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:03,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:03,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:03,367 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-02 09:33:03,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:03,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:33:03,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:33:03,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:33:03,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:33:03,369 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-02-02 09:33:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:03,620 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-02-02 09:33:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:33:03,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 09:33:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:03,622 INFO L225 Difference]: With dead ends: 122 [2018-02-02 09:33:03,622 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 09:33:03,622 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-02 09:33:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 09:33:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-02-02 09:33:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 09:33:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-02 09:33:03,632 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-02-02 09:33:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:03,633 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-02 09:33:03,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:33:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-02 09:33:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:33:03,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:03,634 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-02 09:33:03,634 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-02 09:33:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751462, now seen corresponding path program 1 times [2018-02-02 09:33:03,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:03,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:03,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:03,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:03,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:03,728 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-02 09:33:03,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:03,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:33:03,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:33:03,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:33:03,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:33:03,729 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-02-02 09:33:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:03,764 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2018-02-02 09:33:03,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:33:03,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 09:33:03,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:03,765 INFO L225 Difference]: With dead ends: 120 [2018-02-02 09:33:03,765 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 09:33:03,765 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-02 09:33:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 09:33:03,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-02 09:33:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 09:33:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-02 09:33:03,771 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-02-02 09:33:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:03,771 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-02 09:33:03,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:33:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-02 09:33:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:33:03,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:03,772 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-02 09:33:03,772 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-02 09:33:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1288261138, now seen corresponding path program 1 times [2018-02-02 09:33:03,772 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:03,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:03,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:03,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:03,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:03,847 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-02 09:33:03,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:03,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:33:03,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:33:03,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:33:03,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:33:03,848 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-02-02 09:33:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:03,885 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 09:33:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:33:03,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 09:33:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:03,886 INFO L225 Difference]: With dead ends: 77 [2018-02-02 09:33:03,886 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 09:33:03,887 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-02 09:33:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 09:33:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 09:33:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 09:33:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-02 09:33:03,892 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-02-02 09:33:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:03,892 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-02 09:33:03,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:33:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-02 09:33:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:33:03,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:03,893 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-02 09:33:03,893 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-02 09:33:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1988329134, now seen corresponding path program 1 times [2018-02-02 09:33:03,893 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:03,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:03,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:03,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:03,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:03,969 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-02 09:33:03,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:03,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:33:03,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:33:03,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:33:03,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:33:03,970 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-02-02 09:33:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:03,988 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-02 09:33:03,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:33:03,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 09:33:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:03,989 INFO L225 Difference]: With dead ends: 69 [2018-02-02 09:33:03,989 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 09:33:03,989 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-02 09:33:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 09:33:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-02 09:33:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 09:33:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-02 09:33:03,993 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-02-02 09:33:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:03,993 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-02 09:33:03,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:33:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-02 09:33:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:33:03,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:03,994 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-02 09:33:03,994 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-02 09:33:03,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813492, now seen corresponding path program 1 times [2018-02-02 09:33:03,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:03,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:03,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:03,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:03,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:04,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:04,109 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-02 09:33:04,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:04,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:33:04,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:33:04,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:33:04,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:33:04,111 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-02 09:33:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:04,265 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-02 09:33:04,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:33:04,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 09:33:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:04,271 INFO L225 Difference]: With dead ends: 68 [2018-02-02 09:33:04,271 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 09:33:04,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:33:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 09:33:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-02 09:33:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 09:33:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-02 09:33:04,281 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-02-02 09:33:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:04,281 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-02 09:33:04,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:33:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-02 09:33:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:33:04,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:04,283 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-02 09:33:04,283 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-02 09:33:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813493, now seen corresponding path program 1 times [2018-02-02 09:33:04,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:04,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:04,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:04,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:04,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:04,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:04,343 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-02 09:33:04,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:04,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:33:04,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:33:04,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:33:04,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:33:04,344 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-02-02 09:33:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:04,458 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-02 09:33:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:33:04,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 09:33:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:04,464 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:33:04,464 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 09:33:04,464 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-02 09:33:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 09:33:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 09:33:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 09:33:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 09:33:04,468 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-02-02 09:33:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:04,468 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 09:33:04,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:33:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 09:33:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:33:04,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:04,469 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-02 09:33:04,469 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-02 09:33:04,470 INFO L82 PathProgramCache]: Analyzing trace with hash 840727273, now seen corresponding path program 1 times [2018-02-02 09:33:04,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:04,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:04,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:04,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:04,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:04,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:04,584 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-02 09:33:04,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:04,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:33:04,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:33:04,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:33:04,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:33:04,584 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-02-02 09:33:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:04,836 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-02 09:33:04,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:33:04,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 09:33:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:04,837 INFO L225 Difference]: With dead ends: 75 [2018-02-02 09:33:04,837 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 09:33:04,837 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-02 09:33:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 09:33:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-02 09:33:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 09:33:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-02 09:33:04,839 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-02 09:33:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:04,840 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-02 09:33:04,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:33:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-02 09:33:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:33:04,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:04,840 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-02 09:33:04,840 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-02 09:33:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash 840727274, now seen corresponding path program 1 times [2018-02-02 09:33:04,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:04,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:04,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:04,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:04,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:04,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:04,952 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-02 09:33:04,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:04,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:33:04,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:33:04,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:33:04,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:33:04,953 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 10 states. [2018-02-02 09:33:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:05,263 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-02 09:33:05,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:33:05,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-02 09:33:05,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:05,264 INFO L225 Difference]: With dead ends: 68 [2018-02-02 09:33:05,264 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 09:33:05,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:33:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 09:33:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-02-02 09:33:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 09:33:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-02 09:33:05,267 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-02-02 09:33:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:05,271 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-02 09:33:05,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:33:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-02 09:33:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:33:05,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:05,272 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-02 09:33:05,272 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-02 09:33:05,272 INFO L82 PathProgramCache]: Analyzing trace with hash -229619546, now seen corresponding path program 1 times [2018-02-02 09:33:05,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:05,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:05,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:05,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:05,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:05,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:05,469 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-02 09:33:05,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:05,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:33:05,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:33:05,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:33:05,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:33:05,471 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-02-02 09:33:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:05,720 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-02 09:33:05,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:33:05,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 09:33:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:05,721 INFO L225 Difference]: With dead ends: 68 [2018-02-02 09:33:05,721 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 09:33:05,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:33:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 09:33:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-02 09:33:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 09:33:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-02 09:33:05,723 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 32 [2018-02-02 09:33:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:05,724 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-02 09:33:05,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:33:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-02 09:33:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:33:05,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:05,725 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-02 09:33:05,725 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-02 09:33:05,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1621100812, now seen corresponding path program 1 times [2018-02-02 09:33:05,725 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:05,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:05,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:05,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:05,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:05,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:05,758 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-02 09:33:05,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:05,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:33:05,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:33:05,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:33:05,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:33:05,759 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-02 09:33:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:05,771 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-02 09:33:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:33:05,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 09:33:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:05,772 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:33:05,772 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 09:33:05,772 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-02 09:33:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 09:33:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 09:33:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 09:33:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-02 09:33:05,774 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 34 [2018-02-02 09:33:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:05,774 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-02 09:33:05,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:33:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-02 09:33:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 09:33:05,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:05,775 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-02 09:33:05,775 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-02 09:33:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash -945807698, now seen corresponding path program 1 times [2018-02-02 09:33:05,775 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:05,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:05,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:05,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:05,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:05,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:05,855 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-02 09:33:05,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:05,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:33:05,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:33:05,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:33:05,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:33:05,856 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-02-02 09:33:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:05,979 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-02 09:33:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:33:05,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-02 09:33:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:05,980 INFO L225 Difference]: With dead ends: 53 [2018-02-02 09:33:05,980 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 09:33:05,981 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-02 09:33:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 09:33:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 09:33:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:33:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-02 09:33:05,982 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 40 [2018-02-02 09:33:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:05,983 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-02 09:33:05,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:33:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-02 09:33:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:33:05,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:05,984 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-02 09:33:05,984 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-02 09:33:05,984 INFO L82 PathProgramCache]: Analyzing trace with hash 744732401, now seen corresponding path program 1 times [2018-02-02 09:33:05,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:05,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:05,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:05,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:05,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:05,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:06,074 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-02 09:33:06,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:06,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:33:06,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:33:06,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:33:06,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:33:06,075 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-02-02 09:33:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:06,208 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-02-02 09:33:06,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:33:06,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 09:33:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:06,209 INFO L225 Difference]: With dead ends: 52 [2018-02-02 09:33:06,209 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 09:33:06,209 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-02 09:33:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 09:33:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 09:33:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 09:33:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-02 09:33:06,211 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 41 [2018-02-02 09:33:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:06,211 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-02 09:33:06,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:33:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-02 09:33:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:33:06,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:06,212 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-02 09:33:06,212 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-02 09:33:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 744732402, now seen corresponding path program 1 times [2018-02-02 09:33:06,212 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:06,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:06,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:06,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:06,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:06,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:06,329 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-02 09:33:06,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:06,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:33:06,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:33:06,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:33:06,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:33:06,330 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-02-02 09:33:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:06,450 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-02 09:33:06,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:33:06,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 09:33:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:06,450 INFO L225 Difference]: With dead ends: 51 [2018-02-02 09:33:06,450 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 09:33:06,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:33:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 09:33:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 09:33:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:33:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-02 09:33:06,452 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 41 [2018-02-02 09:33:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:06,452 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-02 09:33:06,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:33:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-02 09:33:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:33:06,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:06,452 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-02 09:33:06,453 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-02 09:33:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash 746273508, now seen corresponding path program 1 times [2018-02-02 09:33:06,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:06,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:06,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:06,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:06,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:06,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:06,480 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-02 09:33:06,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:06,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:33:06,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:33:06,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:33:06,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:33:06,481 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 5 states. [2018-02-02 09:33:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:06,489 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2018-02-02 09:33:06,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:33:06,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 09:33:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:06,490 INFO L225 Difference]: With dead ends: 50 [2018-02-02 09:33:06,490 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 09:33:06,490 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-02 09:33:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 09:33:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 09:33:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 09:33:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2018-02-02 09:33:06,492 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 41 [2018-02-02 09:33:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:06,492 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2018-02-02 09:33:06,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:33:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2018-02-02 09:33:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:33:06,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:06,493 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-02 09:33:06,493 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-02 09:33:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1423792391, now seen corresponding path program 1 times [2018-02-02 09:33:06,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:06,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:06,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:06,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:06,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:06,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:06,658 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-02 09:33:06,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:06,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 09:33:06,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:33:06,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:33:06,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:33:06,659 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand 14 states. [2018-02-02 09:33:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:07,029 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-02-02 09:33:07,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:33:07,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-02-02 09:33:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:07,030 INFO L225 Difference]: With dead ends: 49 [2018-02-02 09:33:07,030 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 09:33:07,030 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-02 09:33:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 09:33:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 09:33:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 09:33:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-02-02 09:33:07,031 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 45 [2018-02-02 09:33:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:07,032 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-02-02 09:33:07,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:33:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-02-02 09:33:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:33:07,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:07,032 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-02 09:33:07,032 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-02 09:33:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash -897879172, now seen corresponding path program 1 times [2018-02-02 09:33:07,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:07,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:07,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:07,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:07,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:07,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:07,254 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-02 09:33:07,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:07,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:33:07,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:33:07,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:33:07,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:33:07,256 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 13 states. [2018-02-02 09:33:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:07,487 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-02-02 09:33:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:33:07,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 09:33:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:07,487 INFO L225 Difference]: With dead ends: 48 [2018-02-02 09:33:07,487 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:33:07,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:33:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:33:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:33:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:33:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:33:07,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-02 09:33:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:07,488 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:33:07,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:33:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:33:07,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:33:07,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:33:07 BoogieIcfgContainer [2018-02-02 09:33:07,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:33:07,494 INFO L168 Benchmark]: Toolchain (without parser) took 5181.22 ms. Allocated memory was 401.6 MB in the beginning and 718.3 MB in the end (delta: 316.7 MB). Free memory was 355.4 MB in the beginning and 611.3 MB in the end (delta: -255.9 MB). Peak memory consumption was 60.8 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:07,495 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.6 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:33:07,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.95 ms. Allocated memory is still 401.6 MB. Free memory was 355.4 MB in the beginning and 342.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:07,496 INFO L168 Benchmark]: Boogie Preprocessor took 32.00 ms. Allocated memory is still 401.6 MB. Free memory was 342.2 MB in the beginning and 340.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:07,496 INFO L168 Benchmark]: RCFGBuilder took 221.31 ms. Allocated memory is still 401.6 MB. Free memory was 340.9 MB in the beginning and 318.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:07,496 INFO L168 Benchmark]: TraceAbstraction took 4757.24 ms. Allocated memory was 401.6 MB in the beginning and 718.3 MB in the end (delta: 316.7 MB). Free memory was 318.4 MB in the beginning and 611.3 MB in the end (delta: -292.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:07,498 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.13 ms. Allocated memory is still 401.6 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.95 ms. Allocated memory is still 401.6 MB. Free memory was 355.4 MB in the beginning and 342.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.00 ms. Allocated memory is still 401.6 MB. Free memory was 342.2 MB in the beginning and 340.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 221.31 ms. Allocated memory is still 401.6 MB. Free memory was 340.9 MB in the beginning and 318.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4757.24 ms. Allocated memory was 401.6 MB in the beginning and 718.3 MB in the end (delta: 316.7 MB). Free memory was 318.4 MB in the beginning and 611.3 MB in the end (delta: -292.9 MB). Peak memory consumption was 23.7 MB. 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, 4.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 2.6s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.7s 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.5s 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-02_09-33-07-505.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-02_09-33-07-505.csv Received shutdown request...