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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:15:07,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:15:07,317 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:15:07,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:15:07,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:15:07,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:15:07,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:15:07,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:15:07,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:15:07,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:15:07,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:15:07,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:15:07,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:15:07,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:15:07,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:15:07,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:15:07,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:15:07,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:15:07,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:15:07,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:15:07,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:15:07,348 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:15:07,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:15:07,349 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:15:07,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:15:07,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:15:07,351 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:15:07,351 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:15:07,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:15:07,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:15:07,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:15:07,352 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:15:07,362 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:15:07,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:15:07,363 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:15:07,363 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:15:07,363 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:15:07,364 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:15:07,364 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:15:07,364 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:15:07,364 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:15:07,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:15:07,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:15:07,365 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:15:07,365 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:15:07,365 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:15:07,365 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:15:07,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:15:07,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:15:07,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:15:07,366 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:15:07,366 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:15:07,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:15:07,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:15:07,366 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:15:07,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:15:07,367 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:15:07,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:15:07,407 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:15:07,410 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:15:07,412 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:15:07,412 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:15:07,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i [2018-02-04 04:15:07,569 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:15:07,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:15:07,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:15:07,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:15:07,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:15:07,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07, skipping insertion in model container [2018-02-04 04:15:07,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,588 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:15:07,624 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:15:07,721 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:15:07,740 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:15:07,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07 WrapperNode [2018-02-04 04:15:07,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:15:07,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:15:07,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:15:07,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:15:07,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (1/1) ... [2018-02-04 04:15:07,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:15:07,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:15:07,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:15:07,775 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:15:07,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 04:15:07,810 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:15:07,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:15:07,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:15:07,811 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 04:15:07,811 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 04:15:07,811 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-02-04 04:15:07,811 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 04:15:07,811 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:15:07,812 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:15:07,812 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:15:07,812 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:15:07,812 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:15:07,812 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:15:07,812 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:15:07,812 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:15:07,812 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:15:07,813 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:15:07,813 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:15:07,813 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 04:15:07,813 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 04:15:07,813 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-02-04 04:15:07,813 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 04:15:07,813 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:15:07,813 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:15:07,814 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:15:07,814 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:15:07,980 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:15:07,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:15:07 BoogieIcfgContainer [2018-02-04 04:15:07,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:15:07,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:15:07,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:15:07,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:15:07,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:15:07" (1/3) ... [2018-02-04 04:15:07,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305b243a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:15:07, skipping insertion in model container [2018-02-04 04:15:07,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:07" (2/3) ... [2018-02-04 04:15:07,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305b243a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:15:07, skipping insertion in model container [2018-02-04 04:15:07,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:15:07" (3/3) ... [2018-02-04 04:15:07,985 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-02-04 04:15:07,991 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:15:07,996 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 04:15:08,019 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:15:08,019 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:15:08,019 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:15:08,020 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:15:08,020 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:15:08,020 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:15:08,020 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:15:08,020 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:15:08,020 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:15:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-02-04 04:15:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:15:08,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:08,035 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:15:08,035 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-02-04 04:15:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash 3351521, now seen corresponding path program 1 times [2018-02-04 04:15:08,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:08,039 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:08,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,073 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:08,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:08,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:08,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:08,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:15:08,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:15:08,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:15:08,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:15:08,150 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2018-02-04 04:15:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:08,255 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-04 04:15:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:15:08,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 04:15:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:08,325 INFO L225 Difference]: With dead ends: 82 [2018-02-04 04:15:08,325 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 04:15:08,327 INFO L554 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-02-04 04:15:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 04:15:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-02-04 04:15:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 04:15:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 04:15:08,364 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 4 [2018-02-04 04:15:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:08,364 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 04:15:08,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:15:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 04:15:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:15:08,365 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:08,365 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:15:08,365 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-02-04 04:15:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash 3351522, now seen corresponding path program 1 times [2018-02-04 04:15:08,365 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:08,366 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:08,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,367 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:08,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:08,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:08,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:08,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:15:08,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:15:08,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:15:08,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:15:08,419 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-02-04 04:15:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:08,473 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-02-04 04:15:08,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:15:08,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 04:15:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:08,474 INFO L225 Difference]: With dead ends: 122 [2018-02-04 04:15:08,475 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 04:15:08,475 INFO L554 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-02-04 04:15:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 04:15:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2018-02-04 04:15:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 04:15:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-02-04 04:15:08,484 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 4 [2018-02-04 04:15:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:08,484 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-02-04 04:15:08,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:15:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-02-04 04:15:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:15:08,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:08,485 INFO L351 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-02-04 04:15:08,485 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-02-04 04:15:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 312821243, now seen corresponding path program 1 times [2018-02-04 04:15:08,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:08,486 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:08,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:08,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:08,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:08,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:08,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:15:08,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:15:08,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:15:08,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:15:08,588 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2018-02-04 04:15:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:08,759 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2018-02-04 04:15:08,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:15:08,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 04:15:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:08,761 INFO L225 Difference]: With dead ends: 128 [2018-02-04 04:15:08,761 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 04:15:08,761 INFO L554 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-02-04 04:15:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 04:15:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2018-02-04 04:15:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 04:15:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2018-02-04 04:15:08,768 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 24 [2018-02-04 04:15:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:08,769 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2018-02-04 04:15:08,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:15:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-02-04 04:15:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:15:08,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:08,769 INFO L351 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-02-04 04:15:08,769 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-02-04 04:15:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash 312821244, now seen corresponding path program 1 times [2018-02-04 04:15:08,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:08,770 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:08,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:08,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:08,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:08,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:08,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:15:08,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:15:08,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:15:08,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:15:08,823 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand 6 states. [2018-02-04 04:15:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:08,849 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2018-02-04 04:15:08,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:15:08,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 04:15:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:08,850 INFO L225 Difference]: With dead ends: 109 [2018-02-04 04:15:08,850 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 04:15:08,851 INFO L554 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-02-04 04:15:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 04:15:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-02-04 04:15:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 04:15:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-02-04 04:15:08,857 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 24 [2018-02-04 04:15:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:08,857 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-02-04 04:15:08,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:15:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-02-04 04:15:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:15:08,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:08,857 INFO L351 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-02-04 04:15:08,857 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-02-04 04:15:08,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1854259380, now seen corresponding path program 1 times [2018-02-04 04:15:08,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:08,858 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:08,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:08,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:08,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:08,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:08,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:15:08,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:15:08,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:15:08,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:15:08,928 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 5 states. [2018-02-04 04:15:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:08,946 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-02-04 04:15:08,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:15:08,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 04:15:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:08,947 INFO L225 Difference]: With dead ends: 73 [2018-02-04 04:15:08,947 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 04:15:08,947 INFO L554 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-02-04 04:15:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 04:15:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 04:15:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 04:15:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-02-04 04:15:08,952 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 24 [2018-02-04 04:15:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:08,952 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-02-04 04:15:08,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:15:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-02-04 04:15:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:15:08,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:08,953 INFO L351 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-02-04 04:15:08,953 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-02-04 04:15:08,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1628417000, now seen corresponding path program 1 times [2018-02-04 04:15:08,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:08,954 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:08,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,955 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:08,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:08,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:09,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:09,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:15:09,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:15:09,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:15:09,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:15:09,013 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-02-04 04:15:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:09,043 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-02-04 04:15:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:15:09,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 04:15:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:09,044 INFO L225 Difference]: With dead ends: 64 [2018-02-04 04:15:09,044 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 04:15:09,044 INFO L554 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-02-04 04:15:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 04:15:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 04:15:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 04:15:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-02-04 04:15:09,047 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 24 [2018-02-04 04:15:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:09,047 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-02-04 04:15:09,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:15:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-02-04 04:15:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:15:09,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:09,048 INFO L351 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-02-04 04:15:09,048 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-02-04 04:15:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961130, now seen corresponding path program 1 times [2018-02-04 04:15:09,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:09,048 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:09,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:09,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:09,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:09,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:09,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:09,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:15:09,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:15:09,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:15:09,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:15:09,104 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 6 states. [2018-02-04 04:15:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:09,121 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 04:15:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:15:09,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 04:15:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:09,121 INFO L225 Difference]: With dead ends: 62 [2018-02-04 04:15:09,121 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 04:15:09,121 INFO L554 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-02-04 04:15:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 04:15:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 04:15:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 04:15:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-02-04 04:15:09,124 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 26 [2018-02-04 04:15:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:09,124 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-02-04 04:15:09,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:15:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-02-04 04:15:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:15:09,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:09,124 INFO L351 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-02-04 04:15:09,124 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-02-04 04:15:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961129, now seen corresponding path program 1 times [2018-02-04 04:15:09,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:09,125 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:09,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:09,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:09,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:09,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:15:09,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:15:09,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:15:09,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:15:09,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:15:09,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:15:09,159 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2018-02-04 04:15:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:15:09,228 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 04:15:09,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:15:09,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 04:15:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:15:09,229 INFO L225 Difference]: With dead ends: 60 [2018-02-04 04:15:09,229 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 04:15:09,230 INFO L554 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-02-04 04:15:09,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 04:15:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 04:15:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 04:15:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 04:15:09,232 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 26 [2018-02-04 04:15:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:15:09,233 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 04:15:09,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:15:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 04:15:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:15:09,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:15:09,233 INFO L351 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-02-04 04:15:09,234 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-02-04 04:15:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash -903148600, now seen corresponding path program 1 times [2018-02-04 04:15:09,234 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:15:09,234 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:15:09,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:09,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:15:09,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:15:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:15:09,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:15:09,253 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:15:09,256 INFO L168 Benchmark]: Toolchain (without parser) took 1687.09 ms. Allocated memory was 401.1 MB in the beginning and 610.8 MB in the end (delta: 209.7 MB). Free memory was 355.1 MB in the beginning and 442.7 MB in the end (delta: -87.6 MB). Peak memory consumption was 122.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:15:09,257 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:15:09,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.19 ms. Allocated memory is still 401.1 MB. Free memory was 355.1 MB in the beginning and 341.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:15:09,257 INFO L168 Benchmark]: Boogie Preprocessor took 26.98 ms. Allocated memory is still 401.1 MB. Free memory was 341.9 MB in the beginning and 340.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:15:09,257 INFO L168 Benchmark]: RCFGBuilder took 205.45 ms. Allocated memory is still 401.1 MB. Free memory was 340.5 MB in the beginning and 318.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:15:09,258 INFO L168 Benchmark]: TraceAbstraction took 1274.82 ms. Allocated memory was 401.1 MB in the beginning and 610.8 MB in the end (delta: 209.7 MB). Free memory was 318.0 MB in the beginning and 442.7 MB in the end (delta: -124.7 MB). Peak memory consumption was 85.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:15:09,258 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.19 ms. Allocated memory is still 401.1 MB. Free memory was 355.1 MB in the beginning and 341.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.98 ms. Allocated memory is still 401.1 MB. Free memory was 341.9 MB in the beginning and 340.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 205.45 ms. Allocated memory is still 401.1 MB. Free memory was 340.5 MB in the beginning and 318.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1274.82 ms. Allocated memory was 401.1 MB in the beginning and 610.8 MB in the end (delta: 209.7 MB). Free memory was 318.0 MB in the beginning and 442.7 MB in the end (delta: -124.7 MB). Peak memory consumption was 85.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-15-09-263.csv Received shutdown request...