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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:11:50,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:11:50,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:11:50,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:11:50,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:11:50,762 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:11:50,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:11:50,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:11:50,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:11:50,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:11:50,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:11:50,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:11:50,769 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:11:50,770 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:11:50,771 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:11:50,773 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:11:50,775 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:11:50,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:11:50,779 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:11:50,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:11:50,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:11:50,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:11:50,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:11:50,784 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:11:50,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:11:50,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:11:50,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:11:50,787 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:11:50,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:11:50,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:11:50,789 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:11:50,789 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:11:50,799 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:11:50,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:11:50,800 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:11:50,800 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:11:50,800 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:11:50,801 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:11:50,801 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:11:50,801 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:11:50,802 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:11:50,802 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:11:50,802 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:11:50,802 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:11:50,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:11:50,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:11:50,803 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:11:50,803 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:11:50,803 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:11:50,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:11:50,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:11:50,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:11:50,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:11:50,804 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:11:50,805 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:11:50,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:11:50,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:11:50,805 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:11:50,806 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:11:50,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:11:50,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:11:50,806 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:11:50,806 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:11:50,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:11:50,807 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:11:50,807 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:11:50,808 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:11:50,808 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:11:50,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:11:50,857 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:11:50,861 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:11:50,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:11:50,863 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:11:50,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-25 06:11:51,090 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:11:51,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:11:51,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:11:51,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:11:51,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:11:51,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7207b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51, skipping insertion in model container [2018-01-25 06:11:51,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,130 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:11:51,184 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:11:51,300 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:11:51,318 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:11:51,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51 WrapperNode [2018-01-25 06:11:51,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:11:51,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:11:51,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:11:51,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:11:51,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (1/1) ... [2018-01-25 06:11:51,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:11:51,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:11:51,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:11:51,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:11:51,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (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-25 06:11:51,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:11:51,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:11:51,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:11:51,412 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-25 06:11:51,412 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-25 06:11:51,412 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-25 06:11:51,412 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-25 06:11:51,413 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:11:51,413 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:11:51,413 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:11:51,413 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:11:51,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:11:51,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:11:51,414 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:11:51,414 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:11:51,414 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:11:51,414 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:11:51,414 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:11:51,414 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-25 06:11:51,415 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-25 06:11:51,415 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-25 06:11:51,415 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-25 06:11:51,415 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:11:51,415 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:11:51,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:11:51,416 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:11:51,643 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:11:51,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:11:51 BoogieIcfgContainer [2018-01-25 06:11:51,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:11:51,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:11:51,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:11:51,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:11:51,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:11:51" (1/3) ... [2018-01-25 06:11:51,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4915b03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:11:51, skipping insertion in model container [2018-01-25 06:11:51,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:51" (2/3) ... [2018-01-25 06:11:51,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4915b03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:11:51, skipping insertion in model container [2018-01-25 06:11:51,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:11:51" (3/3) ... [2018-01-25 06:11:51,651 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-25 06:11:51,660 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:11:51,669 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 06:11:51,713 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:11:51,713 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:11:51,713 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:11:51,713 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:11:51,713 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:11:51,713 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:11:51,714 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:11:51,714 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:11:51,714 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:11:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-25 06:11:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:11:51,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:51,741 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:51,741 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash -554404132, now seen corresponding path program 1 times [2018-01-25 06:11:51,748 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:51,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:51,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:51,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:51,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:51,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:52,031 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-25 06:11:52,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:52,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:11:52,035 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:52,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:11:52,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:11:52,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:11:52,117 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-01-25 06:11:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:52,192 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-01-25 06:11:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:11:52,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 06:11:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:52,208 INFO L225 Difference]: With dead ends: 112 [2018-01-25 06:11:52,209 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 06:11:52,213 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:11:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 06:11:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-01-25 06:11:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 06:11:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-01-25 06:11:52,259 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 23 [2018-01-25 06:11:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:52,259 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-01-25 06:11:52,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:11:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-01-25 06:11:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:11:52,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:52,260 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:52,261 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:52,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293187, now seen corresponding path program 1 times [2018-01-25 06:11:52,261 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:52,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:52,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:52,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:52,264 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:52,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:52,388 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-25 06:11:52,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:52,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:11:52,389 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:52,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:11:52,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:11:52,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:11:52,391 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-01-25 06:11:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:52,601 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-25 06:11:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:11:52,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 06:11:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:52,604 INFO L225 Difference]: With dead ends: 76 [2018-01-25 06:11:52,605 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 06:11:52,606 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:11:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 06:11:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-01-25 06:11:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 06:11:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-01-25 06:11:52,621 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 23 [2018-01-25 06:11:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:52,621 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-01-25 06:11:52,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:11:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-01-25 06:11:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:11:52,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:52,623 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:52,623 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293188, now seen corresponding path program 1 times [2018-01-25 06:11:52,623 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:52,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:52,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:52,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:52,626 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:52,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:52,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-25 06:11:52,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:52,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:11:52,718 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:52,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:11:52,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:11:52,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:11:52,718 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 6 states. [2018-01-25 06:11:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:52,783 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-01-25 06:11:52,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:11:52,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 06:11:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:52,785 INFO L225 Difference]: With dead ends: 95 [2018-01-25 06:11:52,786 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 06:11:52,786 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:11:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 06:11:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-01-25 06:11:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 06:11:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-25 06:11:52,796 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2018-01-25 06:11:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:52,797 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-25 06:11:52,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:11:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-25 06:11:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:11:52,798 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:52,798 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:52,798 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 787364094, now seen corresponding path program 1 times [2018-01-25 06:11:52,799 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:52,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:52,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:52,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:52,800 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:52,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:52,868 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-25 06:11:52,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:52,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:11:52,868 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:52,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:11:52,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:11:52,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:11:52,869 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-01-25 06:11:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:52,919 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-25 06:11:52,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:11:52,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 06:11:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:52,920 INFO L225 Difference]: With dead ends: 67 [2018-01-25 06:11:52,921 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 06:11:52,921 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:11:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 06:11:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-25 06:11:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 06:11:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-25 06:11:52,928 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 25 [2018-01-25 06:11:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:52,928 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-25 06:11:52,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:11:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-25 06:11:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:11:52,929 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:52,929 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:52,929 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash 787364095, now seen corresponding path program 1 times [2018-01-25 06:11:52,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:52,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:52,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:52,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:52,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:52,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:53,018 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-25 06:11:53,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:53,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:11:53,018 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:53,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:11:53,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:11:53,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:11:53,019 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-01-25 06:11:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:53,141 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-25 06:11:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:11:53,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 06:11:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:53,143 INFO L225 Difference]: With dead ends: 70 [2018-01-25 06:11:53,143 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 06:11:53,144 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:11:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 06:11:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-01-25 06:11:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-25 06:11:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-25 06:11:53,154 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-01-25 06:11:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:53,154 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-25 06:11:53,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:11:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-25 06:11:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:11:53,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:53,156 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:53,156 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1459091407, now seen corresponding path program 1 times [2018-01-25 06:11:53,156 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:53,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:53,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:53,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:53,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:53,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:53,253 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-25 06:11:53,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:53,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:11:53,254 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:53,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:11:53,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:11:53,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:11:53,255 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2018-01-25 06:11:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:53,329 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-01-25 06:11:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:11:53,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-25 06:11:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:53,331 INFO L225 Difference]: With dead ends: 75 [2018-01-25 06:11:53,331 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 06:11:53,331 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:11:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 06:11:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 06:11:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 06:11:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-25 06:11:53,341 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 25 [2018-01-25 06:11:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:53,341 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-25 06:11:53,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:11:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-25 06:11:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:11:53,343 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:53,343 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:53,343 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1886799503, now seen corresponding path program 1 times [2018-01-25 06:11:53,344 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:53,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:53,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:53,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:53,346 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:53,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:53,444 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-25 06:11:53,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:53,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:11:53,445 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:53,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:11:53,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:11:53,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:11:53,446 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-01-25 06:11:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:53,471 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-25 06:11:53,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:11:53,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-25 06:11:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:53,473 INFO L225 Difference]: With dead ends: 67 [2018-01-25 06:11:53,473 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 06:11:53,473 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:11:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 06:11:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 06:11:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 06:11:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-25 06:11:53,481 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 27 [2018-01-25 06:11:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:53,481 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-25 06:11:53,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:11:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-25 06:11:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 06:11:53,482 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:53,482 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:53,482 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 725932211, now seen corresponding path program 1 times [2018-01-25 06:11:53,483 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:53,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:53,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:53,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:53,484 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:53,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:53,628 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-25 06:11:53,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:53,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:11:53,628 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:53,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:11:53,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:11:53,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:11:53,629 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-01-25 06:11:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:53,895 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-25 06:11:53,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:11:53,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-25 06:11:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:53,897 INFO L225 Difference]: With dead ends: 63 [2018-01-25 06:11:53,897 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 06:11:53,897 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:11:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 06:11:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-01-25 06:11:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 06:11:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-25 06:11:53,905 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 31 [2018-01-25 06:11:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:53,906 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-25 06:11:53,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:11:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-25 06:11:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 06:11:53,906 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:53,907 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:53,907 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash 725932212, now seen corresponding path program 1 times [2018-01-25 06:11:53,907 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:53,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:53,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:53,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:53,908 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:53,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:54,108 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-25 06:11:54,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:54,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:11:54,109 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:54,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:11:54,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:11:54,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:11:54,110 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 9 states. [2018-01-25 06:11:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:54,375 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-01-25 06:11:54,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:11:54,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-25 06:11:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:54,376 INFO L225 Difference]: With dead ends: 58 [2018-01-25 06:11:54,376 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 06:11:54,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:11:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 06:11:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-01-25 06:11:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 06:11:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-25 06:11:54,383 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2018-01-25 06:11:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:54,383 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-25 06:11:54,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:11:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-25 06:11:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 06:11:54,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:54,384 INFO L322 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-25 06:11:54,385 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2094593310, now seen corresponding path program 1 times [2018-01-25 06:11:54,385 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:54,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:54,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:54,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:54,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:54,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:54,451 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-25 06:11:54,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:54,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:11:54,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:54,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:11:54,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:11:54,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:11:54,452 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2018-01-25 06:11:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:54,551 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-01-25 06:11:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:11:54,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-25 06:11:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:54,552 INFO L225 Difference]: With dead ends: 80 [2018-01-25 06:11:54,552 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 06:11:54,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:11:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 06:11:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-01-25 06:11:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 06:11:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-25 06:11:54,562 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2018-01-25 06:11:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:54,563 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-25 06:11:54,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:11:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-25 06:11:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:11:54,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:54,564 INFO L322 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-25 06:11:54,564 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1386851478, now seen corresponding path program 1 times [2018-01-25 06:11:54,565 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:54,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:54,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:54,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:54,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:54,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:54,898 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-25 06:11:54,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:54,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:11:54,898 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:54,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:11:54,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:11:54,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:11:54,899 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 9 states. [2018-01-25 06:11:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:55,167 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-25 06:11:55,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:11:55,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-25 06:11:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:55,168 INFO L225 Difference]: With dead ends: 65 [2018-01-25 06:11:55,168 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 06:11:55,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:11:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 06:11:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 06:11:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 06:11:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-01-25 06:11:55,176 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 35 [2018-01-25 06:11:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:55,177 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-01-25 06:11:55,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:11:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-01-25 06:11:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 06:11:55,178 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:55,178 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:55,178 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935703, now seen corresponding path program 1 times [2018-01-25 06:11:55,179 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:55,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:55,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:55,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:55,180 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:55,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:55,257 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-25 06:11:55,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:55,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:11:55,257 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:55,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:11:55,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:11:55,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:11:55,258 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 7 states. [2018-01-25 06:11:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:55,311 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-01-25 06:11:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:11:55,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-25 06:11:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:55,312 INFO L225 Difference]: With dead ends: 54 [2018-01-25 06:11:55,312 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 06:11:55,313 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:11:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 06:11:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-01-25 06:11:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 06:11:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-01-25 06:11:55,318 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 39 [2018-01-25 06:11:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:55,319 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-01-25 06:11:55,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:11:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-01-25 06:11:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 06:11:55,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:55,320 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:55,320 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:55,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935704, now seen corresponding path program 1 times [2018-01-25 06:11:55,320 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:55,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:55,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:55,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:55,322 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:55,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:55,473 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-25 06:11:55,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:55,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:11:55,474 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:55,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:11:55,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:11:55,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:11:55,474 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-01-25 06:11:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:55,542 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-01-25 06:11:55,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:11:55,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-01-25 06:11:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:55,543 INFO L225 Difference]: With dead ends: 52 [2018-01-25 06:11:55,543 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 06:11:55,544 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:11:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 06:11:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 06:11:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 06:11:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-01-25 06:11:55,549 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 39 [2018-01-25 06:11:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:55,549 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-01-25 06:11:55,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:11:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-01-25 06:11:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 06:11:55,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:55,550 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:55,550 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502653, now seen corresponding path program 1 times [2018-01-25 06:11:55,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:55,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:55,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:55,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:55,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:55,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:55,687 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-25 06:11:55,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:55,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 06:11:55,687 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:55,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 06:11:55,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 06:11:55,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:11:55,688 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 12 states. [2018-01-25 06:11:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:55,773 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-01-25 06:11:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:11:55,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-01-25 06:11:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:55,787 INFO L225 Difference]: With dead ends: 51 [2018-01-25 06:11:55,787 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 06:11:55,788 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:11:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 06:11:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 06:11:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 06:11:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-01-25 06:11:55,792 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 40 [2018-01-25 06:11:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:55,793 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-01-25 06:11:55,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 06:11:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-01-25 06:11:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 06:11:55,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:55,793 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:55,793 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:55,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502652, now seen corresponding path program 1 times [2018-01-25 06:11:55,794 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:55,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:55,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:55,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:55,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:55,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:55,920 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-25 06:11:55,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:55,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 06:11:55,921 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:55,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 06:11:55,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 06:11:55,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:11:55,921 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 12 states. [2018-01-25 06:11:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:56,049 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-01-25 06:11:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:11:56,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-01-25 06:11:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:56,050 INFO L225 Difference]: With dead ends: 51 [2018-01-25 06:11:56,050 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 06:11:56,051 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:11:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 06:11:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-25 06:11:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 06:11:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-01-25 06:11:56,058 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 40 [2018-01-25 06:11:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:56,058 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-01-25 06:11:56,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 06:11:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-01-25 06:11:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:11:56,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:56,059 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:56,059 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 901697635, now seen corresponding path program 1 times [2018-01-25 06:11:56,060 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:56,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:56,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:56,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:56,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:56,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:11:56,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:56,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:11:56,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:56,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:11:56,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:11:56,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:11:56,103 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2018-01-25 06:11:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:56,116 INFO L93 Difference]: Finished difference Result 55 states and 54 transitions. [2018-01-25 06:11:56,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:11:56,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-25 06:11:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:56,117 INFO L225 Difference]: With dead ends: 55 [2018-01-25 06:11:56,117 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 06:11:56,117 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:11:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 06:11:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 06:11:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 06:11:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-01-25 06:11:56,123 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 41 [2018-01-25 06:11:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:56,124 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-01-25 06:11:56,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:11:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-01-25 06:11:56,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-25 06:11:56,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:56,124 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:56,124 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 06:11:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1792979891, now seen corresponding path program 1 times [2018-01-25 06:11:56,125 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:56,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:56,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:56,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:56,126 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:56,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:56,451 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-25 06:11:56,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:56,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 06:11:56,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:56,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:11:56,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:11:56,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:11:56,452 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 15 states. [2018-01-25 06:11:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:56,959 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-01-25 06:11:56,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:11:56,960 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-01-25 06:11:56,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:56,960 INFO L225 Difference]: With dead ends: 49 [2018-01-25 06:11:56,960 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 06:11:56,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-01-25 06:11:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 06:11:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 06:11:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 06:11:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 06:11:56,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-01-25 06:11:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:56,961 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 06:11:56,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:11:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 06:11:56,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 06:11:56,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 06:11:57,420 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-25 06:11:57,420 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,421 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-25 06:11:57,421 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,422 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1476) the Hoare annotation is: true [2018-01-25 06:11:57,422 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,422 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1474 1476) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-25 06:11:57,422 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1474 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,422 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1474 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,422 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1474 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,422 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,422 INFO L397 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (not (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)) 1)) (not (= (select |old(#valid)| |disconnect_6_#in~a.base|) 1)) (not (= 0 |disconnect_6_#in~a.offset|)) (not (= 0 (select (select |#memory_$Pointer$.offset| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|))) (< (select |#length| |disconnect_6_#in~a.base|) 4)) [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err1RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err3RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err2RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-25 06:11:57,423 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1466 1472) no Hoare annotation was computed. [2018-01-25 06:11:57,424 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-25 06:11:57,424 INFO L397 ceAbstractionStarter]: At program point L1470(line 1470) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |entry_point_~#a7~11.base|) |entry_point_~#a7~11.offset|))) (let ((.cse1 (select |old(#valid)| |entry_point_~#a7~11.base|)) (.cse2 (select |old(#valid)| .cse0))) (and (<= 4 (select |#length| |entry_point_~#a7~11.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a7~11.base|) |entry_point_~#a7~11.offset|)) (= 1 (select |#valid| .cse0)) (= 0 .cse1) (= 0 |entry_point_~#a7~11.offset|) (= (store (store |#valid| .cse0 .cse2) |entry_point_~#a7~11.base| .cse1) |old(#valid)|) (= 0 .cse2) (not (= 0 .cse0)) (not (= |entry_point_~#a7~11.base| .cse0)) (= 1 (select |#valid| |entry_point_~#a7~11.base|)) (= entry_point_~ret~11 0)))) [2018-01-25 06:11:57,424 INFO L401 ceAbstractionStarter]: For program point L1469'(lines 1469 1471) no Hoare annotation was computed. [2018-01-25 06:11:57,424 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1466 1472) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-25 06:11:57,424 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-25 06:11:57,424 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1466 1472) no Hoare annotation was computed. [2018-01-25 06:11:57,424 INFO L397 ceAbstractionStarter]: At program point L1467(line 1467) the Hoare annotation is: (let ((.cse0 (@diff |old(#length)| |#length|))) (and (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (= 0 |entry_point_~#a7~11.offset|) (= 4 (select |#length| |entry_point_~#a7~11.base|)) (= (select |old(#valid)| |entry_point_~#a7~11.base|) 0) (= 1 (select |#valid| |entry_point_~#a7~11.base|)) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) [2018-01-25 06:11:57,425 INFO L401 ceAbstractionStarter]: For program point L1468(line 1468) no Hoare annotation was computed. [2018-01-25 06:11:57,425 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-25 06:11:57,425 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-25 06:11:57,425 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-25 06:11:57,425 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-25 06:11:57,425 INFO L401 ceAbstractionStarter]: For program point probe1_6Err1RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,425 INFO L397 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (= 1 (select |#valid| probe1_6_~a.base)) (= (store |#valid| probe1_6_~p~9.base 0) |old(#valid)|) (not (= 0 probe1_6_~p~9.base)) (<= (+ probe1_6_~ret~9 1) 0) (= 1 (select |#valid| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= (select |#length| probe1_6_~a.base) 4) (= probe1_6_~p~9.offset 0) (= probe1_6_~a.offset 0))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 06:11:57,425 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-25 06:11:57,425 INFO L397 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (not (= 0 probe1_6_~p~9.base)) (= 1 (select |#valid| probe1_6_~p~9.base)) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~p~9.offset 0) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 06:11:57,425 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L397 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point probe1_6Err2RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point probe1_6Err3RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L397 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: (or (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (and (= |#valid| |old(#valid)|) (= probe1_6_~a.base |probe1_6_#in~a.base|) (<= 3 probe1_6_~ret~9) (= probe1_6_~a.offset 0) (= |old(#length)| |#length|)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L397 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (not (= 0 probe1_6_~p~9.base)) (= 1 (select |#valid| probe1_6_~p~9.base)) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (<= 3 probe1_6_~ret~9) (= probe1_6_~p~9.offset 0) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-25 06:11:57,426 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-25 06:11:57,427 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-25 06:11:57,430 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:506) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:277) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:107) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:488) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:219) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-25 06:11:57,433 INFO L168 Benchmark]: Toolchain (without parser) took 6341.86 ms. Allocated memory was 308.3 MB in the beginning and 556.8 MB in the end (delta: 248.5 MB). Free memory was 267.3 MB in the beginning and 365.0 MB in the end (delta: -97.7 MB). Peak memory consumption was 150.8 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:57,434 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:11:57,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.96 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 253.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:57,435 INFO L168 Benchmark]: Boogie Preprocessor took 35.41 ms. Allocated memory is still 308.3 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:57,435 INFO L168 Benchmark]: RCFGBuilder took 280.73 ms. Allocated memory is still 308.3 MB. Free memory was 251.3 MB in the beginning and 232.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:57,435 INFO L168 Benchmark]: TraceAbstraction took 5787.33 ms. Allocated memory was 308.3 MB in the beginning and 556.8 MB in the end (delta: 248.5 MB). Free memory was 232.8 MB in the beginning and 365.0 MB in the end (delta: -132.3 MB). Peak memory consumption was 116.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:57,438 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.20 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.96 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 253.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.41 ms. Allocated memory is still 308.3 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 280.73 ms. Allocated memory is still 308.3 MB. Free memory was 251.3 MB in the beginning and 232.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5787.33 ms. Allocated memory was 308.3 MB in the beginning and 556.8 MB in the end (delta: 248.5 MB). Free memory was 232.8 MB in the beginning and 365.0 MB in the end (delta: -132.3 MB). Peak memory consumption was 116.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1474]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:506) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-11-57-445.csv Received shutdown request...