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_SmtInterpol_NoArray.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 19:34:57,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:34:57,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:34:57,588 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:34:57,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:34:57,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:34:57,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:34:57,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:34:57,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:34:57,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:34:57,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:34:57,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:34:57,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:34:57,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:34:57,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:34:57,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:34:57,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:34:57,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:34:57,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:34:57,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:34:57,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:34:57,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:34:57,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:34:57,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:34:57,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:34:57,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:34:57,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:34:57,608 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:34:57,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:34:57,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:34:57,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:34:57,609 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 19:34:57,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:34:57,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:34:57,620 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:34:57,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:34:57,620 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:34:57,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:34:57,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:34:57,621 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:34:57,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:34:57,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:34:57,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:34:57,621 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:34:57,621 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:34:57,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:34:57,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:34:57,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:34:57,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:34:57,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:34:57,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:34:57,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:34:57,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:34:57,623 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:34:57,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:34:57,623 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:34:57,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:34:57,664 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:34:57,669 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:34:57,670 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:34:57,670 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:34:57,671 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 19:34:57,811 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:34:57,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:34:57,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:34:57,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:34:57,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:34:57,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57, skipping insertion in model container [2018-02-04 19:34:57,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,834 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:34:57,866 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:34:57,944 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:34:57,957 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:34:57,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57 WrapperNode [2018-02-04 19:34:57,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:34:57,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:34:57,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:34:57,963 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:34:57,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (1/1) ... [2018-02-04 19:34:57,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:34:57,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:34:57,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:34:57,989 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:34:57,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (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 19:34:58,025 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:34:58,025 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:34:58,025 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:34:58,025 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 19:34:58,025 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 19:34:58,025 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 19:34:58,026 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 19:34:58,026 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:34:58,026 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:34:58,026 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:34:58,027 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 19:34:58,027 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 19:34:58,027 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 19:34:58,027 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 19:34:58,027 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:34:58,027 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:34:58,027 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:34:58,027 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:34:58,172 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:34:58,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:34:58 BoogieIcfgContainer [2018-02-04 19:34:58,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:34:58,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:34:58,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:34:58,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:34:58,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:34:57" (1/3) ... [2018-02-04 19:34:58,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6148c22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:34:58, skipping insertion in model container [2018-02-04 19:34:58,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:34:57" (2/3) ... [2018-02-04 19:34:58,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6148c22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:34:58, skipping insertion in model container [2018-02-04 19:34:58,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:34:58" (3/3) ... [2018-02-04 19:34:58,176 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-02-04 19:34:58,181 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:34:58,185 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 19:34:58,216 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:34:58,216 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:34:58,217 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:34:58,217 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:34:58,217 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:34:58,217 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:34:58,217 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:34:58,217 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:34:58,218 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:34:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-04 19:34:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:34:58,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:58,237 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 19:34:58,238 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 19:34:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -554404132, now seen corresponding path program 1 times [2018-02-04 19:34:58,243 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:58,243 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:58,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:58,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:58,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:58,464 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 19:34:58,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:58,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:34:58,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:34:58,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:34:58,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:34:58,478 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-02-04 19:34:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:58,555 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-04 19:34:58,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:34:58,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 19:34:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:58,567 INFO L225 Difference]: With dead ends: 68 [2018-02-04 19:34:58,567 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 19:34:58,569 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 19:34:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 19:34:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-02-04 19:34:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 19:34:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-04 19:34:58,600 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 23 [2018-02-04 19:34:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:58,600 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-04 19:34:58,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:34:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-04 19:34:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:34:58,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:58,601 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 19:34:58,601 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 19:34:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293187, now seen corresponding path program 1 times [2018-02-04 19:34:58,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:58,601 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:58,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,602 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:58,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:58,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:58,677 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 19:34:58,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:58,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:34:58,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:34:58,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:34:58,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:34:58,679 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-02-04 19:34:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:58,792 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 19:34:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:34:58,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 19:34:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:58,794 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:34:58,794 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:34:58,795 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 19:34:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:34:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-02-04 19:34:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 19:34:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 19:34:58,804 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 23 [2018-02-04 19:34:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:58,804 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 19:34:58,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:34:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 19:34:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:34:58,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:58,805 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 19:34:58,805 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 19:34:58,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293188, now seen corresponding path program 1 times [2018-02-04 19:34:58,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:58,806 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:58,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,807 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:58,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:58,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:58,866 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 19:34:58,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:58,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:34:58,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:34:58,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:34:58,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:34:58,867 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 6 states. [2018-02-04 19:34:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:58,894 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-04 19:34:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:34:58,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 19:34:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:58,895 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:34:58,895 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:34:58,896 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 19:34:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:34:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-02-04 19:34:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 19:34:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-02-04 19:34:58,899 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2018-02-04 19:34:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:58,899 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-02-04 19:34:58,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:34:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-02-04 19:34:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:34:58,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:58,900 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 19:34:58,900 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 19:34:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash 787364094, now seen corresponding path program 1 times [2018-02-04 19:34:58,900 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:58,900 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:58,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,901 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:58,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:58,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:58,947 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 19:34:58,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:58,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:34:58,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:34:58,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:34:58,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:34:58,948 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-02-04 19:34:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:58,966 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-04 19:34:58,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:34:58,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 19:34:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:58,967 INFO L225 Difference]: With dead ends: 66 [2018-02-04 19:34:58,967 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 19:34:58,968 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 19:34:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 19:34:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 19:34:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 19:34:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-04 19:34:58,972 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 25 [2018-02-04 19:34:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:58,972 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-04 19:34:58,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:34:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-04 19:34:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:34:58,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:58,973 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 19:34:58,973 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 19:34:58,974 INFO L82 PathProgramCache]: Analyzing trace with hash 787364095, now seen corresponding path program 1 times [2018-02-04 19:34:58,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:58,974 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:58,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:58,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:58,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:59,023 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 19:34:59,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:59,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:34:59,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:34:59,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:34:59,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:34:59,024 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-02-04 19:34:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:59,090 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 19:34:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:34:59,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 19:34:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:59,092 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:34:59,092 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:34:59,092 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 19:34:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:34:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-02-04 19:34:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 19:34:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-04 19:34:59,097 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-02-04 19:34:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:59,097 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-04 19:34:59,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:34:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-04 19:34:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:34:59,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:59,098 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 19:34:59,098 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 19:34:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1459091407, now seen corresponding path program 1 times [2018-02-04 19:34:59,098 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:59,098 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:59,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:59,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:59,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:59,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:59,115 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:34:59,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:34:59,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:34:59,116 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:59,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:34:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:34:59,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:59,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:34:59,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:34:59,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:34:59,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2018-02-04 19:34:59,206 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2018-02-04 19:34:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:59,286 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-02-04 19:34:59,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:34:59,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 19:34:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:59,287 INFO L225 Difference]: With dead ends: 74 [2018-02-04 19:34:59,287 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 19:34:59,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2018-02-04 19:34:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 19:34:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 19:34:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 19:34:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-02-04 19:34:59,291 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 25 [2018-02-04 19:34:59,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:59,292 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-02-04 19:34:59,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:34:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-02-04 19:34:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:34:59,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:59,293 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 19:34:59,293 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 19:34:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1886799503, now seen corresponding path program 1 times [2018-02-04 19:34:59,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:59,293 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:59,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:59,294 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:59,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:59,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:59,337 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 19:34:59,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:59,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:34:59,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:34:59,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:34:59,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:34:59,339 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-02-04 19:34:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:59,359 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 19:34:59,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:34:59,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 19:34:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:59,361 INFO L225 Difference]: With dead ends: 57 [2018-02-04 19:34:59,362 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 19:34:59,362 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 19:34:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 19:34:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 19:34:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 19:34:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 19:34:59,365 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 27 [2018-02-04 19:34:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:59,365 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 19:34:59,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:34:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 19:34:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 19:34:59,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:59,366 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 19:34:59,367 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 19:34:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash 725932211, now seen corresponding path program 1 times [2018-02-04 19:34:59,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:59,367 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:59,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:59,368 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:59,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:59,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:59,381 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:34:59,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:34:59,381 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:34:59,382 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:59,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:34:59,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:34:59,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:59,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:59,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:34:59,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:59,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:59,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:34:59,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:59,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:59,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:34:59,593 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 19:34:59,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:59,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:34:59,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:34:59,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:34:59,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:34:59,595 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 9 states. [2018-02-04 19:34:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:59,763 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 19:34:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:34:59,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 19:34:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:59,764 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:34:59,764 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:34:59,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:34:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:34:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-02-04 19:34:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 19:34:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 19:34:59,768 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 31 [2018-02-04 19:34:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:59,768 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 19:34:59,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:34:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 19:34:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 19:34:59,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:59,768 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 19:34:59,768 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 19:34:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash 725932212, now seen corresponding path program 1 times [2018-02-04 19:34:59,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:59,769 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:59,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:59,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:59,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:59,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:59,782 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:34:59,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:34:59,783 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:34:59,784 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:59,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:34:59,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:34:59,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:59,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:34:59,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:59,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:59,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:34:59,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:59,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 19:34:59,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:59,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:59,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:59,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 19:34:59,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:59,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:59,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 19:35:00,005 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 19:35:00,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:00,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:35:00,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:35:00,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:35:00,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:35:00,007 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 10 states. [2018-02-04 19:35:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:35:01,222 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 19:35:01,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:35:01,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 19:35:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:35:01,222 INFO L225 Difference]: With dead ends: 57 [2018-02-04 19:35:01,223 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 19:35:01,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=140, Unknown=4, NotChecked=0, Total=182 [2018-02-04 19:35:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 19:35:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-02-04 19:35:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 19:35:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-02-04 19:35:01,225 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2018-02-04 19:35:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:35:01,225 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-02-04 19:35:01,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:35:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-02-04 19:35:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 19:35:01,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:35:01,226 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 19:35:01,226 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 19:35:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2094593310, now seen corresponding path program 1 times [2018-02-04 19:35:01,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:35:01,227 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:35:01,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:01,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:01,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:01,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:35:01,263 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 19:35:01,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:01,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:35:01,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:35:01,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:35:01,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:35:01,265 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2018-02-04 19:35:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:35:01,281 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 19:35:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:35:01,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 19:35:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:35:01,282 INFO L225 Difference]: With dead ends: 63 [2018-02-04 19:35:01,282 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 19:35:01,282 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 19:35:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 19:35:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-02-04 19:35:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 19:35:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 19:35:01,285 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2018-02-04 19:35:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:35:01,285 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 19:35:01,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:35:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 19:35:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:35:01,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:35:01,286 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 19:35:01,287 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 19:35:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1386851478, now seen corresponding path program 1 times [2018-02-04 19:35:01,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:35:01,287 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:35:01,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:01,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:01,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:01,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:35:01,299 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:35:01,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:35:01,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:35:01,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:01,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:35:01,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:35:01,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-02-04 19:35:01,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:35:01,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:35:01,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 19:35:01,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:35:01,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:35:01,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:35:01,618 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 19:35:01,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:01,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 19:35:01,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:35:01,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:35:01,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=114, Unknown=7, NotChecked=0, Total=156 [2018-02-04 19:35:01,619 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 13 states. [2018-02-04 19:35:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:35:01,826 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-02-04 19:35:01,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:35:01,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-02-04 19:35:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:35:01,827 INFO L225 Difference]: With dead ends: 65 [2018-02-04 19:35:01,827 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 19:35:01,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=159, Unknown=7, NotChecked=0, Total=210 [2018-02-04 19:35:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 19:35:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-02-04 19:35:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 19:35:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 19:35:01,830 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 35 [2018-02-04 19:35:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:35:01,830 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 19:35:01,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:35:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 19:35:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:35:01,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:35:01,835 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 19:35:01,835 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 19:35:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935703, now seen corresponding path program 1 times [2018-02-04 19:35:01,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:35:01,836 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:35:01,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:01,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:01,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:01,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:35:01,878 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 19:35:01,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:01,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:35:01,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:35:01,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:35:01,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:35:01,879 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 7 states. [2018-02-04 19:35:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:35:01,955 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 19:35:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:35:01,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 19:35:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:35:01,957 INFO L225 Difference]: With dead ends: 53 [2018-02-04 19:35:01,957 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 19:35:01,957 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 19:35:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 19:35:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-02-04 19:35:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 19:35:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-04 19:35:01,958 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 39 [2018-02-04 19:35:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:35:01,958 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-04 19:35:01,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:35:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-04 19:35:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:35:01,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:35:01,959 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 19:35:01,959 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 19:35:01,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935704, now seen corresponding path program 1 times [2018-02-04 19:35:01,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:35:01,959 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:35:01,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:01,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:01,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:01,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:35:02,032 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 19:35:02,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:02,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:35:02,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:35:02,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:35:02,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:35:02,033 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-02-04 19:35:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:35:02,078 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-04 19:35:02,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:35:02,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 19:35:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:35:02,078 INFO L225 Difference]: With dead ends: 51 [2018-02-04 19:35:02,078 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 19:35:02,079 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 19:35:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 19:35:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 19:35:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 19:35:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-04 19:35:02,080 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 39 [2018-02-04 19:35:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:35:02,080 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-04 19:35:02,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:35:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-04 19:35:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 19:35:02,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:35:02,081 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 19:35:02,081 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 19:35:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502653, now seen corresponding path program 1 times [2018-02-04 19:35:02,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:35:02,081 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:35:02,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:02,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:02,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:02,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:35:02,190 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 19:35:02,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:02,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:35:02,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:35:02,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:35:02,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:35:02,192 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 12 states. [2018-02-04 19:35:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:35:02,292 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-04 19:35:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:35:02,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 19:35:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:35:02,293 INFO L225 Difference]: With dead ends: 50 [2018-02-04 19:35:02,293 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 19:35:02,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:35:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 19:35:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 19:35:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 19:35:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-04 19:35:02,296 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 40 [2018-02-04 19:35:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:35:02,296 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-04 19:35:02,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:35:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-04 19:35:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 19:35:02,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:35:02,297 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 19:35:02,297 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 19:35:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502652, now seen corresponding path program 1 times [2018-02-04 19:35:02,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:35:02,297 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:35:02,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:02,298 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:02,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:02,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:35:02,380 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 19:35:02,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:02,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:35:02,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:35:02,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:35:02,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:35:02,380 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 12 states. [2018-02-04 19:35:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:35:02,492 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-04 19:35:02,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:35:02,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 19:35:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:35:02,493 INFO L225 Difference]: With dead ends: 50 [2018-02-04 19:35:02,493 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 19:35:02,494 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 19:35:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 19:35:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-04 19:35:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 19:35:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-02-04 19:35:02,496 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 40 [2018-02-04 19:35:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:35:02,496 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-02-04 19:35:02,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:35:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-02-04 19:35:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:35:02,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:35:02,497 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 19:35:02,497 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 19:35:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash 901697635, now seen corresponding path program 1 times [2018-02-04 19:35:02,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:35:02,497 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:35:02,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:02,498 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:02,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:02,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:35:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:35:02,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:02,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:35:02,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:35:02,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:35:02,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:35:02,613 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2018-02-04 19:35:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:35:02,618 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-02-04 19:35:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:35:02,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 19:35:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:35:02,619 INFO L225 Difference]: With dead ends: 49 [2018-02-04 19:35:02,619 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 19:35:02,619 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 19:35:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 19:35:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 19:35:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 19:35:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-02-04 19:35:02,621 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 41 [2018-02-04 19:35:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:35:02,622 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-02-04 19:35:02,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:35:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-02-04 19:35:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:35:02,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:35:02,623 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 19:35:02,623 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 19:35:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1792979891, now seen corresponding path program 1 times [2018-02-04 19:35:02,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:35:02,623 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:35:02,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:02,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:02,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:35:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:02,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:35:02,652 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:35:02,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:35:02,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:35:02,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:35:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:35:02,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:35:02,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:35:02,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 19:35:02,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:35:02,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:35:02,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:10 [2018-02-04 19:35:02,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:35:02,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 19:35:02,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:35:02,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:35:02,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:10 [2018-02-04 19:35:02,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:35:02,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:35:02,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:35:02,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:35:02,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:35:02,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:34 [2018-02-04 19:35:02,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 19:35:02,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:35:02,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:35:02,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:26 [2018-02-04 19:35:17,542 WARN L143 SmtUtils]: Spent 2014ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 19:35:17,632 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:35:17,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:35:17,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2018-02-04 19:35:17,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-02-04 19:35:17,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:35:17,684 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:35:17,684 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:35:17,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-02-04 19:35:17,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:35:17,722 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:35:17,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-02-04 19:35:17,724 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:35:17,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:35:17,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:35:17,775 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:148, output treesize:55 [2018-02-04 19:35:21,852 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 19:35:21,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:35:21,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 19:35:21,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:35:21,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:35:21,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=281, Unknown=16, NotChecked=0, Total=342 [2018-02-04 19:35:21,853 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 19 states. [2018-02-04 19:36:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:12,356 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-02-04 19:36:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:36:12,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-04 19:36:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:12,357 INFO L225 Difference]: With dead ends: 48 [2018-02-04 19:36:12,357 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 19:36:12,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=119, Invalid=845, Unknown=28, NotChecked=0, Total=992 [2018-02-04 19:36:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 19:36:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 19:36:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 19:36:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 19:36:12,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-04 19:36:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:12,358 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 19:36:12,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:36:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 19:36:12,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 19:36:12,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:36:12 BoogieIcfgContainer [2018-02-04 19:36:12,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:36:12,364 INFO L168 Benchmark]: Toolchain (without parser) took 74552.03 ms. Allocated memory was 402.7 MB in the beginning and 685.2 MB in the end (delta: 282.6 MB). Free memory was 356.6 MB in the beginning and 444.2 MB in the end (delta: -87.5 MB). Peak memory consumption was 195.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:36:12,365 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:36:12,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.87 ms. Allocated memory is still 402.7 MB. Free memory was 356.6 MB in the beginning and 343.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:36:12,365 INFO L168 Benchmark]: Boogie Preprocessor took 25.77 ms. Allocated memory is still 402.7 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:36:12,366 INFO L168 Benchmark]: RCFGBuilder took 183.74 ms. Allocated memory is still 402.7 MB. Free memory was 342.1 MB in the beginning and 320.9 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:36:12,366 INFO L168 Benchmark]: TraceAbstraction took 74190.58 ms. Allocated memory was 402.7 MB in the beginning and 685.2 MB in the end (delta: 282.6 MB). Free memory was 320.9 MB in the beginning and 444.2 MB in the end (delta: -123.2 MB). Peak memory consumption was 159.4 MB. Max. memory is 5.3 GB. [2018-02-04 19:36:12,367 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.19 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.87 ms. Allocated memory is still 402.7 MB. Free memory was 356.6 MB in the beginning and 343.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.77 ms. Allocated memory is still 402.7 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 183.74 ms. Allocated memory is still 402.7 MB. Free memory was 342.1 MB in the beginning and 320.9 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74190.58 ms. Allocated memory was 402.7 MB in the beginning and 685.2 MB in the end (delta: 282.6 MB). Free memory was 320.9 MB in the beginning and 444.2 MB in the end (delta: -123.2 MB). Peak memory consumption was 159.4 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, 74.1s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 52.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 835 SDtfs, 420 SDslu, 2998 SDs, 0 SdLazy, 1586 SolverSat, 105 SolverUnsat, 71 SolverUnknown, 0 SolverNotchecked, 36.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 127 SyntacticMatches, 12 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 36.0s 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, 41 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 531 ConstructedInterpolants, 76 QuantifiedInterpolants, 135249 SizeOfPredicates, 26 NumberOfNonLiveVariables, 662 ConjunctsInSsa, 129 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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-36-12-374.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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-36-12-374.csv Received shutdown request...