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_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:06:47,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:06:47,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:06:47,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:06:47,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:06:47,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:06:47,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:06:47,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:06:47,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:06:47,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:06:47,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:06:47,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:06:47,469 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:06:47,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:06:47,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:06:47,474 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:06:47,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:06:47,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:06:47,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:06:47,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:06:47,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:06:47,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:06:47,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:06:47,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:06:47,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:06:47,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:06:47,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:06:47,488 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:06:47,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:06:47,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:06:47,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:06:47,489 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_precise.epf [2018-01-25 00:06:47,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:06:47,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:06:47,498 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:06:47,498 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:06:47,498 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:06:47,499 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:06:47,499 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:06:47,499 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:06:47,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:06:47,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:06:47,500 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:06:47,500 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:06:47,500 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:06:47,500 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:06:47,500 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:06:47,500 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:06:47,501 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:06:47,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:06:47,501 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:06:47,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:06:47,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:06:47,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:06:47,501 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:06:47,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:06:47,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:06:47,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:06:47,502 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:06:47,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:06:47,503 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:06:47,503 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:06:47,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:06:47,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:06:47,503 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:06:47,503 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:06:47,504 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:06:47,504 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:06:47,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:06:47,550 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:06:47,554 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:06:47,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:06:47,555 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:06:47,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-25 00:06:47,736 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:06:47,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:06:47,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:06:47,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:06:47,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:06:47,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:47,750 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 12:06:47, skipping insertion in model container [2018-01-25 00:06:47,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:47,764 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:06:47,813 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:06:47,935 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:06:47,956 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:06:47,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47 WrapperNode [2018-01-25 00:06:47,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:06:47,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:06:47,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:06:47,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:06:47,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:47,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:47,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:47,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:47,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:47,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:48,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (1/1) ... [2018-01-25 00:06:48,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:06:48,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:06:48,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:06:48,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:06:48,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:06:48,053 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:06:48,054 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:06:48,054 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:06:48,054 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-25 00:06:48,054 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-25 00:06:48,054 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-01-25 00:06:48,054 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-25 00:06:48,054 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:06:48,055 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:06:48,055 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:06:48,055 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:06:48,055 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:06:48,055 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:06:48,055 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:06:48,056 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:06:48,056 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:06:48,056 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:06:48,056 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:06:48,056 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-25 00:06:48,056 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-25 00:06:48,057 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-01-25 00:06:48,057 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-25 00:06:48,057 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:06:48,057 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:06:48,057 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:06:48,058 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:06:48,283 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:06:48,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:06:48 BoogieIcfgContainer [2018-01-25 00:06:48,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:06:48,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:06:48,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:06:48,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:06:48,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:06:47" (1/3) ... [2018-01-25 00:06:48,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd05304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:06:48, skipping insertion in model container [2018-01-25 00:06:48,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:47" (2/3) ... [2018-01-25 00:06:48,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd05304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:06:48, skipping insertion in model container [2018-01-25 00:06:48,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:06:48" (3/3) ... [2018-01-25 00:06:48,289 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-25 00:06:48,295 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:06:48,301 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 00:06:48,351 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:06:48,352 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:06:48,352 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:06:48,352 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:06:48,352 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:06:48,352 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:06:48,352 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:06:48,353 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:06:48,353 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:06:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-25 00:06:48,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 00:06:48,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:48,380 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 00:06:48,380 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash 3232357, now seen corresponding path program 1 times [2018-01-25 00:06:48,386 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:48,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:48,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:48,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:48,434 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:48,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:48,533 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 00:06:48,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:48,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:06:48,535 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:48,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:06:48,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:06:48,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:06:48,550 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-25 00:06:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:48,743 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-25 00:06:48,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:06:48,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 00:06:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:48,800 INFO L225 Difference]: With dead ends: 81 [2018-01-25 00:06:48,800 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 00:06:48,802 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 00:06:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 00:06:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-01-25 00:06:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 00:06:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-25 00:06:48,841 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-01-25 00:06:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:48,842 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-25 00:06:48,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:06:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-25 00:06:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 00:06:48,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:48,843 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 00:06:48,843 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:48,843 INFO L82 PathProgramCache]: Analyzing trace with hash 3232358, now seen corresponding path program 1 times [2018-01-25 00:06:48,843 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:48,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:48,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:48,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:48,846 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:48,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:48,919 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 00:06:48,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:48,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:06:48,920 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:48,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:06:48,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:06:48,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:06:48,922 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-01-25 00:06:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:49,000 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-01-25 00:06:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:06:49,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 00:06:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:49,002 INFO L225 Difference]: With dead ends: 118 [2018-01-25 00:06:49,002 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 00:06:49,003 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 00:06:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 00:06:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-01-25 00:06:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 00:06:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-01-25 00:06:49,015 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-01-25 00:06:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:49,015 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-01-25 00:06:49,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:06:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-01-25 00:06:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:06:49,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:49,016 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 00:06:49,016 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:49,016 INFO L82 PathProgramCache]: Analyzing trace with hash -293037669, now seen corresponding path program 1 times [2018-01-25 00:06:49,016 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:49,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:49,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,018 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:49,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:49,141 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 00:06:49,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:49,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:06:49,142 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:49,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:49,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:49,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:49,144 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-01-25 00:06:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:49,530 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2018-01-25 00:06:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 00:06:49,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 00:06:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:49,532 INFO L225 Difference]: With dead ends: 124 [2018-01-25 00:06:49,533 INFO L226 Difference]: Without dead ends: 118 [2018-01-25 00:06:49,533 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:06:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-25 00:06:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-25 00:06:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 00:06:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-01-25 00:06:49,545 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-01-25 00:06:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:49,545 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-01-25 00:06:49,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-01-25 00:06:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:06:49,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:49,546 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 00:06:49,547 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:49,547 INFO L82 PathProgramCache]: Analyzing trace with hash -293037668, now seen corresponding path program 1 times [2018-01-25 00:06:49,547 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:49,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:49,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,549 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:49,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:49,620 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 00:06:49,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:49,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:06:49,620 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:49,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:49,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:49,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:49,622 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-01-25 00:06:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:49,670 INFO L93 Difference]: Finished difference Result 145 states and 172 transitions. [2018-01-25 00:06:49,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:06:49,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 00:06:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:49,672 INFO L225 Difference]: With dead ends: 145 [2018-01-25 00:06:49,672 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 00:06:49,673 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 00:06:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 00:06:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-25 00:06:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 00:06:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-01-25 00:06:49,689 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-01-25 00:06:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:49,689 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-01-25 00:06:49,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-01-25 00:06:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:06:49,691 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:49,691 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 00:06:49,691 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2126392044, now seen corresponding path program 1 times [2018-01-25 00:06:49,692 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:49,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:49,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,694 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:49,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:49,770 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 00:06:49,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:49,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:06:49,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:49,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:06:49,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:06:49,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:06:49,772 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-01-25 00:06:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:49,793 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-25 00:06:49,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:06:49,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 00:06:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:49,795 INFO L225 Difference]: With dead ends: 125 [2018-01-25 00:06:49,795 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 00:06:49,795 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 00:06:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 00:06:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 00:06:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 00:06:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-01-25 00:06:49,802 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-01-25 00:06:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:49,802 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-01-25 00:06:49,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:06:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-01-25 00:06:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:06:49,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:49,803 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 00:06:49,803 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1815899569, now seen corresponding path program 1 times [2018-01-25 00:06:49,803 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:49,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:49,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,805 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:49,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:49,859 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 00:06:49,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:49,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:06:49,860 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:49,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:49,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:49,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:49,861 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-01-25 00:06:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:49,883 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-25 00:06:49,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:06:49,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 00:06:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:49,885 INFO L225 Difference]: With dead ends: 79 [2018-01-25 00:06:49,885 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 00:06:49,886 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 00:06:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 00:06:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-25 00:06:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 00:06:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-01-25 00:06:49,895 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-01-25 00:06:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:49,895 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-01-25 00:06:49,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-01-25 00:06:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:06:49,896 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:49,897 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 00:06:49,897 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash -510641866, now seen corresponding path program 1 times [2018-01-25 00:06:49,897 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:49,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:49,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:49,899 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:49,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:49,961 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 00:06:49,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:49,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:06:49,962 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:49,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:49,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:49,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:49,963 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-01-25 00:06:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:49,999 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-25 00:06:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:06:49,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 00:06:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:50,000 INFO L225 Difference]: With dead ends: 69 [2018-01-25 00:06:50,001 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 00:06:50,001 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 00:06:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 00:06:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-25 00:06:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 00:06:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-01-25 00:06:50,009 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-01-25 00:06:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:50,010 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-01-25 00:06:50,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-01-25 00:06:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:06:50,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:50,013 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 00:06:50,013 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash -510641865, now seen corresponding path program 1 times [2018-01-25 00:06:50,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:50,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:50,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:50,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:50,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:50,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:06:50,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:50,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:06:50,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:50,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:50,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:50,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:50,103 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-01-25 00:06:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:50,197 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-01-25 00:06:50,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:06:50,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 00:06:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:50,198 INFO L225 Difference]: With dead ends: 68 [2018-01-25 00:06:50,198 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 00:06:50,199 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 00:06:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 00:06:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-25 00:06:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 00:06:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-25 00:06:50,204 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-01-25 00:06:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:50,205 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-25 00:06:50,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-25 00:06:50,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:06:50,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:50,206 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 00:06:50,206 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419564, now seen corresponding path program 1 times [2018-01-25 00:06:50,207 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:50,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:50,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:50,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:50,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:50,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:50,365 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 00:06:50,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:50,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:06:50,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:50,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:06:50,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:06:50,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:06:50,367 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-01-25 00:06:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:50,647 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-25 00:06:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:06:50,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 00:06:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:50,648 INFO L225 Difference]: With dead ends: 76 [2018-01-25 00:06:50,648 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 00:06:50,648 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:06:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 00:06:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-01-25 00:06:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 00:06:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-25 00:06:50,654 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-01-25 00:06:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:50,654 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-25 00:06:50,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:06:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-25 00:06:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:06:50,655 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:50,655 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 00:06:50,655 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419565, now seen corresponding path program 1 times [2018-01-25 00:06:50,656 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:50,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:50,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:50,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:50,657 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:50,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:50,828 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 00:06:50,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:50,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 00:06:50,829 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:50,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 00:06:50,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 00:06:50,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:06:50,830 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 10 states. [2018-01-25 00:06:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:51,324 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-01-25 00:06:51,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 00:06:51,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-25 00:06:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:51,326 INFO L225 Difference]: With dead ends: 72 [2018-01-25 00:06:51,326 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 00:06:51,326 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 00:06:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 00:06:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-01-25 00:06:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 00:06:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-25 00:06:51,336 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-01-25 00:06:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:51,337 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-25 00:06:51,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 00:06:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-25 00:06:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:06:51,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:51,338 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 00:06:51,338 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:51,338 INFO L82 PathProgramCache]: Analyzing trace with hash 758520105, now seen corresponding path program 1 times [2018-01-25 00:06:51,338 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:51,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:51,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:51,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:51,340 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:51,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:06:51,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:51,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:06:51,684 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:51,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:06:51,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:06:51,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:06:51,685 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-01-25 00:06:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:51,957 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-25 00:06:51,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:06:51,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 00:06:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:51,958 INFO L225 Difference]: With dead ends: 70 [2018-01-25 00:06:51,958 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 00:06:51,958 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:06:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 00:06:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 00:06:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 00:06:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-25 00:06:51,968 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 32 [2018-01-25 00:06:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:51,968 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-25 00:06:51,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:06:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-25 00:06:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 00:06:51,969 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:51,969 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 00:06:51,970 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1206669578, now seen corresponding path program 1 times [2018-01-25 00:06:51,970 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:51,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:51,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:51,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:51,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:51,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:06:52,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:52,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:06:52,019 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:52,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:52,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:52,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:52,020 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-01-25 00:06:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:52,040 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-01-25 00:06:52,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:06:52,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-25 00:06:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:52,042 INFO L225 Difference]: With dead ends: 87 [2018-01-25 00:06:52,042 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 00:06:52,042 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 00:06:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 00:06:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-01-25 00:06:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 00:06:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-01-25 00:06:52,048 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 34 [2018-01-25 00:06:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:52,049 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-01-25 00:06:52,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-01-25 00:06:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 00:06:52,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:52,049 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:06:52,050 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-25 00:06:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227651, now seen corresponding path program 1 times [2018-01-25 00:06:52,050 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:52,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:52,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:52,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:52,051 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 00:06:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 00:06:52,102 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 00:06:52,119 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 00:06:52,125 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 00:06:52,125 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 00:06:52,126 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 00:06:52,126 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 00:06:52,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:06:52 BoogieIcfgContainer [2018-01-25 00:06:52,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:06:52,141 INFO L168 Benchmark]: Toolchain (without parser) took 4403.75 ms. Allocated memory was 301.5 MB in the beginning and 515.4 MB in the end (delta: 213.9 MB). Free memory was 260.5 MB in the beginning and 337.6 MB in the end (delta: -77.1 MB). Peak memory consumption was 136.8 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:52,142 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:06:52,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.08 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 247.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:52,143 INFO L168 Benchmark]: Boogie Preprocessor took 35.70 ms. Allocated memory is still 301.5 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:52,143 INFO L168 Benchmark]: RCFGBuilder took 280.54 ms. Allocated memory is still 301.5 MB. Free memory was 245.1 MB in the beginning and 225.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:52,144 INFO L168 Benchmark]: TraceAbstraction took 3855.24 ms. Allocated memory was 301.5 MB in the beginning and 515.4 MB in the end (delta: 213.9 MB). Free memory was 225.5 MB in the beginning and 337.6 MB in the end (delta: -112.1 MB). Peak memory consumption was 101.8 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:52,145 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.14 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.08 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 247.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.70 ms. Allocated memory is still 301.5 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 280.54 ms. Allocated memory is still 301.5 MB. Free memory was 245.1 MB in the beginning and 225.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3855.24 ms. Allocated memory was 301.5 MB in the beginning and 515.4 MB in the end (delta: 213.9 MB). Free memory was 225.5 MB in the beginning and 337.6 MB in the end (delta: -112.1 MB). Peak memory consumption was 101.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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 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$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1478]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1478. Possible FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1467] FCALL struct A a6; VAL [a6={9:0}] [L1479] CALL entry_point() VAL [a6={9:0}] [L1471] CALL, EXPR probe2_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()=-1, p={7:0}, ret=0] [L1451] ret = g6() [L1452] COND TRUE ret<0 [L1453] RET return ret; VAL [\result=-1, a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=-1] [L1471] EXPR probe2_6(&a6) VAL [a6={9:0}, probe2_6(&a6)=-1] [L1471] int ret = probe2_6(&a6); [L1472] COND FALSE !(ret==0) VAL [a6={9:0}, ret=-1] [L1475] RET, FCALL a6.p = 0 VAL [a6={9:0}, ret=-1] [L1479] entry_point() VAL [a6={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. UNSAFE Result, 3.7s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 650 SDtfs, 537 SDslu, 1708 SDs, 0 SdLazy, 975 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, 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, 12 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 34732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-06-52-152.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-06-52-152.csv Received shutdown request...