java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:12:33,088 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:12:33,090 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:12:33,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:12:33,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:12:33,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:12:33,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:12:33,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:12:33,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:12:33,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:12:33,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:12:33,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:12:33,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:12:33,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:12:33,110 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:12:33,112 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:12:33,113 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:12:33,114 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:12:33,115 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:12:33,116 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:12:33,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:12:33,118 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:12:33,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:12:33,119 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:12:33,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:12:33,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:12:33,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:12:33,121 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:12:33,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:12:33,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:12:33,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:12:33,122 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 14:12:33,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:12:33,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:12:33,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:12:33,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:12:33,132 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:12:33,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:12:33,132 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:12:33,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:12:33,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:12:33,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:12:33,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:12:33,133 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:12:33,133 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:12:33,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:12:33,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:12:33,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:12:33,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:12:33,134 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:12:33,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:12:33,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:12:33,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:12:33,135 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:12:33,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:12:33,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:12:33,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:12:33,175 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:12:33,178 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:12:33,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:12:33,179 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:12:33,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-02-04 14:12:33,325 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:12:33,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:12:33,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:12:33,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:12:33,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:12:33,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228d72e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33, skipping insertion in model container [2018-02-04 14:12:33,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,352 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:12:33,389 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:12:33,473 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:12:33,485 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:12:33,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33 WrapperNode [2018-02-04 14:12:33,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:12:33,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:12:33,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:12:33,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:12:33,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (1/1) ... [2018-02-04 14:12:33,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:12:33,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:12:33,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:12:33,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:12:33,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:12:33,550 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:12:33,551 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:12:33,551 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 14:12:33,551 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 14:12:33,551 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 14:12:33,551 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 14:12:33,551 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 14:12:33,551 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 14:12:33,551 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:12:33,551 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 14:12:33,551 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 14:12:33,551 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:12:33,551 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:12:33,552 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:12:33,680 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:12:33,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:12:33 BoogieIcfgContainer [2018-02-04 14:12:33,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:12:33,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:12:33,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:12:33,682 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:12:33,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:12:33" (1/3) ... [2018-02-04 14:12:33,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f5d346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:12:33, skipping insertion in model container [2018-02-04 14:12:33,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:33" (2/3) ... [2018-02-04 14:12:33,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f5d346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:12:33, skipping insertion in model container [2018-02-04 14:12:33,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:12:33" (3/3) ... [2018-02-04 14:12:33,684 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-02-04 14:12:33,691 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:12:33,695 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 14:12:33,727 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:12:33,727 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:12:33,727 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:12:33,727 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:12:33,727 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:12:33,727 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:12:33,727 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:12:33,727 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:12:33,728 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:12:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-04 14:12:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:12:33,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:33,748 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] [2018-02-04 14:12:33,749 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash -554404132, now seen corresponding path program 1 times [2018-02-04 14:12:33,754 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:33,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:33,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:33,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:33,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:33,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:33,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:33,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:34,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:12:34,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:12:34,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:34,034 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-02-04 14:12:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:34,063 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-04 14:12:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:12:34,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 14:12:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:34,073 INFO L225 Difference]: With dead ends: 68 [2018-02-04 14:12:34,074 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 14:12:34,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 14:12:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-02-04 14:12:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 14:12:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-04 14:12:34,106 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 23 [2018-02-04 14:12:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:34,106 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-04 14:12:34,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:12:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-04 14:12:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:12:34,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:34,107 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] [2018-02-04 14:12:34,107 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:34,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293187, now seen corresponding path program 1 times [2018-02-04 14:12:34,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:34,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:34,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,109 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:34,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:34,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:34,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:34,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:34,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:34,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:34,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:34,187 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-02-04 14:12:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:34,315 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 14:12:34,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:12:34,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 14:12:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:34,316 INFO L225 Difference]: With dead ends: 75 [2018-02-04 14:12:34,316 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 14:12:34,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:12:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 14:12:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-02-04 14:12:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 14:12:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 14:12:34,325 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 23 [2018-02-04 14:12:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:34,325 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 14:12:34,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 14:12:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:12:34,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:34,326 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] [2018-02-04 14:12:34,327 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:34,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293188, now seen corresponding path program 1 times [2018-02-04 14:12:34,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:34,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:34,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,329 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:34,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:34,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:34,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:34,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:12:34,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:34,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:34,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:34,386 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 6 states. [2018-02-04 14:12:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:34,409 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-04 14:12:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:34,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 14:12:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:34,410 INFO L225 Difference]: With dead ends: 75 [2018-02-04 14:12:34,410 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 14:12:34,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 14:12:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-02-04 14:12:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 14:12:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-02-04 14:12:34,413 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2018-02-04 14:12:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:34,413 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-02-04 14:12:34,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-02-04 14:12:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:12:34,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:34,414 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] [2018-02-04 14:12:34,414 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash 787364094, now seen corresponding path program 1 times [2018-02-04 14:12:34,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:34,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:34,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:34,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:34,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:34,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:34,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:34,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:34,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:34,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:34,464 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-02-04 14:12:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:34,488 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-04 14:12:34,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:12:34,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 14:12:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:34,489 INFO L225 Difference]: With dead ends: 66 [2018-02-04 14:12:34,489 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 14:12:34,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 14:12:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 14:12:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 14:12:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-04 14:12:34,494 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 25 [2018-02-04 14:12:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:34,494 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-04 14:12:34,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-04 14:12:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:12:34,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:34,495 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] [2018-02-04 14:12:34,495 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash 787364095, now seen corresponding path program 1 times [2018-02-04 14:12:34,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:34,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:34,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:34,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:34,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:34,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:34,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:34,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:34,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:34,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:34,545 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-02-04 14:12:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:34,599 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 14:12:34,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:34,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 14:12:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:34,600 INFO L225 Difference]: With dead ends: 69 [2018-02-04 14:12:34,600 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 14:12:34,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 14:12:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-02-04 14:12:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 14:12:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-04 14:12:34,603 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-02-04 14:12:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:34,603 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-04 14:12:34,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-04 14:12:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:12:34,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:34,604 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] [2018-02-04 14:12:34,604 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:34,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1459091407, now seen corresponding path program 1 times [2018-02-04 14:12:34,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:34,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:34,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:34,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:34,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:34,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:34,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:12:34,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:12:34,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:12:34,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:12:34,677 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2018-02-04 14:12:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:34,737 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-02-04 14:12:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:12:34,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-04 14:12:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:34,738 INFO L225 Difference]: With dead ends: 74 [2018-02-04 14:12:34,738 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 14:12:34,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 14:12:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 14:12:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 14:12:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-02-04 14:12:34,742 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 25 [2018-02-04 14:12:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:34,742 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-02-04 14:12:34,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:12:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-02-04 14:12:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 14:12:34,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:34,743 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] [2018-02-04 14:12:34,743 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:34,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1886799503, now seen corresponding path program 1 times [2018-02-04 14:12:34,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:34,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:34,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:34,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:34,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:34,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:34,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:12:34,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:34,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:34,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:34,781 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-02-04 14:12:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:34,796 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 14:12:34,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:34,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 14:12:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:34,797 INFO L225 Difference]: With dead ends: 57 [2018-02-04 14:12:34,797 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 14:12:34,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 14:12:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 14:12:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 14:12:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 14:12:34,799 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 27 [2018-02-04 14:12:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:34,800 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 14:12:34,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 14:12:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:12:34,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:34,800 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] [2018-02-04 14:12:34,800 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash 725932211, now seen corresponding path program 1 times [2018-02-04 14:12:34,800 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:34,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:34,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:34,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:34,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:34,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:34,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:12:34,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:12:34,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:12:34,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:12:34,876 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-02-04 14:12:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:35,037 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-02-04 14:12:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:12:35,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 14:12:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:35,039 INFO L225 Difference]: With dead ends: 62 [2018-02-04 14:12:35,039 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 14:12:35,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:12:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 14:12:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-02-04 14:12:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 14:12:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 14:12:35,042 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 31 [2018-02-04 14:12:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:35,043 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 14:12:35,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:12:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 14:12:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:12:35,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:35,043 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] [2018-02-04 14:12:35,043 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash 725932212, now seen corresponding path program 1 times [2018-02-04 14:12:35,044 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:35,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:35,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:35,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:35,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:35,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:35,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:12:35,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:12:35,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:12:35,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:12:35,158 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 9 states. [2018-02-04 14:12:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:35,378 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 14:12:35,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:12:35,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 14:12:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:35,379 INFO L225 Difference]: With dead ends: 57 [2018-02-04 14:12:35,379 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 14:12:35,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:12:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 14:12:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-02-04 14:12:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 14:12:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-02-04 14:12:35,381 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2018-02-04 14:12:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:35,382 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-02-04 14:12:35,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:12:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-02-04 14:12:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 14:12:35,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:35,382 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] [2018-02-04 14:12:35,382 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2094593310, now seen corresponding path program 1 times [2018-02-04 14:12:35,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:35,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:35,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:35,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:35,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:35,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:35,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:12:35,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:35,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:35,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:35,417 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2018-02-04 14:12:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:35,438 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 14:12:35,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:35,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 14:12:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:35,439 INFO L225 Difference]: With dead ends: 63 [2018-02-04 14:12:35,439 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 14:12:35,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 14:12:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-02-04 14:12:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 14:12:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 14:12:35,443 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2018-02-04 14:12:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:35,443 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 14:12:35,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 14:12:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 14:12:35,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:35,444 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] [2018-02-04 14:12:35,444 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1386851478, now seen corresponding path program 1 times [2018-02-04 14:12:35,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:35,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:35,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,446 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:35,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:35,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:35,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:35,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:12:35,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:12:35,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:12:35,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:12:35,631 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 9 states. [2018-02-04 14:12:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:35,769 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-02-04 14:12:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:12:35,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-04 14:12:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:35,770 INFO L225 Difference]: With dead ends: 64 [2018-02-04 14:12:35,770 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:12:35,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:12:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:12:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 14:12:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 14:12:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 14:12:35,773 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 35 [2018-02-04 14:12:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:35,773 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 14:12:35,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:12:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 14:12:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 14:12:35,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:35,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] [2018-02-04 14:12:35,775 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935703, now seen corresponding path program 1 times [2018-02-04 14:12:35,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:35,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:35,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,776 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:35,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:35,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:35,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:35,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:12:35,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:12:35,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:12:35,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:12:35,828 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 7 states. [2018-02-04 14:12:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:35,871 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 14:12:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:12:35,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 14:12:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:35,873 INFO L225 Difference]: With dead ends: 53 [2018-02-04 14:12:35,873 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:12:35,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:12:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:12:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-02-04 14:12:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 14:12:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-04 14:12:35,876 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 39 [2018-02-04 14:12:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:35,876 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-04 14:12:35,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:12:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-04 14:12:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 14:12:35,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:35,877 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] [2018-02-04 14:12:35,877 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935704, now seen corresponding path program 1 times [2018-02-04 14:12:35,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:35,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:35,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,879 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:35,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:35,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:35,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:35,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:12:35,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:12:35,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:12:35,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:12:35,968 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-02-04 14:12:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:36,034 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-04 14:12:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:12:36,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 14:12:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:36,036 INFO L225 Difference]: With dead ends: 51 [2018-02-04 14:12:36,036 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 14:12:36,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:12:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 14:12:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 14:12:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 14:12:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-04 14:12:36,038 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 39 [2018-02-04 14:12:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:36,038 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-04 14:12:36,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:12:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-04 14:12:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 14:12:36,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:36,043 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:36,043 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502653, now seen corresponding path program 1 times [2018-02-04 14:12:36,043 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:36,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:36,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:36,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:36,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:36,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:36,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:36,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:12:36,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:12:36,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:12:36,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:12:36,146 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 12 states. [2018-02-04 14:12:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:36,223 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-04 14:12:36,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:12:36,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 14:12:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:36,224 INFO L225 Difference]: With dead ends: 50 [2018-02-04 14:12:36,224 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:12:36,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:12:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:12:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 14:12:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:12:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-04 14:12:36,226 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 40 [2018-02-04 14:12:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:36,227 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-04 14:12:36,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:12:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-04 14:12:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 14:12:36,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:36,228 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:36,228 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:36,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502652, now seen corresponding path program 1 times [2018-02-04 14:12:36,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:36,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:36,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:36,229 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:36,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:36,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:36,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:36,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:12:36,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:12:36,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:12:36,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:12:36,312 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 12 states. [2018-02-04 14:12:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:36,392 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-04 14:12:36,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:12:36,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 14:12:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:36,393 INFO L225 Difference]: With dead ends: 50 [2018-02-04 14:12:36,393 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:12:36,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:12:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:12:36,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-04 14:12:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 14:12:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-02-04 14:12:36,394 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 40 [2018-02-04 14:12:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:36,394 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-02-04 14:12:36,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:12:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-02-04 14:12:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 14:12:36,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:36,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:36,395 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash 901697635, now seen corresponding path program 1 times [2018-02-04 14:12:36,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:36,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:36,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:36,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:36,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:36,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:36,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:36,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:36,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:12:36,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:12:36,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:36,416 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2018-02-04 14:12:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:36,425 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-02-04 14:12:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:12:36,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 14:12:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:36,426 INFO L225 Difference]: With dead ends: 49 [2018-02-04 14:12:36,427 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 14:12:36,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 14:12:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 14:12:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 14:12:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-02-04 14:12:36,429 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 41 [2018-02-04 14:12:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:36,429 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-02-04 14:12:36,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:12:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-02-04 14:12:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 14:12:36,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:36,430 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:36,430 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 14:12:36,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1792979891, now seen corresponding path program 1 times [2018-02-04 14:12:36,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:36,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:36,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:36,431 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:36,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:36,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:36,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:36,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 14:12:36,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 14:12:36,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 14:12:36,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:12:36,677 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 15 states. [2018-02-04 14:12:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:36,913 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-02-04 14:12:36,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 14:12:36,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-04 14:12:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:36,914 INFO L225 Difference]: With dead ends: 48 [2018-02-04 14:12:36,914 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:12:36,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 14:12:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:12:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:12:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:12:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:12:36,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-04 14:12:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:36,916 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:12:36,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 14:12:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:12:36,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:12:36,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:12:36 BoogieIcfgContainer [2018-02-04 14:12:36,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:12:36,921 INFO L168 Benchmark]: Toolchain (without parser) took 3595.39 ms. Allocated memory was 403.7 MB in the beginning and 695.7 MB in the end (delta: 292.0 MB). Free memory was 357.5 MB in the beginning and 561.5 MB in the end (delta: -204.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:36,922 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 403.7 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:12:36,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.98 ms. Allocated memory is still 403.7 MB. Free memory was 357.5 MB in the beginning and 344.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:36,922 INFO L168 Benchmark]: Boogie Preprocessor took 21.64 ms. Allocated memory is still 403.7 MB. Free memory was 344.3 MB in the beginning and 342.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:36,923 INFO L168 Benchmark]: RCFGBuilder took 167.15 ms. Allocated memory is still 403.7 MB. Free memory was 342.9 MB in the beginning and 321.8 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:36,923 INFO L168 Benchmark]: TraceAbstraction took 3239.72 ms. Allocated memory was 403.7 MB in the beginning and 695.7 MB in the end (delta: 292.0 MB). Free memory was 321.8 MB in the beginning and 561.5 MB in the end (delta: -239.7 MB). Peak memory consumption was 52.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:36,924 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.12 ms. Allocated memory is still 403.7 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.98 ms. Allocated memory is still 403.7 MB. Free memory was 357.5 MB in the beginning and 344.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.64 ms. Allocated memory is still 403.7 MB. Free memory was 344.3 MB in the beginning and 342.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 167.15 ms. Allocated memory is still 403.7 MB. Free memory was 342.9 MB in the beginning and 321.8 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3239.72 ms. Allocated memory was 403.7 MB in the beginning and 695.7 MB in the end (delta: 292.0 MB). Free memory was 321.8 MB in the beginning and 561.5 MB in the end (delta: -239.7 MB). Peak memory consumption was 52.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1474]: 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]: 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 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 3.2s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 304 SDslu, 2992 SDs, 0 SdLazy, 1582 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, 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, 17 MinimizatonAttempts, 33 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 96128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-12-36-930.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-12-36-930.csv Received shutdown request...