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/list-ext-properties/test-0158_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:45:18,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:45:18,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:45:18,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:45:18,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:45:18,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:45:18,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:45:18,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:45:18,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:45:18,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:45:18,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:45:18,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:45:18,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:45:18,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:45:18,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:45:18,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:45:18,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:45:18,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:45:18,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:45:18,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:45:18,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:45:18,260 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:45:18,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:45:18,261 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:45:18,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:45:18,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:45:18,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:45:18,264 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:45:18,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:45:18,264 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:45:18,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:45:18,265 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 18:45:18,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:45:18,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:45:18,275 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:45:18,275 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:45:18,275 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:45:18,276 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:45:18,276 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:45:18,276 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:45:18,276 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:45:18,276 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:45:18,276 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:45:18,277 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:45:18,277 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:45:18,277 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:45:18,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:45:18,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:45:18,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:45:18,277 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:45:18,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:45:18,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:45:18,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:45:18,278 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:45:18,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:45:18,278 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:45:18,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:45:18,316 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:45:18,318 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:45:18,319 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:45:18,319 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:45:18,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_true-valid-memsafety_true-termination.i [2018-02-04 18:45:18,458 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:45:18,459 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:45:18,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:45:18,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:45:18,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:45:18,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c50d7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18, skipping insertion in model container [2018-02-04 18:45:18,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,484 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:45:18,513 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:45:18,598 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:45:18,608 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:45:18,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18 WrapperNode [2018-02-04 18:45:18,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:45:18,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:45:18,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:45:18,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:45:18,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (1/1) ... [2018-02-04 18:45:18,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:45:18,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:45:18,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:45:18,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:45:18,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (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 18:45:18,673 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:45:18,674 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:45:18,674 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:45:18,674 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:45:18,674 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:45:18,674 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:45:18,674 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:45:18,674 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:45:18,675 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:45:18,675 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:45:18,675 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:45:18,675 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:45:18,675 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:45:18,675 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:45:18,675 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:45:18,675 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:45:18,811 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:45:18,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:45:18 BoogieIcfgContainer [2018-02-04 18:45:18,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:45:18,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:45:18,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:45:18,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:45:18,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:45:18" (1/3) ... [2018-02-04 18:45:18,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634e6074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:45:18, skipping insertion in model container [2018-02-04 18:45:18,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:18" (2/3) ... [2018-02-04 18:45:18,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634e6074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:45:18, skipping insertion in model container [2018-02-04 18:45:18,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:45:18" (3/3) ... [2018-02-04 18:45:18,816 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0158_1_true-valid-memsafety_true-termination.i [2018-02-04 18:45:18,821 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:45:18,826 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 18:45:18,856 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:45:18,856 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:45:18,856 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:45:18,857 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:45:18,857 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:45:18,857 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:45:18,857 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:45:18,857 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:45:18,858 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:45:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-02-04 18:45:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:45:18,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:18,878 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:18,878 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:45:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash 32614707, now seen corresponding path program 1 times [2018-02-04 18:45:18,884 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:18,884 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:18,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:18,925 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:18,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:18,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:18,981 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:18,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:18,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:18,983 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:19,061 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 18:45:19,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:45:19,146 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 18:45:19,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,153 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 18:45:19,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:45:19,159 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 18:45:19,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:19,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:45:19,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:45:19,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:45:19,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:45:19,171 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-02-04 18:45:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:19,228 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-02-04 18:45:19,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:45:19,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-04 18:45:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:19,234 INFO L225 Difference]: With dead ends: 33 [2018-02-04 18:45:19,234 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 18:45:19,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 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 18:45:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 18:45:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 18:45:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 18:45:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 18:45:19,255 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 8 [2018-02-04 18:45:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:19,255 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 18:45:19,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:45:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 18:45:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:45:19,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:19,256 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:19,256 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:45:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash 32614708, now seen corresponding path program 1 times [2018-02-04 18:45:19,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:19,256 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:19,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:19,257 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:19,271 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:19,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:19,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:19,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:19,291 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 18:45:19,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:45:19,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:19,309 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:45:19,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:45:19,320 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 18:45:19,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2018-02-04 18:45:19,334 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 18:45:19,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:19,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:19,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:45:19,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:45:19,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:45:19,336 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 4 states. [2018-02-04 18:45:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:19,389 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-02-04 18:45:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:45:19,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 18:45:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:19,391 INFO L225 Difference]: With dead ends: 24 [2018-02-04 18:45:19,391 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 18:45:19,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:45:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 18:45:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 18:45:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 18:45:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-04 18:45:19,394 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2018-02-04 18:45:19,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:19,394 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-04 18:45:19,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:45:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-04 18:45:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 18:45:19,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:19,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:19,395 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:45:19,396 INFO L82 PathProgramCache]: Analyzing trace with hash 607540962, now seen corresponding path program 1 times [2018-02-04 18:45:19,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:19,396 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:19,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:19,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:19,415 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:19,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:19,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:19,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:19,450 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 18:45:19,452 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 18:45:19,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 18:45:19,477 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 27 treesize of output 22 [2018-02-04 18:45:19,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:19,485 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 22 treesize of output 14 [2018-02-04 18:45:19,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:7 [2018-02-04 18:45:19,502 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 18:45:19,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 18:45:19,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,507 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 18:45:19,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 18:45:19,512 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 18:45:19,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:19,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:45:19,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:45:19,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:45:19,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:19,513 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-02-04 18:45:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:19,559 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-02-04 18:45:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:19,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 18:45:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:19,560 INFO L225 Difference]: With dead ends: 23 [2018-02-04 18:45:19,560 INFO L226 Difference]: Without dead ends: 23 [2018-02-04 18:45:19,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:45:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-04 18:45:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-04 18:45:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-04 18:45:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-02-04 18:45:19,563 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2018-02-04 18:45:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:19,563 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-02-04 18:45:19,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:45:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-02-04 18:45:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 18:45:19,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:19,564 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:19,564 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:45:19,564 INFO L82 PathProgramCache]: Analyzing trace with hash 607540963, now seen corresponding path program 1 times [2018-02-04 18:45:19,564 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:19,564 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:19,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:19,565 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:19,581 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:19,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:19,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:19,582 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:19,607 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 18:45:19,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:45:19,616 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 18:45:19,623 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 18:45:19,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,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 18:45:19,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 18:45:19,639 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 29 treesize of output 24 [2018-02-04 18:45:19,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:19,644 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 24 treesize of output 16 [2018-02-04 18:45:19,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:9 [2018-02-04 18:45:19,655 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 17 treesize of output 13 [2018-02-04 18:45:19,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 5 [2018-02-04 18:45:19,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,663 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 18:45:19,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 18:45:19,669 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 18:45:19,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:19,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:45:19,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:45:19,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:45:19,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:19,671 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2018-02-04 18:45:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:19,721 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-02-04 18:45:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:19,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 18:45:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:19,722 INFO L225 Difference]: With dead ends: 22 [2018-02-04 18:45:19,722 INFO L226 Difference]: Without dead ends: 22 [2018-02-04 18:45:19,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:45:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-02-04 18:45:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-02-04 18:45:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-02-04 18:45:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-02-04 18:45:19,725 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-02-04 18:45:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:19,725 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-02-04 18:45:19,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:45:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-02-04 18:45:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:45:19,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:19,726 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:19,726 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 18:45:19,727 INFO L82 PathProgramCache]: Analyzing trace with hash -510727324, now seen corresponding path program 1 times [2018-02-04 18:45:19,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:19,727 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:19,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:19,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:19,747 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:19,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:19,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:19,748 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:19,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:19,806 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 18:45:19,808 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 18:45:19,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,819 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 18:45:19,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:39 [2018-02-04 18:45:19,836 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 53 treesize of output 44 [2018-02-04 18:45:19,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:19,842 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 44 treesize of output 40 [2018-02-04 18:45:19,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:39 [2018-02-04 18:45:19,867 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 41 treesize of output 33 [2018-02-04 18:45:19,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 22 [2018-02-04 18:45:19,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:19,877 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 18:45:19,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:27 [2018-02-04 18:45:19,909 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~mem7.base| Int) (|main_~#data~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#data~0.base| 1))) (and (not (= 0 |main_#t~mem7.base|)) (= |c_#valid| (store (store .cse0 |main_#t~mem7.base| 0) |main_~#data~0.base| 0)) (= (select .cse0 |main_#t~mem7.base|) 0) (= (select |c_old(#valid)| |main_~#data~0.base|) 0)))) is different from true [2018-02-04 18:45:19,914 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 18:45:19,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:19,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:45:19,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:45:19,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:45:19,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=4, NotChecked=12, Total=72 [2018-02-04 18:45:19,915 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 9 states. [2018-02-04 18:45:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:20,078 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-02-04 18:45:20,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:45:20,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 18:45:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:20,079 INFO L225 Difference]: With dead ends: 21 [2018-02-04 18:45:20,079 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 18:45:20,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=80, Unknown=5, NotChecked=18, Total=132 [2018-02-04 18:45:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 18:45:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 18:45:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 18:45:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 18:45:20,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-02-04 18:45:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:20,081 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 18:45:20,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:45:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 18:45:20,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 18:45:20,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:45:20 BoogieIcfgContainer [2018-02-04 18:45:20,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:45:20,088 INFO L168 Benchmark]: Toolchain (without parser) took 1629.07 ms. Allocated memory was 403.7 MB in the beginning and 612.9 MB in the end (delta: 209.2 MB). Free memory was 360.4 MB in the beginning and 455.0 MB in the end (delta: -94.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:20,089 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:45:20,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.61 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.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 18:45:20,089 INFO L168 Benchmark]: Boogie Preprocessor took 21.02 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:20,090 INFO L168 Benchmark]: RCFGBuilder took 175.26 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 330.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:20,090 INFO L168 Benchmark]: TraceAbstraction took 1275.05 ms. Allocated memory was 403.7 MB in the beginning and 612.9 MB in the end (delta: 209.2 MB). Free memory was 330.0 MB in the beginning and 455.0 MB in the end (delta: -125.0 MB). Peak memory consumption was 84.2 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:20,091 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.12 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.61 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.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 21.02 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 175.26 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 330.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1275.05 ms. Allocated memory was 403.7 MB in the beginning and 612.9 MB in the end (delta: 209.2 MB). Free memory was 330.0 MB in the beginning and 455.0 MB in the end (delta: -125.0 MB). Peak memory consumption was 84.2 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]: free always succeeds For all program executions holds that free 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: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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]: free always succeeds For all program executions holds that free 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 - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 15 error locations. SAFE Result, 1.2s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 79 SDtfs, 82 SDslu, 111 SDs, 0 SdLazy, 147 SolverSat, 28 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 60 ConstructedInterpolants, 5 QuantifiedInterpolants, 9800 SizeOfPredicates, 15 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-0158_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-45-20-097.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-45-20-097.csv Received shutdown request...