java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:02:57,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:02:57,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:02:57,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:02:57,103 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:02:57,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:02:57,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:02:57,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:02:57,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:02:57,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:02:57,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:02:57,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:02:57,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:02:57,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:02:57,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:02:57,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:02:57,119 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:02:57,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:02:57,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:02:57,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:02:57,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:02:57,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:02:57,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:02:57,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:02:57,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:02:57,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:02:57,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:02:57,130 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:02:57,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:02:57,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:02:57,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:02:57,132 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:02:57,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:02:57,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:02:57,143 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:02:57,143 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:02:57,143 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:02:57,144 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:02:57,144 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:02:57,144 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:02:57,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:02:57,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:02:57,145 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:02:57,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:02:57,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:02:57,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:02:57,146 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:02:57,146 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:02:57,146 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:02:57,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:02:57,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:02:57,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:02:57,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:02:57,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:02:57,147 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:02:57,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:02:57,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:02:57,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:02:57,148 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:02:57,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:02:57,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:02:57,149 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:02:57,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:02:57,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:02:57,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:02:57,149 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:02:57,150 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:02:57,151 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:02:57,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:02:57,197 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:02:57,201 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:02:57,203 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:02:57,203 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:02:57,204 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 06:02:57,402 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:02:57,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:02:57,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:02:57,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:02:57,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:02:57,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57, skipping insertion in model container [2018-01-25 06:02:57,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,429 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:02:57,477 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:02:57,587 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:02:57,604 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:02:57,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57 WrapperNode [2018-01-25 06:02:57,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:02:57,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:02:57,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:02:57,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:02:57,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (1/1) ... [2018-01-25 06:02:57,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:02:57,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:02:57,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:02:57,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:02:57,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:02:57,693 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:02:57,693 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:02:57,693 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:02:57,693 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-25 06:02:57,693 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-25 06:02:57,693 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-01-25 06:02:57,694 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-25 06:02:57,694 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:02:57,694 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:02:57,694 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:02:57,694 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:02:57,694 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:02:57,695 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:02:57,695 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:02:57,695 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:02:57,695 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:02:57,695 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:02:57,695 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:02:57,696 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-25 06:02:57,696 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-25 06:02:57,696 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-01-25 06:02:57,696 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-25 06:02:57,696 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:02:57,697 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:02:57,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:02:57,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:02:57,928 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:02:57,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:02:57 BoogieIcfgContainer [2018-01-25 06:02:57,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:02:57,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:02:57,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:02:57,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:02:57,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:02:57" (1/3) ... [2018-01-25 06:02:57,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f853f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:02:57, skipping insertion in model container [2018-01-25 06:02:57,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:02:57" (2/3) ... [2018-01-25 06:02:57,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f853f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:02:57, skipping insertion in model container [2018-01-25 06:02:57,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:02:57" (3/3) ... [2018-01-25 06:02:57,935 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-01-25 06:02:57,941 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:02:57,951 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 06:02:58,000 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:02:58,000 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:02:58,000 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:02:58,000 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:02:58,000 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:02:58,000 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:02:58,000 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:02:58,001 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:02:58,001 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:02:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-25 06:02:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 06:02:58,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:58,025 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 06:02:58,025 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 06:02:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash 3351521, now seen corresponding path program 1 times [2018-01-25 06:02:58,031 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:58,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:58,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:58,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:58,077 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:58,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:58,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:58,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:02:58,180 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:58,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:02:58,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:02:58,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:02:58,195 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2018-01-25 06:02:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:58,399 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-25 06:02:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:02:58,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 06:02:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:58,446 INFO L225 Difference]: With dead ends: 84 [2018-01-25 06:02:58,446 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 06:02:58,449 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 06:02:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 06:02:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-01-25 06:02:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 06:02:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 06:02:58,487 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 4 [2018-01-25 06:02:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:58,487 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 06:02:58,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:02:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 06:02:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 06:02:58,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:58,488 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 06:02:58,488 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 06:02:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash 3351522, now seen corresponding path program 1 times [2018-01-25 06:02:58,489 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:58,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:58,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:58,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:58,491 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:58,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:58,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:58,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:02:58,585 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:58,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:02:58,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:02:58,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:02:58,587 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-01-25 06:02:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:58,659 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-01-25 06:02:58,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:02:58,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 06:02:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:58,662 INFO L225 Difference]: With dead ends: 124 [2018-01-25 06:02:58,662 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 06:02:58,663 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 06:02:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 06:02:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2018-01-25 06:02:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 06:02:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-01-25 06:02:58,683 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 4 [2018-01-25 06:02:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:58,683 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-01-25 06:02:58,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:02:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-01-25 06:02:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:02:58,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:58,685 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 06:02:58,685 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 06:02:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash 312821243, now seen corresponding path program 1 times [2018-01-25 06:02:58,686 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:58,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:58,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:58,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:58,688 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:58,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:58,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:58,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:02:58,816 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:58,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:02:58,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:02:58,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:02:58,817 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2018-01-25 06:02:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:59,189 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2018-01-25 06:02:59,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:02:59,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 06:02:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:59,192 INFO L225 Difference]: With dead ends: 130 [2018-01-25 06:02:59,192 INFO L226 Difference]: Without dead ends: 124 [2018-01-25 06:02:59,193 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 06:02:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-25 06:02:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2018-01-25 06:02:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 06:02:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2018-01-25 06:02:59,210 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 24 [2018-01-25 06:02:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:59,211 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2018-01-25 06:02:59,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:02:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-01-25 06:02:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:02:59,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:59,212 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 06:02:59,212 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 06:02:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash 312821244, now seen corresponding path program 1 times [2018-01-25 06:02:59,213 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:59,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:59,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,215 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:59,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:59,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:59,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:02:59,308 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:59,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:02:59,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:02:59,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:02:59,310 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand 6 states. [2018-01-25 06:02:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:59,378 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2018-01-25 06:02:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:02:59,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 06:02:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:59,380 INFO L225 Difference]: With dead ends: 134 [2018-01-25 06:02:59,381 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 06:02:59,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:02:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 06:02:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-01-25 06:02:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-25 06:02:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-01-25 06:02:59,396 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 24 [2018-01-25 06:02:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:59,396 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-01-25 06:02:59,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:02:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-01-25 06:02:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:02:59,398 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:59,398 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 06:02:59,398 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 06:02:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1854259380, now seen corresponding path program 1 times [2018-01-25 06:02:59,399 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:59,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:59,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,401 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:59,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:59,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:59,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:02:59,485 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:59,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:02:59,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:02:59,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:02:59,486 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 5 states. [2018-01-25 06:02:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:59,516 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-25 06:02:59,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:02:59,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 06:02:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:59,518 INFO L225 Difference]: With dead ends: 117 [2018-01-25 06:02:59,518 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 06:02:59,518 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:02:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 06:02:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-25 06:02:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 06:02:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-01-25 06:02:59,524 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 24 [2018-01-25 06:02:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:59,524 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-01-25 06:02:59,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:02:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-01-25 06:02:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:02:59,525 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:59,525 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 06:02:59,525 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 06:02:59,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1628417000, now seen corresponding path program 1 times [2018-01-25 06:02:59,526 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:59,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:59,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:59,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:59,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:59,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:02:59,592 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:59,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:02:59,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:02:59,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:02:59,593 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-01-25 06:02:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:59,629 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-01-25 06:02:59,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:02:59,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 06:02:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:59,630 INFO L225 Difference]: With dead ends: 74 [2018-01-25 06:02:59,631 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 06:02:59,631 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:02:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 06:02:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 06:02:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 06:02:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-01-25 06:02:59,639 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 24 [2018-01-25 06:02:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:59,639 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-01-25 06:02:59,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:02:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-01-25 06:02:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:02:59,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:59,640 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 06:02:59,640 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 06:02:59,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961130, now seen corresponding path program 1 times [2018-01-25 06:02:59,641 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:59,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:59,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,642 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:59,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:59,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:59,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:02:59,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:59,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:02:59,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:02:59,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:02:59,736 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 6 states. [2018-01-25 06:02:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:59,790 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-01-25 06:02:59,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:02:59,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 06:02:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:59,791 INFO L225 Difference]: With dead ends: 64 [2018-01-25 06:02:59,791 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 06:02:59,792 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:02:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 06:02:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-25 06:02:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 06:02:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-01-25 06:02:59,798 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 26 [2018-01-25 06:02:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:59,798 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-01-25 06:02:59,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:02:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-01-25 06:02:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:02:59,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:59,800 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 06:02:59,800 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 06:02:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961129, now seen corresponding path program 1 times [2018-01-25 06:02:59,800 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:59,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:59,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:59,802 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:59,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:59,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:59,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:02:59,870 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:59,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:02:59,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:02:59,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:02:59,871 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2018-01-25 06:02:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:59,998 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-01-25 06:02:59,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:02:59,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 06:02:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:59,999 INFO L225 Difference]: With dead ends: 62 [2018-01-25 06:02:59,999 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 06:02:59,999 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:02:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 06:03:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 06:03:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 06:03:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-25 06:03:00,005 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 26 [2018-01-25 06:03:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:03:00,005 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-25 06:03:00,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:03:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-25 06:03:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 06:03:00,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:03:00,007 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 06:03:00,007 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 06:03:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash -903148600, now seen corresponding path program 1 times [2018-01-25 06:03:00,007 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:03:00,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:00,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:03:00,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:00,009 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:03:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:03:00,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:03:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:03:00,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:03:00,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:03:00,200 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:03:00,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:03:00,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:03:00,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:03:00,201 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 8 states. [2018-01-25 06:03:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:03:00,506 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-25 06:03:00,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:03:00,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 06:03:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:03:00,507 INFO L225 Difference]: With dead ends: 60 [2018-01-25 06:03:00,507 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 06:03:00,507 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 06:03:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 06:03:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 06:03:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 06:03:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-25 06:03:00,512 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 32 [2018-01-25 06:03:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:03:00,512 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-25 06:03:00,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:03:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-25 06:03:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 06:03:00,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:03:00,514 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 06:03:00,514 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 06:03:00,514 INFO L82 PathProgramCache]: Analyzing trace with hash -903148599, now seen corresponding path program 1 times [2018-01-25 06:03:00,514 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:03:00,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:00,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:03:00,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:00,515 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:03:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:03:00,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:03:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:03:00,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:03:00,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:03:00,670 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:03:00,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:03:00,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:03:00,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:03:00,671 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 10 states. [2018-01-25 06:03:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:03:01,087 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-01-25 06:03:01,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:03:01,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-25 06:03:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:03:01,091 INFO L225 Difference]: With dead ends: 59 [2018-01-25 06:03:01,091 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 06:03:01,092 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 06:03:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 06:03:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 06:03:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 06:03:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-25 06:03:01,098 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 32 [2018-01-25 06:03:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:03:01,099 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-25 06:03:01,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:03:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-25 06:03:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 06:03:01,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:03:01,100 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 06:03:01,100 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 06:03:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1666277088, now seen corresponding path program 1 times [2018-01-25 06:03:01,101 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:03:01,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:01,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:03:01,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:01,102 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:03:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:03:01,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:03:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:03:01,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:03:01,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:03:01,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:03:01,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:03:01,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:03:01,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:03:01,265 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-01-25 06:03:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:03:01,600 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-01-25 06:03:01,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:03:01,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 06:03:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:03:01,601 INFO L225 Difference]: With dead ends: 63 [2018-01-25 06:03:01,601 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 06:03:01,601 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:03:01,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 06:03:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 06:03:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 06:03:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-25 06:03:01,607 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-01-25 06:03:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:03:01,607 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-25 06:03:01,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:03:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-25 06:03:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:03:01,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:03:01,609 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 06:03:01,609 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 06:03:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 730447574, now seen corresponding path program 1 times [2018-01-25 06:03:01,609 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:03:01,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:01,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:03:01,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:01,611 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:03:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:03:01,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:03:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:03:01,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:03:01,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:03:01,659 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:03:01,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:03:01,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:03:01,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:03:01,660 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 6 states. [2018-01-25 06:03:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:03:01,716 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-01-25 06:03:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:03:01,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-25 06:03:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:03:01,717 INFO L225 Difference]: With dead ends: 78 [2018-01-25 06:03:01,717 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 06:03:01,717 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:03:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 06:03:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 06:03:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 06:03:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 54 transitions. [2018-01-25 06:03:01,723 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 54 transitions. Word has length 34 [2018-01-25 06:03:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:03:01,723 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 54 transitions. [2018-01-25 06:03:01,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:03:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 54 transitions. [2018-01-25 06:03:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:03:01,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:03:01,724 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:03:01,724 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 06:03:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash -294666985, now seen corresponding path program 1 times [2018-01-25 06:03:01,724 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:03:01,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:01,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:03:01,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:01,725 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:03:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:03:01,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:03:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:03:01,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:03:01,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 06:03:01,970 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:03:01,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:03:01,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:03:01,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:03:01,971 INFO L87 Difference]: Start difference. First operand 55 states and 54 transitions. Second operand 13 states. [2018-01-25 06:03:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:03:02,268 INFO L93 Difference]: Finished difference Result 55 states and 54 transitions. [2018-01-25 06:03:02,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 06:03:02,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-01-25 06:03:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:03:02,269 INFO L225 Difference]: With dead ends: 55 [2018-01-25 06:03:02,269 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 06:03:02,270 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 06:03:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 06:03:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 06:03:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 06:03:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 53 transitions. [2018-01-25 06:03:02,275 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 53 transitions. Word has length 41 [2018-01-25 06:03:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:03:02,275 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 53 transitions. [2018-01-25 06:03:02,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:03:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2018-01-25 06:03:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:03:02,276 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:03:02,276 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:03:02,276 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 06:03:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash -294666984, now seen corresponding path program 1 times [2018-01-25 06:03:02,277 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:03:02,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:02,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:03:02,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:02,278 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:03:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:03:02,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:03:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:03:02,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:03:02,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:03:02,403 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:03:02,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:03:02,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:03:02,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:03:02,404 INFO L87 Difference]: Start difference. First operand 54 states and 53 transitions. Second operand 8 states. [2018-01-25 06:03:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:03:02,522 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2018-01-25 06:03:02,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:03:02,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-01-25 06:03:02,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:03:02,523 INFO L225 Difference]: With dead ends: 54 [2018-01-25 06:03:02,523 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 06:03:02,524 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 06:03:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 06:03:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 06:03:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 06:03:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 52 transitions. [2018-01-25 06:03:02,532 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 52 transitions. Word has length 41 [2018-01-25 06:03:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:03:02,532 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 52 transitions. [2018-01-25 06:03:02,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:03:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 52 transitions. [2018-01-25 06:03:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:03:02,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:03:02,533 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 06:03:02,533 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 06:03:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash -544741945, now seen corresponding path program 1 times [2018-01-25 06:03:02,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:03:02,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:02,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:03:02,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:02,535 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:03:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:03:02,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:03:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:03:02,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:03:02,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 06:03:02,644 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:03:02,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 06:03:02,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 06:03:02,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:03:02,645 INFO L87 Difference]: Start difference. First operand 53 states and 52 transitions. Second operand 12 states. [2018-01-25 06:03:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:03:02,858 INFO L93 Difference]: Finished difference Result 53 states and 52 transitions. [2018-01-25 06:03:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:03:02,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-01-25 06:03:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:03:02,860 INFO L225 Difference]: With dead ends: 53 [2018-01-25 06:03:02,860 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 06:03:02,860 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:03:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 06:03:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 06:03:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 06:03:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2018-01-25 06:03:02,869 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 42 [2018-01-25 06:03:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:03:02,869 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2018-01-25 06:03:02,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 06:03:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2018-01-25 06:03:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:03:02,870 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:03:02,870 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 06:03:02,871 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 06:03:02,871 INFO L82 PathProgramCache]: Analyzing trace with hash -544741944, now seen corresponding path program 1 times [2018-01-25 06:03:02,871 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:03:02,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:02,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:03:02,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:03:02,872 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:03:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 06:03:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 06:03:02,936 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 06:03:02,959 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 06:03:02,960 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 06:03:02,962 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 06:03:02,962 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 06:03:02,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:03:02 BoogieIcfgContainer [2018-01-25 06:03:02,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:03:02,978 INFO L168 Benchmark]: Toolchain (without parser) took 5576.27 ms. Allocated memory was 303.0 MB in the beginning and 518.5 MB in the end (delta: 215.5 MB). Free memory was 262.1 MB in the beginning and 312.7 MB in the end (delta: -50.6 MB). Peak memory consumption was 164.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:03:02,980 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:03:02,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.45 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 248.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-25 06:03:02,980 INFO L168 Benchmark]: Boogie Preprocessor took 34.48 ms. Allocated memory is still 303.0 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:03:02,981 INFO L168 Benchmark]: RCFGBuilder took 280.65 ms. Allocated memory is still 303.0 MB. Free memory was 246.7 MB in the beginning and 227.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-25 06:03:02,981 INFO L168 Benchmark]: TraceAbstraction took 5047.86 ms. Allocated memory was 303.0 MB in the beginning and 518.5 MB in the end (delta: 215.5 MB). Free memory was 227.1 MB in the beginning and 312.7 MB in the end (delta: -85.6 MB). Peak memory consumption was 129.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:03:02,983 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.18 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.45 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 248.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.48 ms. Allocated memory is still 303.0 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 280.65 ms. Allocated memory is still 303.0 MB. Free memory was 246.7 MB in the beginning and 227.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5047.86 ms. Allocated memory was 303.0 MB in the beginning and 518.5 MB in the end (delta: 215.5 MB). Free memory was 227.1 MB in the beginning and 312.7 MB in the end (delta: -85.6 MB). Peak memory consumption was 129.9 MB. 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, 4.9s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 2.8s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.6s 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.4s 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-03-02-991.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-03-02-991.csv Received shutdown request...