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_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:12:18,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:12:18,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:12:18,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:12:18,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:12:18,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:12:18,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:12:18,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:12:18,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:12:18,788 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:12:18,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:12:18,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:12:18,789 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:12:18,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:12:18,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:12:18,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:12:18,794 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:12:18,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:12:18,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:12:18,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:12:18,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:12:18,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:12:18,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:12:18,800 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:12:18,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:12:18,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:12:18,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:12:18,803 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:12:18,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:12:18,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:12:18,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:12:18,804 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 14:12:18,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:12:18,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:12:18,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:12:18,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:12:18,815 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:12:18,815 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:12:18,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:12:18,815 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:12:18,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:12:18,816 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:12:18,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:12:18,816 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:12:18,816 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:12:18,816 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:12:18,816 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:12:18,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:12:18,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:12:18,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:12:18,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:12:18,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:12:18,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:12:18,817 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:12:18,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:12:18,818 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:12:18,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:12:18,855 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:12:18,859 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:12:18,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:12:18,860 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:12:18,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-04 14:12:19,024 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:12:19,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:12:19,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:12:19,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:12:19,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:12:19,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,036 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 02:12:19, skipping insertion in model container [2018-02-04 14:12:19,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,050 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:12:19,088 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:12:19,164 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:12:19,173 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:12:19,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19 WrapperNode [2018-02-04 14:12:19,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:12:19,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:12:19,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:12:19,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:12:19,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (1/1) ... [2018-02-04 14:12:19,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:12:19,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:12:19,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:12:19,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:12:19,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (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 14:12:19,238 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:12:19,238 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:12:19,238 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 14:12:19,238 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 14:12:19,238 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:12:19,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:12:19,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:12:19,238 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:12:19,238 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 14:12:19,239 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 14:12:19,239 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:12:19,239 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 14:12:19,239 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 14:12:19,239 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:12:19,239 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:12:19,239 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:12:19,339 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:12:19,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:12:19 BoogieIcfgContainer [2018-02-04 14:12:19,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:12:19,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:12:19,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:12:19,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:12:19,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:12:19" (1/3) ... [2018-02-04 14:12:19,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e077a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:12:19, skipping insertion in model container [2018-02-04 14:12:19,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:12:19" (2/3) ... [2018-02-04 14:12:19,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e077a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:12:19, skipping insertion in model container [2018-02-04 14:12:19,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:12:19" (3/3) ... [2018-02-04 14:12:19,345 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-04 14:12:19,352 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:12:19,358 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 14:12:19,393 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:12:19,393 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:12:19,393 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:12:19,394 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:12:19,394 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:12:19,394 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:12:19,394 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:12:19,394 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:12:19,395 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:12:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 14:12:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 14:12:19,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:19,416 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:19,416 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:19,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-02-04 14:12:19,421 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:19,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:19,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,464 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:19,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:19,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:19,564 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 14:12:19,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:19,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:12:19,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:12:19,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:12:19,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:12:19,579 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-02-04 14:12:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:19,639 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-04 14:12:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:12:19,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 14:12:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:19,691 INFO L225 Difference]: With dead ends: 42 [2018-02-04 14:12:19,691 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 14:12:19,692 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 14:12:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 14:12:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-04 14:12:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 14:12:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 14:12:19,716 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-02-04 14:12:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:19,716 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 14:12:19,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:12:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 14:12:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:12:19,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:19,717 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:19,717 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-02-04 14:12:19,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:19,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:19,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:19,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:19,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:19,771 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 14:12:19,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:19,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:12:19,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:19,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:19,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:19,773 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-02-04 14:12:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:19,806 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-04 14:12:19,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:19,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 14:12:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:19,808 INFO L225 Difference]: With dead ends: 40 [2018-02-04 14:12:19,808 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 14:12:19,809 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 14:12:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 14:12:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-02-04 14:12:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 14:12:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 14:12:19,813 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-02-04 14:12:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:19,814 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 14:12:19,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 14:12:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:12:19,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:19,815 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:19,815 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:19,815 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-02-04 14:12:19,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:19,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:19,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:19,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:19,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:19,860 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 14:12:19,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:19,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:12:19,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:12:19,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:12:19,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:19,861 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-04 14:12:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:19,871 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 14:12:19,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:12:19,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 14:12:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:19,872 INFO L225 Difference]: With dead ends: 32 [2018-02-04 14:12:19,872 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 14:12:19,872 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 14:12:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 14:12:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-02-04 14:12:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 14:12:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 14:12:19,875 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-02-04 14:12:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:19,875 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 14:12:19,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:12:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 14:12:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:12:19,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:19,876 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:19,876 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-02-04 14:12:19,876 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:19,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:19,877 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,877 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:19,877 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:19,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:19,908 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 14:12:19,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:19,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:12:19,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:12:19,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:12:19,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:12:19,909 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-02-04 14:12:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:19,923 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 14:12:19,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:12:19,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 14:12:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:19,925 INFO L225 Difference]: With dead ends: 36 [2018-02-04 14:12:19,925 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 14:12:19,925 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 14:12:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 14:12:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-04 14:12:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 14:12:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-04 14:12:19,929 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-02-04 14:12:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:19,930 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-04 14:12:19,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:12:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-04 14:12:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 14:12:19,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:19,931 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:19,931 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:19,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-02-04 14:12:19,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:19,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:19,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,933 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:19,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:19,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:12:19,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:12:19,989 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:12:19,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:12:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:12:20,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:12:20,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-02-04 14:12:20,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:12:20,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:12:20,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:12:20,079 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-02-04 14:12:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:20,092 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-02-04 14:12:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:20,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 14:12:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:20,093 INFO L225 Difference]: With dead ends: 33 [2018-02-04 14:12:20,094 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 14:12:20,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:12:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 14:12:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 14:12:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 14:12:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 14:12:20,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-02-04 14:12:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:20,098 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 14:12:20,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:12:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 14:12:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:12:20,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:20,099 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] [2018-02-04 14:12:20,099 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:20,099 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-02-04 14:12:20,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:20,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:20,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:12:20,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:12:20,153 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:12:20,158 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:12:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:12:20,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:12:20,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 14:12:20,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:20,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:20,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:20,204 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-04 14:12:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:20,216 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 14:12:20,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:12:20,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 14:12:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:20,217 INFO L225 Difference]: With dead ends: 30 [2018-02-04 14:12:20,217 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 14:12:20,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 4 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 14:12:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 14:12:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 14:12:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 14:12:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 14:12:20,219 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-02-04 14:12:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:20,219 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 14:12:20,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 14:12:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:12:20,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:20,220 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] [2018-02-04 14:12:20,220 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:20,220 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-02-04 14:12:20,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:20,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:20,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,221 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:20,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:12:20,324 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:12:20,335 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:12:20,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 14:12:20,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:12:20,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:12:20,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 14:12:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:20,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:12:20,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-02-04 14:12:20,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:12:20,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:12:20,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:12:20,415 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-02-04 14:12:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:20,500 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-02-04 14:12:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:12:20,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 14:12:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:20,502 INFO L225 Difference]: With dead ends: 31 [2018-02-04 14:12:20,502 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 14:12:20,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:12:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 14:12:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 14:12:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 14:12:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 14:12:20,506 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-02-04 14:12:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:20,506 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 14:12:20,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:12:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 14:12:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:12:20,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:20,507 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:20,507 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times [2018-02-04 14:12:20,508 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:20,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:20,509 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,509 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,509 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 14:12:20,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:20,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:20,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:20,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:20,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:20,563 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-04 14:12:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:20,575 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 14:12:20,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:12:20,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 14:12:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:20,576 INFO L225 Difference]: With dead ends: 30 [2018-02-04 14:12:20,577 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 14:12:20,577 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 14:12:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 14:12:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 14:12:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 14:12:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 14:12:20,580 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-02-04 14:12:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:20,580 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 14:12:20,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 14:12:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:12:20,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:20,581 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:12:20,581 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times [2018-02-04 14:12:20,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:20,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:20,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 14:12:20,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:20,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:12:20,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:12:20,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:12:20,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:12:20,618 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-02-04 14:12:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:20,648 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 14:12:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:12:20,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 14:12:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:20,649 INFO L225 Difference]: With dead ends: 29 [2018-02-04 14:12:20,649 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 14:12:20,649 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 14:12:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 14:12:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 14:12:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 14:12:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-04 14:12:20,651 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-02-04 14:12:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:20,651 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-04 14:12:20,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:12:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-04 14:12:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:12:20,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:20,651 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] [2018-02-04 14:12:20,651 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:20,652 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-02-04 14:12:20,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:20,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:20,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,652 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:20,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:12:20,818 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:12:20,825 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:20,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:12:20,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 14:12:20,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:12:20,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:12:20,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 14:12:20,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:12:20,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:12:20,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 14:12:20,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:12:20,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:12:20,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-02-04 14:12:20,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:12:20,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 14:12:20,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:12:20,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:12:20,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-02-04 14:12:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:12:21,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:12:21,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 15 [2018-02-04 14:12:21,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 14:12:21,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 14:12:21,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:12:21,027 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-02-04 14:12:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:21,142 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-02-04 14:12:21,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:12:21,142 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-02-04 14:12:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:21,142 INFO L225 Difference]: With dead ends: 28 [2018-02-04 14:12:21,143 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 14:12:21,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:12:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 14:12:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-02-04 14:12:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 14:12:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 14:12:21,145 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2018-02-04 14:12:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:21,146 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 14:12:21,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 14:12:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 14:12:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 14:12:21,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:21,146 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 14:12:21,146 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash -184703786, now seen corresponding path program 1 times [2018-02-04 14:12:21,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:21,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:21,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:21,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:21,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:21,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:12:21,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:12:21,296 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 14:12:21,301 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:21,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:12:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:12:21,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:12:21,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2018-02-04 14:12:21,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 14:12:21,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 14:12:21,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=251, Unknown=13, NotChecked=0, Total=306 [2018-02-04 14:12:21,499 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 18 states. [2018-02-04 14:12:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:21,749 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 14:12:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:12:21,750 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-02-04 14:12:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:21,750 INFO L225 Difference]: With dead ends: 31 [2018-02-04 14:12:21,750 INFO L226 Difference]: Without dead ends: 23 [2018-02-04 14:12:21,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=503, Unknown=13, NotChecked=0, Total=600 [2018-02-04 14:12:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-04 14:12:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-04 14:12:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-04 14:12:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-04 14:12:21,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 26 [2018-02-04 14:12:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:21,753 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-04 14:12:21,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 14:12:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-04 14:12:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:12:21,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:12:21,754 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 14:12:21,754 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 14:12:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1917235028, now seen corresponding path program 1 times [2018-02-04 14:12:21,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:12:21,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:12:21,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:21,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:12:21,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:12:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:12:21,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:12:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 14:12:22,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:12:22,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:12:22,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:12:22,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:12:22,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:12:22,019 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2018-02-04 14:12:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:12:22,136 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-02-04 14:12:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:12:22,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-02-04 14:12:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:12:22,137 INFO L225 Difference]: With dead ends: 22 [2018-02-04 14:12:22,137 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:12:22,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:12:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:12:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:12:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:12:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:12:22,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-04 14:12:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:12:22,137 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:12:22,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:12:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:12:22,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:12:22,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:12:22 BoogieIcfgContainer [2018-02-04 14:12:22,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:12:22,141 INFO L168 Benchmark]: Toolchain (without parser) took 3116.54 ms. Allocated memory was 404.8 MB in the beginning and 658.5 MB in the end (delta: 253.8 MB). Free memory was 358.8 MB in the beginning and 485.0 MB in the end (delta: -126.2 MB). Peak memory consumption was 127.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:22,142 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:12:22,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.60 ms. Allocated memory is still 404.8 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:22,143 INFO L168 Benchmark]: Boogie Preprocessor took 22.42 ms. Allocated memory is still 404.8 MB. Free memory was 345.6 MB in the beginning and 344.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:22,143 INFO L168 Benchmark]: RCFGBuilder took 139.67 ms. Allocated memory is still 404.8 MB. Free memory was 344.3 MB in the beginning and 329.5 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:22,143 INFO L168 Benchmark]: TraceAbstraction took 2800.75 ms. Allocated memory was 404.8 MB in the beginning and 658.5 MB in the end (delta: 253.8 MB). Free memory was 329.5 MB in the beginning and 485.0 MB in the end (delta: -155.5 MB). Peak memory consumption was 98.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:12:22,145 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.60 ms. Allocated memory is still 404.8 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.42 ms. Allocated memory is still 404.8 MB. Free memory was 345.6 MB in the beginning and 344.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 139.67 ms. Allocated memory is still 404.8 MB. Free memory was 344.3 MB in the beginning and 329.5 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2800.75 ms. Allocated memory was 404.8 MB in the beginning and 658.5 MB in the end (delta: 253.8 MB). Free memory was 329.5 MB in the beginning and 485.0 MB in the end (delta: -155.5 MB). Peak memory consumption was 98.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 5 error locations. SAFE Result, 2.7s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 70 SDslu, 909 SDs, 0 SdLazy, 694 SolverSat, 41 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 119 SyntacticMatches, 13 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 369 ConstructedInterpolants, 4 QuantifiedInterpolants, 40277 SizeOfPredicates, 10 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 51/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-12-22-151.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-12-22-151.csv Received shutdown request...