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/memsafety/test-0019_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:56:51,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:56:51,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:56:51,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:56:51,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:56:51,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:56:51,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:56:51,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:56:51,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:56:51,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:56:51,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:56:51,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:56:51,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:56:51,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:56:51,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:56:51,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:56:51,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:56:51,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:56:51,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:56:51,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:56:51,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:56:51,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:56:51,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:56:51,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:56:51,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:56:51,767 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:56:51,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:56:51,768 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:56:51,768 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:56:51,769 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:56:51,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:56:51,769 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 17:56:51,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:56:51,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:56:51,780 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:56:51,780 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:56:51,780 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:56:51,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:56:51,781 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:56:51,781 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:56:51,781 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:56:51,781 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:56:51,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:56:51,781 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:56:51,782 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:56:51,782 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:56:51,782 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:56:51,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:56:51,782 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:56:51,782 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:56:51,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:56:51,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:56:51,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:56:51,783 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:56:51,783 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:56:51,783 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:56:51,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:56:51,824 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:56:51,827 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:56:51,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:56:51,829 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:56:51,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-02-04 17:56:51,979 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:56:51,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:56:51,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:56:51,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:56:51,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:56:51,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:56:51" (1/1) ... [2018-02-04 17:56:51,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461dcb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:51, skipping insertion in model container [2018-02-04 17:56:51,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:56:51" (1/1) ... [2018-02-04 17:56:51,997 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:56:52,022 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:56:52,107 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:56:52,120 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:56:52,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52 WrapperNode [2018-02-04 17:56:52,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:56:52,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:56:52,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:56:52,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:56:52,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (1/1) ... [2018-02-04 17:56:52,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (1/1) ... [2018-02-04 17:56:52,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (1/1) ... [2018-02-04 17:56:52,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (1/1) ... [2018-02-04 17:56:52,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (1/1) ... [2018-02-04 17:56:52,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (1/1) ... [2018-02-04 17:56:52,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (1/1) ... [2018-02-04 17:56:52,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:56:52,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:56:52,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:56:52,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:56:52,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (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 17:56:52,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:56:52,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:56:52,185 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-04 17:56:52,185 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-04 17:56:52,185 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:56:52,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:56:52,335 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:56:52,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:56:52 BoogieIcfgContainer [2018-02-04 17:56:52,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:56:52,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:56:52,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:56:52,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:56:52,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:56:51" (1/3) ... [2018-02-04 17:56:52,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7859d88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:56:52, skipping insertion in model container [2018-02-04 17:56:52,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:52" (2/3) ... [2018-02-04 17:56:52,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7859d88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:56:52, skipping insertion in model container [2018-02-04 17:56:52,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:56:52" (3/3) ... [2018-02-04 17:56:52,342 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2018-02-04 17:56:52,349 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:56:52,356 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 17:56:52,389 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:56:52,389 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:56:52,389 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:56:52,389 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:56:52,389 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:56:52,390 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:56:52,390 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:56:52,390 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:56:52,390 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:56:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-02-04 17:56:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:56:52,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:52,406 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:52,406 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 17:56:52,410 INFO L82 PathProgramCache]: Analyzing trace with hash 345440703, now seen corresponding path program 1 times [2018-02-04 17:56:52,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:52,412 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:52,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:52,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:52,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:52,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:52,515 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:56:52,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:52,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:52,516 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:52,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:52,588 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 17:56:52,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:52,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:52,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:56:52,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-02-04 17:56:52,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:52,633 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 17:56:52,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:56:52,640 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 17:56:52,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:52,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:56:52,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:56:52,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:56:52,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:56:52,697 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2018-02-04 17:56:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:52,793 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-04 17:56:52,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:56:52,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 17:56:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:52,801 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:56:52,801 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:56:52,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:56:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:56:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:56:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:56:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-04 17:56:52,822 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 10 [2018-02-04 17:56:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:52,823 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-04 17:56:52,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:56:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-04 17:56:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:56:52,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:52,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:52,824 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 17:56:52,824 INFO L82 PathProgramCache]: Analyzing trace with hash 345440704, now seen corresponding path program 1 times [2018-02-04 17:56:52,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:52,824 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:52,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:52,825 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:52,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:52,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:52,845 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:56:52,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:52,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:52,846 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:52,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:52,871 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 17:56:52,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:52,881 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 17:56:52,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:52,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:52,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:56:52,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:52,927 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:52,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 17:56:52,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:52,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:52,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:52,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:56:52,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:52,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:56:52,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 17:56:52,968 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 17:56:52,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:52,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:56:52,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:56:52,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:56:52,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:56:52,969 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 6 states. [2018-02-04 17:56:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:53,074 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-02-04 17:56:53,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:56:53,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-04 17:56:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:53,075 INFO L225 Difference]: With dead ends: 32 [2018-02-04 17:56:53,075 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 17:56:53,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:56:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 17:56:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 17:56:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 17:56:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-02-04 17:56:53,079 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 10 [2018-02-04 17:56:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:53,080 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-02-04 17:56:53,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:56:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-02-04 17:56:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:56:53,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:53,081 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 17:56:53,081 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 17:56:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash 569818482, now seen corresponding path program 1 times [2018-02-04 17:56:53,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:53,081 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:53,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:53,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:53,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:53,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:53,103 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:56:53,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:53,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:53,104 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:53,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:53,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 17:56:53,176 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 8 treesize of output 7 [2018-02-04 17:56:53,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-02-04 17:56:53,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 17:56:53,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:53,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 17:56:53,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:56:53,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-02-04 17:56:53,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 17:56:53,251 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:56:53,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 17:56:53,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:3 [2018-02-04 17:56:53,277 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 17:56:53,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:53,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:56:53,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:56:53,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:56:53,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:56:53,278 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 11 states. [2018-02-04 17:56:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:53,363 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 17:56:53,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:56:53,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-02-04 17:56:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:53,364 INFO L225 Difference]: With dead ends: 31 [2018-02-04 17:56:53,364 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 17:56:53,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:56:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 17:56:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 17:56:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 17:56:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-02-04 17:56:53,367 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 20 [2018-02-04 17:56:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:53,367 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-02-04 17:56:53,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:56:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-02-04 17:56:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:56:53,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:53,367 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 17:56:53,367 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 17:56:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash 569818483, now seen corresponding path program 1 times [2018-02-04 17:56:53,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:53,368 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:53,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:53,368 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:53,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:53,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:53,384 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:56:53,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:53,385 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:53,385 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:53,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:53,441 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 17:56:53,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:56:53,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 17:56:53,463 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 8 treesize of output 7 [2018-02-04 17:56:53,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 17:56:53,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-02-04 17:56:53,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2018-02-04 17:56:53,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 17:56:53,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:53,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 17:56:53,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:53,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:56:53,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-02-04 17:56:53,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-04 17:56:53,560 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:56:53,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:53,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 17:56:53,563 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:56:53,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:56:53,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:56:53,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-02-04 17:56:53,599 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 17:56:53,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:53,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 17:56:53,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:56:53,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:56:53,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:56:53,600 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 12 states. [2018-02-04 17:56:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:53,743 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-04 17:56:53,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:56:53,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-02-04 17:56:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:53,743 INFO L225 Difference]: With dead ends: 33 [2018-02-04 17:56:53,744 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 17:56:53,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:56:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 17:56:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-02-04 17:56:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 17:56:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-02-04 17:56:53,747 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 20 [2018-02-04 17:56:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:53,748 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-02-04 17:56:53,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:56:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-02-04 17:56:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:56:53,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:53,748 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] [2018-02-04 17:56:53,749 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 17:56:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 484503765, now seen corresponding path program 1 times [2018-02-04 17:56:53,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:53,749 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:53,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:53,750 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:53,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:53,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:53,864 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 17:56:53,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:53,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:56:53,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:56:53,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:56:53,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:56:53,865 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2018-02-04 17:56:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:53,969 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-04 17:56:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:56:53,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 17:56:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:53,970 INFO L225 Difference]: With dead ends: 29 [2018-02-04 17:56:53,970 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 17:56:53,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:56:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 17:56:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 17:56:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 17:56:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-04 17:56:53,972 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2018-02-04 17:56:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:53,973 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-04 17:56:53,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:56:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-04 17:56:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:56:53,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:53,973 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] [2018-02-04 17:56:53,974 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 17:56:53,974 INFO L82 PathProgramCache]: Analyzing trace with hash 484503766, now seen corresponding path program 1 times [2018-02-04 17:56:53,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:53,974 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:53,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:53,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:53,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:53,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:53,991 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:56:53,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:53,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:53,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:54,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:54,044 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 17:56:54,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:56:54,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 17:56:54,068 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 8 treesize of output 7 [2018-02-04 17:56:54,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 17:56:54,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:54,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:54,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 36 [2018-02-04 17:56:54,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:32 [2018-02-04 17:56:54,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-02-04 17:56:54,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:54,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-02-04 17:56:54,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38 [2018-02-04 17:56:54,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2018-02-04 17:56:54,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2018-02-04 17:56:54,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-02-04 17:56:54,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:54,204 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 25 treesize of output 19 [2018-02-04 17:56:54,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,220 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 2 xjuncts. [2018-02-04 17:56:54,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-02-04 17:56:54,255 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 17:56:54,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:54,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 17:56:54,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:56:54,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:56:54,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:56:54,256 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 14 states. [2018-02-04 17:56:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:54,396 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-02-04 17:56:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:56:54,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-02-04 17:56:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:54,397 INFO L225 Difference]: With dead ends: 28 [2018-02-04 17:56:54,397 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 17:56:54,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:56:54,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 17:56:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 17:56:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 17:56:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-02-04 17:56:54,399 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 21 [2018-02-04 17:56:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:54,399 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-02-04 17:56:54,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:56:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-02-04 17:56:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:56:54,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:54,399 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:54,399 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 17:56:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash -502821665, now seen corresponding path program 1 times [2018-02-04 17:56:54,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:54,400 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:54,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:54,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:54,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:54,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:54,415 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:56:54,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:54,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:54,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:54,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:54,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 17:56:54,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:56:54,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-04 17:56:54,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-02-04 17:56:54,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:54,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:54,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 66 [2018-02-04 17:56:54,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:68 [2018-02-04 17:56:54,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2018-02-04 17:56:54,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:54,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:56:54,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 50 [2018-02-04 17:56:54,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:45 [2018-02-04 17:56:54,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 17:56:54,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:54,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:56:54,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:36 [2018-02-04 17:56:54,762 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~mem4.base| Int) (|main_#t~mem5.base| Int) (|main_~#data~0.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_~#data~0.base| 1))) (let ((.cse0 (store .cse1 |main_#t~mem4.base| 1))) (and (= 0 (select .cse0 |main_#t~mem5.base|)) (not (= |main_#t~mem5.base| 0)) (= (store (store (store (store .cse0 |main_#t~mem5.base| 1) |main_#t~mem4.base| 0) |main_#t~mem5.base| 0) |main_~#data~0.base| 0) |c_#valid|) (= (select .cse1 |main_#t~mem4.base|) 0) (not (= |main_#t~mem4.base| 0)) (not (= |main_#t~mem4.base| |main_#t~mem5.base|)) (= (select |c_old(#valid)| |main_~#data~0.base|) 0))))) is different from true [2018-02-04 17:56:54,766 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 17:56:54,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:54,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 17:56:54,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:56:54,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:56:54,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=4, NotChecked=30, Total=306 [2018-02-04 17:56:54,767 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 18 states. [2018-02-04 17:56:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:55,060 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-02-04 17:56:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:56:55,061 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-04 17:56:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:55,061 INFO L225 Difference]: With dead ends: 27 [2018-02-04 17:56:55,061 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:56:55,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=403, Unknown=5, NotChecked=40, Total=506 [2018-02-04 17:56:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:56:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:56:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:56:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:56:55,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-02-04 17:56:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:55,063 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:56:55,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:56:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:56:55,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:56:55,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:56:55 BoogieIcfgContainer [2018-02-04 17:56:55,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:56:55,068 INFO L168 Benchmark]: Toolchain (without parser) took 3088.84 ms. Allocated memory was 402.7 MB in the beginning and 668.5 MB in the end (delta: 265.8 MB). Free memory was 359.3 MB in the beginning and 513.8 MB in the end (delta: -154.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:55,069 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:56:55,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.03 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:55,069 INFO L168 Benchmark]: Boogie Preprocessor took 22.21 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:55,069 INFO L168 Benchmark]: RCFGBuilder took 187.17 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 328.9 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:55,069 INFO L168 Benchmark]: TraceAbstraction took 2730.89 ms. Allocated memory was 402.7 MB in the beginning and 668.5 MB in the end (delta: 265.8 MB). Free memory was 328.9 MB in the beginning and 513.8 MB in the end (delta: -184.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:56:55,070 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.20 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.03 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.21 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 187.17 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 328.9 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2730.89 ms. Allocated memory was 402.7 MB in the beginning and 668.5 MB in the end (delta: 265.8 MB). Free memory was 328.9 MB in the beginning and 513.8 MB in the end (delta: -184.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: 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 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 13 error locations. SAFE Result, 2.6s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 117 SDslu, 580 SDs, 0 SdLazy, 763 SolverSat, 44 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, 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, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 122 ConstructedInterpolants, 12 QuantifiedInterpolants, 38257 SizeOfPredicates, 55 NumberOfNonLiveVariables, 639 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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/test-0019_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-56-55-076.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-56-55-076.csv Received shutdown request...