java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:23:31,738 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:23:31,740 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:23:31,755 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:23:31,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:23:31,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:23:31,758 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:23:31,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:23:31,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:23:31,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:23:31,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:23:31,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:23:31,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:23:31,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:23:31,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:23:31,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:23:31,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:23:31,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:23:31,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:23:31,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:23:31,778 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:23:31,778 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:23:31,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:23:31,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:23:31,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:23:31,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:23:31,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:23:31,782 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:23:31,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:23:31,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:23:31,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:23:31,784 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:23:31,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:23:31,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:23:31,793 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:23:31,794 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:23:31,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:23:31,794 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:23:31,794 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:23:31,794 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:23:31,795 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:23:31,795 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:23:31,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:23:31,795 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:23:31,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:23:31,795 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:23:31,795 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:23:31,796 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:23:31,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:23:31,796 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:23:31,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:23:31,796 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:23:31,796 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:23:31,796 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:23:31,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:23:31,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:23:31,797 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:23:31,797 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:23:31,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:23:31,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:23:31,798 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:23:31,798 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:23:31,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:23:31,798 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:23:31,799 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:23:31,799 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:23:31,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:23:31,842 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:23:31,845 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:23:31,847 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:23:31,847 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:23:31,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i [2018-01-28 22:23:32,030 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:23:32,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:23:32,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:23:32,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:23:32,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:23:32,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d41ed0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32, skipping insertion in model container [2018-01-28 22:23:32,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,058 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:23:32,108 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:23:32,233 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:23:32,254 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:23:32,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32 WrapperNode [2018-01-28 22:23:32,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:23:32,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:23:32,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:23:32,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:23:32,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (1/1) ... [2018-01-28 22:23:32,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:23:32,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:23:32,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:23:32,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:23:32,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:23:32,388 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:23:32,389 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:23:32,389 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:23:32,389 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-28 22:23:32,389 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-28 22:23:32,389 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-01-28 22:23:32,389 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-28 22:23:32,390 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:23:32,390 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:23:32,390 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:23:32,390 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:23:32,390 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:23:32,390 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:23:32,391 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:23:32,391 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:23:32,391 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:23:32,391 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:23:32,391 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:23:32,391 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-28 22:23:32,391 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-28 22:23:32,392 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-01-28 22:23:32,392 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-28 22:23:32,392 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:23:32,392 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:23:32,392 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:23:32,392 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:23:32,691 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:23:32,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:23:32 BoogieIcfgContainer [2018-01-28 22:23:32,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:23:32,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:23:32,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:23:32,696 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:23:32,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:23:32" (1/3) ... [2018-01-28 22:23:32,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@832d66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:23:32, skipping insertion in model container [2018-01-28 22:23:32,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:23:32" (2/3) ... [2018-01-28 22:23:32,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@832d66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:23:32, skipping insertion in model container [2018-01-28 22:23:32,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:23:32" (3/3) ... [2018-01-28 22:23:32,699 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-01-28 22:23:32,706 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:23:32,713 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-28 22:23:32,753 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:23:32,753 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:23:32,753 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:23:32,753 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:23:32,753 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:23:32,754 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:23:32,754 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:23:32,754 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:23:32,754 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:23:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-01-28 22:23:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 22:23:32,778 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:32,779 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 22:23:32,779 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash 120766789, now seen corresponding path program 1 times [2018-01-28 22:23:32,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:32,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:32,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:32,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:32,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:32,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:32,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:32,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:23:32,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:23:32,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:23:32,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:23:32,964 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-01-28 22:23:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:33,178 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-01-28 22:23:33,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:23:33,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-28 22:23:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:33,191 INFO L225 Difference]: With dead ends: 104 [2018-01-28 22:23:33,191 INFO L226 Difference]: Without dead ends: 99 [2018-01-28 22:23:33,194 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:23:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-28 22:23:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2018-01-28 22:23:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-28 22:23:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-01-28 22:23:33,239 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 5 [2018-01-28 22:23:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:33,239 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-01-28 22:23:33,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:23:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-01-28 22:23:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 22:23:33,240 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:33,240 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 22:23:33,240 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash 120766790, now seen corresponding path program 1 times [2018-01-28 22:23:33,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:33,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:33,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:33,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:33,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:33,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:33,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:33,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:23:33,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:23:33,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:23:33,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:23:33,346 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 3 states. [2018-01-28 22:23:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:33,425 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-01-28 22:23:33,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:23:33,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-28 22:23:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:33,428 INFO L225 Difference]: With dead ends: 158 [2018-01-28 22:23:33,428 INFO L226 Difference]: Without dead ends: 156 [2018-01-28 22:23:33,429 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:23:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-28 22:23:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 141. [2018-01-28 22:23:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-28 22:23:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2018-01-28 22:23:33,448 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 5 [2018-01-28 22:23:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:33,449 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2018-01-28 22:23:33,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:23:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2018-01-28 22:23:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:23:33,451 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:33,451 INFO L330 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-01-28 22:23:33,451 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1076223657, now seen corresponding path program 1 times [2018-01-28 22:23:33,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:33,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:33,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:33,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:33,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:33,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:33,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:33,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:23:33,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:23:33,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:23:33,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:33,598 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 6 states. [2018-01-28 22:23:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:33,909 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2018-01-28 22:23:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:23:33,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-28 22:23:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:33,912 INFO L225 Difference]: With dead ends: 164 [2018-01-28 22:23:33,912 INFO L226 Difference]: Without dead ends: 158 [2018-01-28 22:23:33,913 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:23:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-28 22:23:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-01-28 22:23:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-28 22:23:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2018-01-28 22:23:33,933 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 33 [2018-01-28 22:23:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:33,934 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2018-01-28 22:23:33,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:23:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2018-01-28 22:23:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:23:33,936 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:33,936 INFO L330 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-01-28 22:23:33,936 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1076223658, now seen corresponding path program 1 times [2018-01-28 22:23:33,936 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:33,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:33,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:33,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:33,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:33,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:34,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:34,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:23:34,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:23:34,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:23:34,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:34,062 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand 6 states. [2018-01-28 22:23:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:34,127 INFO L93 Difference]: Finished difference Result 168 states and 191 transitions. [2018-01-28 22:23:34,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:23:34,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-28 22:23:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:34,129 INFO L225 Difference]: With dead ends: 168 [2018-01-28 22:23:34,129 INFO L226 Difference]: Without dead ends: 136 [2018-01-28 22:23:34,130 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:23:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-28 22:23:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-01-28 22:23:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-28 22:23:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-01-28 22:23:34,147 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 33 [2018-01-28 22:23:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:34,148 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-01-28 22:23:34,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:23:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-01-28 22:23:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 22:23:34,150 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:34,150 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:34,150 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash -36952508, now seen corresponding path program 1 times [2018-01-28 22:23:34,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:34,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:34,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:34,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:34,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:34,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:34,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:23:34,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:23:34,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:23:34,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:34,231 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 6 states. [2018-01-28 22:23:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:34,300 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2018-01-28 22:23:34,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:23:34,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-28 22:23:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:34,302 INFO L225 Difference]: With dead ends: 142 [2018-01-28 22:23:34,302 INFO L226 Difference]: Without dead ends: 129 [2018-01-28 22:23:34,303 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:23:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-28 22:23:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-28 22:23:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 22:23:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2018-01-28 22:23:34,316 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 32 [2018-01-28 22:23:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:34,317 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2018-01-28 22:23:34,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:23:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2018-01-28 22:23:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:23:34,318 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:34,318 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:34,319 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash -255353602, now seen corresponding path program 1 times [2018-01-28 22:23:34,319 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:34,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:34,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:34,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:34,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:34,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:34,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:23:34,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:23:34,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:23:34,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:23:34,394 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 5 states. [2018-01-28 22:23:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:34,439 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-01-28 22:23:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:23:34,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-28 22:23:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:34,441 INFO L225 Difference]: With dead ends: 131 [2018-01-28 22:23:34,441 INFO L226 Difference]: Without dead ends: 129 [2018-01-28 22:23:34,442 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-28 22:23:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-28 22:23:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 22:23:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2018-01-28 22:23:34,454 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 34 [2018-01-28 22:23:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:34,455 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2018-01-28 22:23:34,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:23:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2018-01-28 22:23:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:23:34,456 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:34,456 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:34,456 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:34,457 INFO L82 PathProgramCache]: Analyzing trace with hash -255353601, now seen corresponding path program 1 times [2018-01-28 22:23:34,457 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:34,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:34,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:34,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:34,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:34,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:34,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:23:34,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:23:34,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:23:34,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:23:34,516 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 5 states. [2018-01-28 22:23:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:34,564 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-01-28 22:23:34,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:23:34,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-28 22:23:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:34,565 INFO L225 Difference]: With dead ends: 129 [2018-01-28 22:23:34,565 INFO L226 Difference]: Without dead ends: 127 [2018-01-28 22:23:34,565 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-28 22:23:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-01-28 22:23:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 22:23:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-01-28 22:23:34,573 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 34 [2018-01-28 22:23:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:34,574 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-01-28 22:23:34,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:23:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-01-28 22:23:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:23:34,575 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:34,575 INFO L330 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-01-28 22:23:34,575 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash -601347762, now seen corresponding path program 1 times [2018-01-28 22:23:34,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:34,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:34,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:34,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:34,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:34,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:34,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:23:34,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:23:34,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:23:34,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:34,659 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 6 states. [2018-01-28 22:23:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:34,761 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-01-28 22:23:34,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:23:34,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-28 22:23:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:34,763 INFO L225 Difference]: With dead ends: 125 [2018-01-28 22:23:34,763 INFO L226 Difference]: Without dead ends: 123 [2018-01-28 22:23:34,763 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:23:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-28 22:23:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-28 22:23:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-28 22:23:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-01-28 22:23:34,770 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 35 [2018-01-28 22:23:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:34,771 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-01-28 22:23:34,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:23:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-01-28 22:23:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:23:34,772 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:34,772 INFO L330 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-01-28 22:23:34,772 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:34,772 INFO L82 PathProgramCache]: Analyzing trace with hash -601347761, now seen corresponding path program 1 times [2018-01-28 22:23:34,772 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:34,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:34,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:34,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:34,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:34,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:34,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:23:34,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:23:34,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:23:34,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:34,861 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 6 states. [2018-01-28 22:23:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:34,959 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-01-28 22:23:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:23:34,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-28 22:23:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:34,960 INFO L225 Difference]: With dead ends: 125 [2018-01-28 22:23:34,960 INFO L226 Difference]: Without dead ends: 123 [2018-01-28 22:23:34,960 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:23:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-28 22:23:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-28 22:23:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-28 22:23:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-01-28 22:23:34,968 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 35 [2018-01-28 22:23:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:34,969 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-01-28 22:23:34,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:23:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-01-28 22:23:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:23:34,970 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:34,970 INFO L330 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] [2018-01-28 22:23:34,970 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1756512775, now seen corresponding path program 1 times [2018-01-28 22:23:34,971 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:34,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:34,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:34,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:34,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:35,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:35,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:23:35,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:23:35,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:23:35,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:23:35,049 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 5 states. [2018-01-28 22:23:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:35,069 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-01-28 22:23:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:23:35,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-28 22:23:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:35,071 INFO L225 Difference]: With dead ends: 132 [2018-01-28 22:23:35,071 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 22:23:35,071 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 22:23:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-28 22:23:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 22:23:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-01-28 22:23:35,076 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 42 [2018-01-28 22:23:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:35,076 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-01-28 22:23:35,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:23:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-01-28 22:23:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:23:35,077 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:35,077 INFO L330 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] [2018-01-28 22:23:35,077 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1238794665, now seen corresponding path program 1 times [2018-01-28 22:23:35,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:35,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:35,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:35,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:35,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:35,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:35,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:35,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:23:35,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:23:35,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:23:35,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:23:35,450 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 8 states. [2018-01-28 22:23:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:36,114 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-01-28 22:23:36,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:23:36,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-28 22:23:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:36,115 INFO L225 Difference]: With dead ends: 82 [2018-01-28 22:23:36,115 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 22:23:36,116 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:23:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 22:23:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-01-28 22:23:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-28 22:23:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-01-28 22:23:36,123 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 43 [2018-01-28 22:23:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:36,123 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-01-28 22:23:36,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:23:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-01-28 22:23:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:23:36,124 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:36,124 INFO L330 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] [2018-01-28 22:23:36,124 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1238794664, now seen corresponding path program 1 times [2018-01-28 22:23:36,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:36,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:36,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:36,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:36,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:36,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:36,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:36,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:23:36,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:23:36,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:23:36,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:23:36,288 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 7 states. [2018-01-28 22:23:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:36,513 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-01-28 22:23:36,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:23:36,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-28 22:23:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:36,514 INFO L225 Difference]: With dead ends: 76 [2018-01-28 22:23:36,514 INFO L226 Difference]: Without dead ends: 74 [2018-01-28 22:23:36,514 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:23:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-28 22:23:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-28 22:23:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-28 22:23:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-01-28 22:23:36,521 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 43 [2018-01-28 22:23:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:36,521 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-01-28 22:23:36,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:23:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-01-28 22:23:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:23:36,522 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:36,522 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:36,522 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash -775804051, now seen corresponding path program 1 times [2018-01-28 22:23:36,523 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:36,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:36,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:36,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:36,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:36,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:36,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:36,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:23:36,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:23:36,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:23:36,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:23:36,579 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 6 states. [2018-01-28 22:23:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:36,618 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-01-28 22:23:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:23:36,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-28 22:23:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:36,619 INFO L225 Difference]: With dead ends: 97 [2018-01-28 22:23:36,619 INFO L226 Difference]: Without dead ends: 72 [2018-01-28 22:23:36,620 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:23:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-28 22:23:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-28 22:23:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-28 22:23:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 71 transitions. [2018-01-28 22:23:36,625 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 71 transitions. Word has length 45 [2018-01-28 22:23:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:36,625 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 71 transitions. [2018-01-28 22:23:36,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:23:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 71 transitions. [2018-01-28 22:23:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:23:36,626 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:36,626 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:36,626 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash -464589248, now seen corresponding path program 1 times [2018-01-28 22:23:36,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:36,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:36,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:36,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:36,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:36,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:36,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:36,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:23:36,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:23:36,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:23:36,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:23:36,718 INFO L87 Difference]: Start difference. First operand 72 states and 71 transitions. Second operand 8 states. [2018-01-28 22:23:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:36,889 INFO L93 Difference]: Finished difference Result 72 states and 71 transitions. [2018-01-28 22:23:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:23:36,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-28 22:23:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:36,891 INFO L225 Difference]: With dead ends: 72 [2018-01-28 22:23:36,891 INFO L226 Difference]: Without dead ends: 71 [2018-01-28 22:23:36,891 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:23:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-28 22:23:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-28 22:23:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-28 22:23:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 70 transitions. [2018-01-28 22:23:36,899 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 70 transitions. Word has length 45 [2018-01-28 22:23:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:36,900 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 70 transitions. [2018-01-28 22:23:36,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:23:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 70 transitions. [2018-01-28 22:23:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:23:36,901 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:36,901 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:36,901 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash -464589247, now seen corresponding path program 1 times [2018-01-28 22:23:36,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:36,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:36,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:36,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:36,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:36,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:37,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:37,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:23:37,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:23:37,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:23:37,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:23:37,092 INFO L87 Difference]: Start difference. First operand 71 states and 70 transitions. Second operand 10 states. [2018-01-28 22:23:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:37,387 INFO L93 Difference]: Finished difference Result 71 states and 70 transitions. [2018-01-28 22:23:37,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 22:23:37,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-28 22:23:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:37,388 INFO L225 Difference]: With dead ends: 71 [2018-01-28 22:23:37,388 INFO L226 Difference]: Without dead ends: 70 [2018-01-28 22:23:37,389 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:23:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-28 22:23:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-28 22:23:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-28 22:23:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 69 transitions. [2018-01-28 22:23:37,396 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 69 transitions. Word has length 45 [2018-01-28 22:23:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:37,396 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 69 transitions. [2018-01-28 22:23:37,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:23:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2018-01-28 22:23:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:23:37,397 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:37,397 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:37,397 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1302902606, now seen corresponding path program 1 times [2018-01-28 22:23:37,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:37,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:37,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:37,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:37,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:37,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:37,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:37,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 22:23:37,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:23:37,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:23:37,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:23:37,604 INFO L87 Difference]: Start difference. First operand 70 states and 69 transitions. Second operand 13 states. [2018-01-28 22:23:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:38,038 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2018-01-28 22:23:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:23:38,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-01-28 22:23:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:38,039 INFO L225 Difference]: With dead ends: 70 [2018-01-28 22:23:38,039 INFO L226 Difference]: Without dead ends: 69 [2018-01-28 22:23:38,040 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:23:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-28 22:23:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-28 22:23:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-28 22:23:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions. [2018-01-28 22:23:38,046 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 56 [2018-01-28 22:23:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:38,047 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 68 transitions. [2018-01-28 22:23:38,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:23:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2018-01-28 22:23:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:23:38,047 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:38,048 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:38,048 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1302902607, now seen corresponding path program 1 times [2018-01-28 22:23:38,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:38,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:38,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:38,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:38,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:38,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:38,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:38,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:23:38,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:23:38,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:23:38,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:23:38,198 INFO L87 Difference]: Start difference. First operand 69 states and 68 transitions. Second operand 8 states. [2018-01-28 22:23:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:38,386 INFO L93 Difference]: Finished difference Result 69 states and 68 transitions. [2018-01-28 22:23:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:23:38,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-28 22:23:38,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:38,387 INFO L225 Difference]: With dead ends: 69 [2018-01-28 22:23:38,387 INFO L226 Difference]: Without dead ends: 68 [2018-01-28 22:23:38,387 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:23:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-28 22:23:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-28 22:23:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-28 22:23:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2018-01-28 22:23:38,393 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 56 [2018-01-28 22:23:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:38,393 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2018-01-28 22:23:38,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:23:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2018-01-28 22:23:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-28 22:23:38,394 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:38,394 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:38,394 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1735275129, now seen corresponding path program 1 times [2018-01-28 22:23:38,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:38,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:38,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:38,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:38,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:23:38,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:23:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:23:38,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:23:38,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:23:38,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:23:38,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:23:38,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:23:38,509 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand 12 states. [2018-01-28 22:23:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:23:38,703 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2018-01-28 22:23:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:23:38,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-01-28 22:23:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:23:38,704 INFO L225 Difference]: With dead ends: 68 [2018-01-28 22:23:38,704 INFO L226 Difference]: Without dead ends: 67 [2018-01-28 22:23:38,704 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-01-28 22:23:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-28 22:23:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-28 22:23:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 22:23:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 66 transitions. [2018-01-28 22:23:38,710 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 66 transitions. Word has length 57 [2018-01-28 22:23:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:23:38,710 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 66 transitions. [2018-01-28 22:23:38,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:23:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 66 transitions. [2018-01-28 22:23:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-28 22:23:38,711 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:23:38,711 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:23:38,711 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:23:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1735275130, now seen corresponding path program 1 times [2018-01-28 22:23:38,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:23:38,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:23:38,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:38,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:23:38,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:23:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:23:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:23:38,765 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 22:23:38,794 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-28 22:23:38,795 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-28 22:23:38,796 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-28 22:23:38,796 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-28 22:23:38,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:23:38 BoogieIcfgContainer [2018-01-28 22:23:38,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:23:38,815 INFO L168 Benchmark]: Toolchain (without parser) took 6783.99 ms. Allocated memory was 305.1 MB in the beginning and 548.9 MB in the end (delta: 243.8 MB). Free memory was 264.2 MB in the beginning and 458.2 MB in the end (delta: -194.0 MB). Peak memory consumption was 49.8 MB. Max. memory is 5.3 GB. [2018-01-28 22:23:38,816 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:23:38,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.25 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 250.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:23:38,816 INFO L168 Benchmark]: Boogie Preprocessor took 45.88 ms. Allocated memory is still 305.1 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:23:38,816 INFO L168 Benchmark]: RCFGBuilder took 380.63 ms. Allocated memory is still 305.1 MB. Free memory was 248.2 MB in the beginning and 227.5 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-28 22:23:38,817 INFO L168 Benchmark]: TraceAbstraction took 6121.00 ms. Allocated memory was 305.1 MB in the beginning and 548.9 MB in the end (delta: 243.8 MB). Free memory was 225.5 MB in the beginning and 458.2 MB in the end (delta: -232.6 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:23:38,818 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.17 ms. Allocated memory is still 305.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.25 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 250.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.88 ms. Allocated memory is still 305.1 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 380.63 ms. Allocated memory is still 305.1 MB. Free memory was 248.2 MB in the beginning and 227.5 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6121.00 ms. Allocated memory was 305.1 MB in the beginning and 548.9 MB in the end (delta: 243.8 MB). Free memory was 225.5 MB in the beginning and 458.2 MB in the end (delta: -232.6 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={7:5}] [L1468] FCALL struct A a6; VAL [a6={8:0}] [L1480] CALL entry_point() VAL [a6={8:0}] [L1472] CALL, EXPR probe3_6(&a6) VAL [a={8:0}, a6={8:0}] [L1444] int ret = - -3; VAL [a={8:0}, a={8:0}, a6={8:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={8:0}] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, a6={8:0}, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={8:0}, malloc(size)={9:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={9:0}, a6={8:0}, malloc(size)={9:0}, size=4] [L1445] EXPR ldv_malloc(sizeof(int)) VAL [a={8:0}, a={8:0}, a6={8:0}, ldv_malloc(sizeof(int))={9:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); VAL [a={8:0}, a={8:0}, a6={8:0}, ldv_malloc(sizeof(int))={9:0}, p={9:0}, ret=3] [L1446] COND FALSE !(p==0) VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={8:0}] [L1435] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={8:0}] [L1448] EXPR f6() VAL [a={8:0}, a={8:0}, a6={8:0}, f6()=0, p={9:0}, ret=3] [L1448] ret = f6() VAL [a={8:0}, a={8:0}, a6={8:0}, f6()=0, p={9:0}, ret=0] [L1449] COND FALSE !(ret<0) VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={8:0}] [L1439] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={8:0}] [L1451] EXPR g6() VAL [a={8:0}, a={8:0}, a6={8:0}, g6()=0, p={9:0}, ret=0] [L1451] ret = g6() VAL [a={8:0}, a={8:0}, a6={8:0}, g6()=0, p={9:0}, ret=0] [L1452] COND FALSE !(ret<0) VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1454] FCALL a->p = p VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1455] FCALL free(p) VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1456] RET return 0; VAL [\result=0, a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1472] EXPR probe3_6(&a6) VAL [a6={8:0}, probe3_6(&a6)=0] [L1472] int ret = probe3_6(&a6); VAL [a6={8:0}, probe3_6(&a6)=0, ret=0] [L1473] COND TRUE ret==0 VAL [a6={8:0}, ret=0] [L1474] CALL disconnect_6(&a6) VAL [a={8:0}, a6={8:0}] [L1464] EXPR, FCALL a->p VAL [a={8:0}, a={8:0}, a->p={9:0}, a6={8:0}] [L1464] FCALL free(a->p) VAL [a={8:0}, a={8:0}, a->p={9:0}, a6={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 87 locations, 15 error locations. UNSAFE Result, 6.0s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1257 SDtfs, 1085 SDslu, 3673 SDs, 0 SdLazy, 1711 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=3, 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 52 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 150279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-23-38-826.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-23-38-826.csv Received shutdown request...