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_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:26:46,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:26:46,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:26:46,840 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:26:46,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:26:46,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:26:46,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:26:46,844 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:26:46,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:26:46,847 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:26:46,848 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:26:46,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:26:46,850 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:26:46,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:26:46,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:26:46,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:26:46,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:26:46,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:26:46,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:26:46,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:26:46,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:26:46,865 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:26:46,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:26:46,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:26:46,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:26:46,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:26:46,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:26:46,870 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:26:46,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:26:46,870 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:26:46,871 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:26:46,872 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_preciseopt.epf [2018-01-25 03:26:46,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:26:46,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:26:46,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:26:46,882 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:26:46,882 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:26:46,882 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:26:46,882 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:26:46,883 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:26:46,883 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:26:46,883 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:26:46,884 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:26:46,884 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:26:46,884 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:26:46,884 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:26:46,884 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:26:46,884 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:26:46,885 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:26:46,885 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:26:46,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:26:46,885 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:26:46,885 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:26:46,885 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:26:46,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:26:46,886 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:26:46,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:26:46,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:26:46,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:26:46,887 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:26:46,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:26:46,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:26:46,887 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:26:46,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:26:46,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:26:46,887 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:26:46,887 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:26:46,888 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:26:46,888 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:26:46,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:26:46,936 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:26:46,940 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:26:46,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:26:46,941 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:26:46,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i [2018-01-25 03:26:47,145 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:26:47,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:26:47,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:26:47,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:26:47,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:26:47,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388a8c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47, skipping insertion in model container [2018-01-25 03:26:47,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,175 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:26:47,225 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:26:47,348 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:26:47,371 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:26:47,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47 WrapperNode [2018-01-25 03:26:47,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:26:47,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:26:47,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:26:47,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:26:47,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (1/1) ... [2018-01-25 03:26:47,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:26:47,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:26:47,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:26:47,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:26:47,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (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 03:26:47,470 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:26:47,470 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:26:47,470 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:26:47,470 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-25 03:26:47,470 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-25 03:26:47,470 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-01-25 03:26:47,471 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-25 03:26:47,471 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:26:47,471 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:26:47,471 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:26:47,471 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:26:47,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:26:47,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:26:47,471 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:26:47,471 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:26:47,472 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:26:47,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:26:47,734 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:26:47,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:26:47 BoogieIcfgContainer [2018-01-25 03:26:47,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:26:47,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:26:47,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:26:47,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:26:47,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:26:47" (1/3) ... [2018-01-25 03:26:47,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b432bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:26:47, skipping insertion in model container [2018-01-25 03:26:47,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:26:47" (2/3) ... [2018-01-25 03:26:47,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b432bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:26:47, skipping insertion in model container [2018-01-25 03:26:47,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:26:47" (3/3) ... [2018-01-25 03:26:47,741 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-01-25 03:26:47,747 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:26:47,754 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 03:26:47,805 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:26:47,805 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:26:47,805 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:26:47,806 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:26:47,806 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:26:47,806 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:26:47,806 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:26:47,806 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:26:47,807 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:26:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-25 03:26:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 03:26:47,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:47,828 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 03:26:47,828 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash 3351521, now seen corresponding path program 1 times [2018-01-25 03:26:47,834 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:47,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:47,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:47,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:47,881 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:47,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:47,979 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 03:26:47,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:47,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:26:47,982 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:47,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:26:48,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:26:48,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:26:48,004 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2018-01-25 03:26:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:48,223 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-25 03:26:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:26:48,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 03:26:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:48,237 INFO L225 Difference]: With dead ends: 84 [2018-01-25 03:26:48,237 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 03:26:48,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:26:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 03:26:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-01-25 03:26:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 03:26:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 03:26:48,280 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 4 [2018-01-25 03:26:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:48,281 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 03:26:48,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:26:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 03:26:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 03:26:48,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:48,282 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 03:26:48,282 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash 3351522, now seen corresponding path program 1 times [2018-01-25 03:26:48,283 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:48,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:48,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:48,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:48,285 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:48,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:48,373 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 03:26:48,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:48,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:26:48,374 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:48,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:26:48,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:26:48,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:26:48,376 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-01-25 03:26:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:48,446 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-01-25 03:26:48,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:26:48,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 03:26:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:48,449 INFO L225 Difference]: With dead ends: 124 [2018-01-25 03:26:48,449 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 03:26:48,450 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:26:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 03:26:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2018-01-25 03:26:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 03:26:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-01-25 03:26:48,464 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 4 [2018-01-25 03:26:48,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:48,464 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-01-25 03:26:48,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:26:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-01-25 03:26:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:26:48,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:48,465 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] [2018-01-25 03:26:48,465 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:48,466 INFO L82 PathProgramCache]: Analyzing trace with hash 312821243, now seen corresponding path program 1 times [2018-01-25 03:26:48,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:48,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:48,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:48,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:48,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:48,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:48,600 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 03:26:48,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:48,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:26:48,601 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:48,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:26:48,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:26:48,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:26:48,602 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2018-01-25 03:26:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:48,865 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2018-01-25 03:26:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:26:48,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 03:26:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:48,867 INFO L225 Difference]: With dead ends: 130 [2018-01-25 03:26:48,867 INFO L226 Difference]: Without dead ends: 124 [2018-01-25 03:26:48,868 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:26:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-25 03:26:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2018-01-25 03:26:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 03:26:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2018-01-25 03:26:48,884 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 24 [2018-01-25 03:26:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:48,884 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2018-01-25 03:26:48,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:26:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-01-25 03:26:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:26:48,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:48,886 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] [2018-01-25 03:26:48,886 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash 312821244, now seen corresponding path program 1 times [2018-01-25 03:26:48,887 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:48,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:48,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:48,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:48,889 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:48,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:48,968 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 03:26:48,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:48,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:26:48,968 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:48,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:26:48,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:26:48,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:26:48,970 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand 6 states. [2018-01-25 03:26:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:49,034 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2018-01-25 03:26:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:26:49,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 03:26:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:49,035 INFO L225 Difference]: With dead ends: 134 [2018-01-25 03:26:49,036 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 03:26:49,036 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 03:26:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 03:26:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-01-25 03:26:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-25 03:26:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-01-25 03:26:49,050 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 24 [2018-01-25 03:26:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:49,051 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-01-25 03:26:49,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:26:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-01-25 03:26:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:26:49,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:49,053 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] [2018-01-25 03:26:49,053 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:49,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1854259380, now seen corresponding path program 1 times [2018-01-25 03:26:49,053 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:49,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:49,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:49,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:49,129 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 03:26:49,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:49,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:26:49,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:49,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:26:49,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:26:49,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:26:49,130 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 5 states. [2018-01-25 03:26:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:49,170 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-25 03:26:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:26:49,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 03:26:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:49,171 INFO L225 Difference]: With dead ends: 117 [2018-01-25 03:26:49,171 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 03:26:49,172 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 03:26:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 03:26:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-25 03:26:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 03:26:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-01-25 03:26:49,181 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 24 [2018-01-25 03:26:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:49,181 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-01-25 03:26:49,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:26:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-01-25 03:26:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:26:49,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:49,183 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] [2018-01-25 03:26:49,183 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:49,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1628417000, now seen corresponding path program 1 times [2018-01-25 03:26:49,183 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:49,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:49,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:49,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:49,250 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 03:26:49,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:49,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:26:49,251 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:49,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:26:49,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:26:49,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:26:49,251 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-01-25 03:26:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:49,282 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-01-25 03:26:49,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:26:49,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 03:26:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:49,284 INFO L225 Difference]: With dead ends: 74 [2018-01-25 03:26:49,284 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 03:26:49,284 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 03:26:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 03:26:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 03:26:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 03:26:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-01-25 03:26:49,292 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 24 [2018-01-25 03:26:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:49,292 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-01-25 03:26:49,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:26:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-01-25 03:26:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:26:49,293 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:49,294 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] [2018-01-25 03:26:49,294 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:49,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961130, now seen corresponding path program 1 times [2018-01-25 03:26:49,294 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:49,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:49,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:49,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:49,363 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 03:26:49,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:49,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:26:49,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:49,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:26:49,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:26:49,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:26:49,364 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 6 states. [2018-01-25 03:26:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:49,409 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-01-25 03:26:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:26:49,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 03:26:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:49,411 INFO L225 Difference]: With dead ends: 64 [2018-01-25 03:26:49,412 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 03:26:49,412 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 03:26:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 03:26:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-25 03:26:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 03:26:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-01-25 03:26:49,420 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 26 [2018-01-25 03:26:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:49,429 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-01-25 03:26:49,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:26:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-01-25 03:26:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:26:49,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:49,430 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] [2018-01-25 03:26:49,432 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961129, now seen corresponding path program 1 times [2018-01-25 03:26:49,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:49,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:49,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,435 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:49,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:49,504 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 03:26:49,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:49,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:26:49,505 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:49,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:26:49,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:26:49,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:26:49,506 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2018-01-25 03:26:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:49,587 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-01-25 03:26:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:26:49,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 03:26:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:49,589 INFO L225 Difference]: With dead ends: 62 [2018-01-25 03:26:49,589 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 03:26:49,589 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 03:26:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 03:26:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 03:26:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 03:26:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-25 03:26:49,596 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 26 [2018-01-25 03:26:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:49,597 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-25 03:26:49,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:26:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-25 03:26:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:26:49,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:49,598 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] [2018-01-25 03:26:49,598 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash -903148600, now seen corresponding path program 1 times [2018-01-25 03:26:49,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:49,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:49,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:49,601 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:49,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:49,784 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 03:26:49,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:49,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:26:49,785 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:49,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:26:49,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:26:49,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:26:49,785 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 8 states. [2018-01-25 03:26:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:50,080 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-25 03:26:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:26:50,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 03:26:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:50,081 INFO L225 Difference]: With dead ends: 60 [2018-01-25 03:26:50,081 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 03:26:50,082 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:26:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 03:26:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 03:26:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 03:26:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-25 03:26:50,088 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 32 [2018-01-25 03:26:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:50,088 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-25 03:26:50,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:26:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-25 03:26:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:26:50,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:50,090 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] [2018-01-25 03:26:50,090 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -903148599, now seen corresponding path program 1 times [2018-01-25 03:26:50,090 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:50,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:50,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:50,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:50,092 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:50,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:50,236 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 03:26:50,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:50,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:26:50,237 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:50,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:26:50,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:26:50,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:26:50,237 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 10 states. [2018-01-25 03:26:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:50,662 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-01-25 03:26:50,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 03:26:50,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-25 03:26:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:50,665 INFO L225 Difference]: With dead ends: 59 [2018-01-25 03:26:50,665 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 03:26:50,666 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:26:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 03:26:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 03:26:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 03:26:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-25 03:26:50,677 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 32 [2018-01-25 03:26:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:50,677 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-25 03:26:50,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:26:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-25 03:26:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:26:50,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:50,678 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] [2018-01-25 03:26:50,679 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1666277088, now seen corresponding path program 1 times [2018-01-25 03:26:50,679 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:50,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:50,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:50,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:50,681 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:50,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:50,865 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 03:26:50,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:50,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:26:50,865 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:50,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:26:50,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:26:50,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:26:50,866 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-01-25 03:26:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:51,343 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-01-25 03:26:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:26:51,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 03:26:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:51,457 INFO L225 Difference]: With dead ends: 63 [2018-01-25 03:26:51,457 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 03:26:51,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:26:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 03:26:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 03:26:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 03:26:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-25 03:26:51,468 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-01-25 03:26:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:51,469 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-25 03:26:51,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:26:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-25 03:26:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:26:51,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:51,470 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] [2018-01-25 03:26:51,470 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash 730447574, now seen corresponding path program 1 times [2018-01-25 03:26:51,470 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:51,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:51,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:51,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:51,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:51,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:51,683 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 03:26:51,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:51,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:26:51,683 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:51,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:26:51,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:26:51,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:26:51,684 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 6 states. [2018-01-25 03:26:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:51,740 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-01-25 03:26:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:26:51,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-25 03:26:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:51,742 INFO L225 Difference]: With dead ends: 78 [2018-01-25 03:26:51,742 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 03:26:51,742 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:26:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 03:26:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 03:26:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 03:26:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 54 transitions. [2018-01-25 03:26:51,748 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 54 transitions. Word has length 34 [2018-01-25 03:26:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:51,748 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 54 transitions. [2018-01-25 03:26:51,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:26:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 54 transitions. [2018-01-25 03:26:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 03:26:51,749 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:51,750 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 03:26:51,750 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash -294666985, now seen corresponding path program 1 times [2018-01-25 03:26:51,750 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:51,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:51,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:51,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:51,752 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:51,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:51,965 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 03:26:51,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:51,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 03:26:51,966 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:51,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:26:51,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:26:51,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:26:51,967 INFO L87 Difference]: Start difference. First operand 55 states and 54 transitions. Second operand 13 states. [2018-01-25 03:26:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:52,306 INFO L93 Difference]: Finished difference Result 55 states and 54 transitions. [2018-01-25 03:26:52,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 03:26:52,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-01-25 03:26:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:52,307 INFO L225 Difference]: With dead ends: 55 [2018-01-25 03:26:52,307 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 03:26:52,308 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-01-25 03:26:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 03:26:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 03:26:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 03:26:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 53 transitions. [2018-01-25 03:26:52,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 53 transitions. Word has length 41 [2018-01-25 03:26:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:52,313 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 53 transitions. [2018-01-25 03:26:52,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:26:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2018-01-25 03:26:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 03:26:52,314 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:52,314 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 03:26:52,314 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash -294666984, now seen corresponding path program 1 times [2018-01-25 03:26:52,314 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:52,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:52,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:52,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:52,316 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:52,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:52,498 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 03:26:52,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:52,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:26:52,499 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:52,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:26:52,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:26:52,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:26:52,499 INFO L87 Difference]: Start difference. First operand 54 states and 53 transitions. Second operand 8 states. [2018-01-25 03:26:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:52,648 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2018-01-25 03:26:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:26:52,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-01-25 03:26:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:52,649 INFO L225 Difference]: With dead ends: 54 [2018-01-25 03:26:52,649 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 03:26:52,649 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:26:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 03:26:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 03:26:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 03:26:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 52 transitions. [2018-01-25 03:26:52,658 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 52 transitions. Word has length 41 [2018-01-25 03:26:52,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:52,658 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 52 transitions. [2018-01-25 03:26:52,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:26:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 52 transitions. [2018-01-25 03:26:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 03:26:52,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:52,660 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] [2018-01-25 03:26:52,660 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -544741945, now seen corresponding path program 1 times [2018-01-25 03:26:52,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:52,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:52,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:52,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:52,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:52,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:53,115 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 03:26:53,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:53,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 03:26:53,115 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:53,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:26:53,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:26:53,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:26:53,116 INFO L87 Difference]: Start difference. First operand 53 states and 52 transitions. Second operand 12 states. [2018-01-25 03:26:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:53,758 INFO L93 Difference]: Finished difference Result 53 states and 52 transitions. [2018-01-25 03:26:53,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:26:53,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-01-25 03:26:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:53,759 INFO L225 Difference]: With dead ends: 53 [2018-01-25 03:26:53,759 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 03:26:53,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-01-25 03:26:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 03:26:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 03:26:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 03:26:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2018-01-25 03:26:53,768 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 42 [2018-01-25 03:26:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:53,768 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2018-01-25 03:26:53,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:26:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2018-01-25 03:26:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 03:26:53,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:53,769 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] [2018-01-25 03:26:53,769 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:26:53,770 INFO L82 PathProgramCache]: Analyzing trace with hash -544741944, now seen corresponding path program 1 times [2018-01-25 03:26:53,770 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:53,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:53,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:53,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:53,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 03:26:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 03:26:53,850 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 03:26:53,885 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 03:26:53,887 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 03:26:53,888 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 03:26:53,888 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 03:26:53,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:26:53 BoogieIcfgContainer [2018-01-25 03:26:53,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:26:53,910 INFO L168 Benchmark]: Toolchain (without parser) took 6764.14 ms. Allocated memory was 306.7 MB in the beginning and 546.3 MB in the end (delta: 239.6 MB). Free memory was 264.0 MB in the beginning and 487.5 MB in the end (delta: -223.5 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:26:53,911 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:26:53,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.58 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 250.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-25 03:26:53,912 INFO L168 Benchmark]: Boogie Preprocessor took 36.94 ms. Allocated memory is still 306.7 MB. Free memory was 250.6 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:26:53,912 INFO L168 Benchmark]: RCFGBuilder took 315.78 ms. Allocated memory is still 306.7 MB. Free memory was 248.6 MB in the beginning and 229.0 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:26:53,912 INFO L168 Benchmark]: TraceAbstraction took 6173.31 ms. Allocated memory was 306.7 MB in the beginning and 546.3 MB in the end (delta: 239.6 MB). Free memory was 229.0 MB in the beginning and 487.5 MB in the end (delta: -258.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:26:53,914 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.16 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.58 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 250.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.94 ms. Allocated memory is still 306.7 MB. Free memory was 250.6 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 315.78 ms. Allocated memory is still 306.7 MB. Free memory was 248.6 MB in the beginning and 229.0 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6173.31 ms. Allocated memory was 306.7 MB in the beginning and 546.3 MB in the end (delta: 239.6 MB). Free memory was 229.0 MB in the beginning and 487.5 MB in the end (delta: -258.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1468] FCALL struct A a6; VAL [a6={9:0}] [L1480] CALL entry_point() VAL [a6={9:0}] [L1472] CALL, EXPR probe3_6(&a6) VAL [a={9:0}, a6={9:0}] [L1444] int ret = - -3; VAL [a={9:0}, a={9:0}, a6={9:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={9:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={9:0}, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={7:0}, a6={9:0}, malloc(size)={7:0}, size=4] [L1445] EXPR ldv_malloc(sizeof(int)) VAL [a={9:0}, a={9:0}, a6={9:0}, ldv_malloc(sizeof(int))={7:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); [L1446] COND FALSE !(p==0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={9:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1448] EXPR f6() VAL [a={9:0}, a={9:0}, a6={9:0}, f6()=0, p={7:0}, ret=3] [L1448] ret = f6() [L1449] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={9:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1451] EXPR g6() VAL [a={9:0}, a={9:0}, a6={9:0}, g6()=0, p={7:0}, ret=0] [L1451] ret = g6() [L1452] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1454] FCALL a->p = p VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1455] FCALL free(p) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1456] RET return 0; VAL [\result=0, a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1472] EXPR probe3_6(&a6) VAL [a6={9:0}, probe3_6(&a6)=0] [L1472] int ret = probe3_6(&a6); [L1473] COND TRUE ret==0 VAL [a6={9:0}, ret=0] [L1474] CALL disconnect_6(&a6) VAL [a={9:0}, a6={9:0}] [L1464] EXPR, FCALL a->p VAL [a={9:0}, a={9:0}, a->p={7:0}, a6={9:0}] [L1464] FCALL free(a->p) VAL [a={9:0}, a={9:0}, a->p={7:0}, a6={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 69 locations, 15 error locations. UNSAFE Result, 6.1s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 751 SDtfs, 711 SDslu, 2167 SDs, 0 SdLazy, 1396 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 64722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-26-53-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-26-53-922.csv Received shutdown request...