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_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:17:12,948 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:17:12,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:17:12,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:17:12,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:17:12,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:17:12,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:17:12,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:17:12,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:17:12,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:17:12,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:17:12,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:17:12,966 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:17:12,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:17:12,968 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:17:12,969 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:17:12,971 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:17:12,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:17:12,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:17:12,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:17:12,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:17:12,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:17:12,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:17:12,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:17:12,977 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:17:12,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:17:12,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:17:12,979 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:17:12,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:17:12,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:17:12,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:17:12,980 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:17:12,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:17:12,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:17:12,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:17:12,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:17:12,991 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:17:12,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:17:12,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:17:12,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:17:12,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:17:12,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:17:12,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:17:12,992 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:17:12,993 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:17:12,993 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:17:12,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:17:12,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:17:12,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:17:12,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:17:12,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:17:12,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:17:12,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:17:12,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:17:12,994 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:17:12,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:17:12,994 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:17:13,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:17:13,034 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:17:13,037 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:17:13,038 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:17:13,039 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:17:13,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 04:17:13,180 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:17:13,181 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:17:13,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:13,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:17:13,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:17:13,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19736028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13, skipping insertion in model container [2018-02-04 04:17:13,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,197 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:13,230 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:13,315 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:13,329 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:13,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13 WrapperNode [2018-02-04 04:17:13,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:13,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:17:13,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:17:13,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:17:13,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (1/1) ... [2018-02-04 04:17:13,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:17:13,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:17:13,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:17:13,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:17:13,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (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:17:13,394 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:17:13,394 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:17:13,394 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:17:13,394 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:17:13,394 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:17:13,394 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:17:13,394 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:17:13,394 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:17:13,394 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:17:13,394 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:17:13,394 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:17:13,395 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:17:13,395 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:17:13,395 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:17:13,395 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:17:13,395 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:17:13,395 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:17:13,395 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:17:13,533 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:17:13,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:13 BoogieIcfgContainer [2018-02-04 04:17:13,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:17:13,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:17:13,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:17:13,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:17:13,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:17:13" (1/3) ... [2018-02-04 04:17:13,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae654b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:13, skipping insertion in model container [2018-02-04 04:17:13,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:13" (2/3) ... [2018-02-04 04:17:13,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae654b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:13, skipping insertion in model container [2018-02-04 04:17:13,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:13" (3/3) ... [2018-02-04 04:17:13,538 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 04:17:13,543 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:17:13,547 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 04:17:13,578 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:17:13,578 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:17:13,579 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:17:13,579 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:17:13,579 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:17:13,579 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:17:13,579 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:17:13,579 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:17:13,580 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:17:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 04:17:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:17:13,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:13,601 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:13,601 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-02-04 04:17:13,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:13,607 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:13,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:13,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:13,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:13,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:13,768 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:17:13,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:13,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:17:13,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:17:13,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:17:13,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:17:13,785 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 04:17:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:13,906 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 04:17:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:17:13,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 04:17:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:13,913 INFO L225 Difference]: With dead ends: 74 [2018-02-04 04:17:13,913 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 04:17:13,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:17:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 04:17:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-02-04 04:17:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 04:17:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-02-04 04:17:13,943 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-02-04 04:17:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:13,944 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-02-04 04:17:13,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:17:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-02-04 04:17:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:17:13,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:13,945 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:13,945 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-02-04 04:17:13,945 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:13,946 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:13,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:13,947 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:13,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:13,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,001 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:17:14,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:14,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:17:14,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:14,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:14,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:14,003 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-02-04 04:17:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:14,088 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-02-04 04:17:14,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:14,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 04:17:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:14,089 INFO L225 Difference]: With dead ends: 71 [2018-02-04 04:17:14,090 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 04:17:14,090 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:17:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 04:17:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-02-04 04:17:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 04:17:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 04:17:14,094 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-02-04 04:17:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:14,095 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 04:17:14,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 04:17:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 04:17:14,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:14,095 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] [2018-02-04 04:17:14,095 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-02-04 04:17:14,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:14,096 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:14,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:14,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:14,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,123 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:17:14,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:14,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:17:14,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:14,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:14,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:14,124 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-04 04:17:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:14,150 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-04 04:17:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:14,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 04:17:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:14,151 INFO L225 Difference]: With dead ends: 69 [2018-02-04 04:17:14,151 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 04:17:14,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:17:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 04:17:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-02-04 04:17:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 04:17:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-02-04 04:17:14,158 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-02-04 04:17:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:14,158 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-02-04 04:17:14,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-02-04 04:17:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 04:17:14,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:14,160 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] [2018-02-04 04:17:14,160 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-02-04 04:17:14,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:14,160 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:14,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:14,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:14,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,200 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:17:14,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:14,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:17:14,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:14,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:14,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:14,201 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-02-04 04:17:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:14,269 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-04 04:17:14,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:14,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 04:17:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:14,273 INFO L225 Difference]: With dead ends: 70 [2018-02-04 04:17:14,273 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 04:17:14,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:17:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 04:17:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-04 04:17:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 04:17:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-02-04 04:17:14,279 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-02-04 04:17:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:14,279 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-02-04 04:17:14,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-02-04 04:17:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 04:17:14,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:14,280 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] [2018-02-04 04:17:14,280 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:14,280 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-02-04 04:17:14,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:14,280 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:14,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:14,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:14,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,325 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:17:14,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:14,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:14,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:14,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:14,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:14,326 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-02-04 04:17:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:14,340 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-04 04:17:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:14,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 04:17:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:14,341 INFO L225 Difference]: With dead ends: 47 [2018-02-04 04:17:14,341 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 04:17:14,341 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:17:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 04:17:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 04:17:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 04:17:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-04 04:17:14,344 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-02-04 04:17:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:14,345 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-04 04:17:14,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-04 04:17:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:17:14,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:14,346 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] [2018-02-04 04:17:14,346 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:14,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-02-04 04:17:14,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:14,346 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:14,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:14,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:14,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,394 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:17:14,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:14,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:14,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:14,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:14,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:14,395 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-04 04:17:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:14,422 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 04:17:14,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:17:14,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 04:17:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:14,423 INFO L225 Difference]: With dead ends: 44 [2018-02-04 04:17:14,423 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 04:17:14,423 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:17:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 04:17:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 04:17:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 04:17:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-04 04:17:14,426 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-02-04 04:17:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:14,426 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-04 04:17:14,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-04 04:17:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:17:14,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:14,427 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] [2018-02-04 04:17:14,427 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-02-04 04:17:14,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:14,428 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:14,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:14,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:14,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,470 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:17:14,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:14,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:14,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:14,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:14,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:14,471 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-04 04:17:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:14,533 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 04:17:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:14,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 04:17:14,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:14,534 INFO L225 Difference]: With dead ends: 50 [2018-02-04 04:17:14,534 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 04:17:14,534 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:17:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 04:17:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-04 04:17:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 04:17:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 04:17:14,537 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-04 04:17:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:14,537 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 04:17:14,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 04:17:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:17:14,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:14,537 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] [2018-02-04 04:17:14,537 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-02-04 04:17:14,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:14,538 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:14,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,539 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:14,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:14,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,575 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:17:14,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:14,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:17:14,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:17:14,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:17:14,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:17:14,576 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-02-04 04:17:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:14,591 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-02-04 04:17:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:17:14,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 04:17:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:14,592 INFO L225 Difference]: With dead ends: 73 [2018-02-04 04:17:14,592 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 04:17:14,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:17:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 04:17:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-02-04 04:17:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 04:17:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 04:17:14,596 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-02-04 04:17:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:14,597 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 04:17:14,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:17:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 04:17:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:17:14,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:14,597 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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:17:14,598 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-02-04 04:17:14,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:14,598 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:14,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,599 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:14,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:14,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 04:17:14,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:14,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:14,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:14,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:14,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:14,643 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-04 04:17:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:14,653 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 04:17:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:14,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 04:17:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:14,655 INFO L225 Difference]: With dead ends: 67 [2018-02-04 04:17:14,655 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 04:17:14,655 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:17:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 04:17:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-02-04 04:17:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 04:17:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 04:17:14,658 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-02-04 04:17:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:14,661 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 04:17:14,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 04:17:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 04:17:14,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:14,663 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:14,663 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-02-04 04:17:14,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:14,663 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:14,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,664 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:14,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:14,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:14,687 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:17:14,690 INFO L168 Benchmark]: Toolchain (without parser) took 1510.19 ms. Allocated memory was 407.4 MB in the beginning and 620.2 MB in the end (delta: 212.9 MB). Free memory was 364.1 MB in the beginning and 463.9 MB in the end (delta: -99.8 MB). Peak memory consumption was 113.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:14,692 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 407.4 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:17:14,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.34 ms. Allocated memory is still 407.4 MB. Free memory was 364.1 MB in the beginning and 350.8 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:17:14,692 INFO L168 Benchmark]: Boogie Preprocessor took 24.68 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 348.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:14,692 INFO L168 Benchmark]: RCFGBuilder took 173.07 ms. Allocated memory is still 407.4 MB. Free memory was 348.2 MB in the beginning and 331.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:14,692 INFO L168 Benchmark]: TraceAbstraction took 1155.74 ms. Allocated memory was 407.4 MB in the beginning and 620.2 MB in the end (delta: 212.9 MB). Free memory was 328.4 MB in the beginning and 463.9 MB in the end (delta: -135.5 MB). Peak memory consumption was 77.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:14,694 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 407.4 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.34 ms. Allocated memory is still 407.4 MB. Free memory was 364.1 MB in the beginning and 350.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.68 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 348.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 173.07 ms. Allocated memory is still 407.4 MB. Free memory was 348.2 MB in the beginning and 331.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1155.74 ms. Allocated memory was 407.4 MB in the beginning and 620.2 MB in the end (delta: 212.9 MB). Free memory was 328.4 MB in the beginning and 463.9 MB in the end (delta: -135.5 MB). Peak memory consumption was 77.3 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_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-17-14-700.csv Received shutdown request...