java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:56:15,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:56:15,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:56:15,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:56:15,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:56:15,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:56:15,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:56:15,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:56:15,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:56:15,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:56:15,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:56:15,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:56:15,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:56:15,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:56:15,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:56:15,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:56:15,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:56:15,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:56:15,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:56:15,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:56:15,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:56:15,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:56:15,286 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:56:15,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:56:15,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:56:15,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:56:15,289 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:56:15,289 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:56:15,289 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:56:15,289 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:56:15,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:56:15,290 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:56:15,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:56:15,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:56:15,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:56:15,299 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:56:15,299 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:56:15,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:56:15,300 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:56:15,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:56:15,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:56:15,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:56:15,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:56:15,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:56:15,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:56:15,301 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:56:15,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:56:15,301 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:56:15,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:56:15,334 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:56:15,337 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:56:15,338 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:56:15,338 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:56:15,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-02-04 13:56:15,469 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:56:15,470 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:56:15,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:56:15,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:56:15,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:56:15,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581e1694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15, skipping insertion in model container [2018-02-04 13:56:15,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,490 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:56:15,524 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:56:15,608 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:56:15,623 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:56:15,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15 WrapperNode [2018-02-04 13:56:15,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:56:15,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:56:15,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:56:15,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:56:15,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (1/1) ... [2018-02-04 13:56:15,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:56:15,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:56:15,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:56:15,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:56:15,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (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 13:56:15,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:56:15,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:56:15,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 13:56:15,702 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 13:56:15,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 13:56:15,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 13:56:15,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 13:56:15,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 13:56:15,702 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 13:56:15,702 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 13:56:15,703 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 13:56:15,703 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 13:56:15,704 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 13:56:15,704 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 13:56:15,704 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 13:56:15,704 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 13:56:15,704 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 13:56:15,704 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:56:15,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:56:15,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:56:15,811 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 13:56:15,876 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:56:15,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:56:15 BoogieIcfgContainer [2018-02-04 13:56:15,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:56:15,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:56:15,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:56:15,878 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:56:15,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:56:15" (1/3) ... [2018-02-04 13:56:15,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6d3c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:56:15, skipping insertion in model container [2018-02-04 13:56:15,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:56:15" (2/3) ... [2018-02-04 13:56:15,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6d3c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:56:15, skipping insertion in model container [2018-02-04 13:56:15,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:56:15" (3/3) ... [2018-02-04 13:56:15,880 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-02-04 13:56:15,885 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:56:15,891 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 13:56:15,922 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:56:15,922 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:56:15,922 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:56:15,922 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:56:15,922 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:56:15,923 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:56:15,923 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:56:15,923 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:56:15,923 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:56:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-04 13:56:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:56:15,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:15,944 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:15,944 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash 13572496, now seen corresponding path program 1 times [2018-02-04 13:56:15,949 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:15,950 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:15,997 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:15,997 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:15,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:16,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:16,164 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 13:56:16,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:16,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:56:16,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:56:16,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:56:16,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:56:16,182 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-02-04 13:56:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:16,280 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-02-04 13:56:16,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:56:16,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 13:56:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:16,291 INFO L225 Difference]: With dead ends: 71 [2018-02-04 13:56:16,291 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 13:56:16,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:56:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 13:56:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-02-04 13:56:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 13:56:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-04 13:56:16,318 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 17 [2018-02-04 13:56:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:16,319 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-04 13:56:16,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:56:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-04 13:56:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:56:16,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:16,319 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 13:56:16,320 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:16,320 INFO L82 PathProgramCache]: Analyzing trace with hash 64872882, now seen corresponding path program 1 times [2018-02-04 13:56:16,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:16,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:16,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:16,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:16,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:16,381 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 13:56:16,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:16,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:56:16,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:56:16,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:56:16,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:56:16,382 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-02-04 13:56:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:16,448 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-04 13:56:16,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:56:16,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 13:56:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:16,449 INFO L225 Difference]: With dead ends: 67 [2018-02-04 13:56:16,449 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 13:56:16,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:56:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 13:56:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-04 13:56:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 13:56:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-04 13:56:16,454 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 19 [2018-02-04 13:56:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:16,454 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-04 13:56:16,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:56:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-04 13:56:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:56:16,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:16,455 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 13:56:16,455 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:16,455 INFO L82 PathProgramCache]: Analyzing trace with hash 64872883, now seen corresponding path program 1 times [2018-02-04 13:56:16,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:16,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:16,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,456 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:16,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:16,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:16,615 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 13:56:16,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:16,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:56:16,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:56:16,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:56:16,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:56:16,616 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-02-04 13:56:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:16,740 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-04 13:56:16,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:56:16,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 13:56:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:16,741 INFO L225 Difference]: With dead ends: 66 [2018-02-04 13:56:16,741 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 13:56:16,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:56:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 13:56:16,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-02-04 13:56:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 13:56:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 13:56:16,746 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 19 [2018-02-04 13:56:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:16,747 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 13:56:16,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:56:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 13:56:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:56:16,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:16,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, 1] [2018-02-04 13:56:16,748 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:16,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1610907055, now seen corresponding path program 1 times [2018-02-04 13:56:16,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:16,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:16,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:16,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:16,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:16,783 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 13:56:16,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:16,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:56:16,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:56:16,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:56:16,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:56:16,784 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2018-02-04 13:56:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:16,814 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-02-04 13:56:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:56:16,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-04 13:56:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:16,815 INFO L225 Difference]: With dead ends: 70 [2018-02-04 13:56:16,815 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 13:56:16,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:56:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 13:56:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 13:56:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 13:56:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-04 13:56:16,820 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-02-04 13:56:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:16,820 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-04 13:56:16,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:56:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-04 13:56:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 13:56:16,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:16,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:16,821 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -655458449, now seen corresponding path program 1 times [2018-02-04 13:56:16,821 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:16,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:16,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:16,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:16,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:16,867 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 13:56:16,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:16,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:56:16,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:56:16,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:56:16,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:56:16,868 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2018-02-04 13:56:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:16,883 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 13:56:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:56:16,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 13:56:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:16,884 INFO L225 Difference]: With dead ends: 60 [2018-02-04 13:56:16,884 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 13:56:16,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:56:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 13:56:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 13:56:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 13:56:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 13:56:16,888 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 24 [2018-02-04 13:56:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:16,888 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 13:56:16,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:56:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 13:56:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:56:16,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:16,890 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:16,890 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666846, now seen corresponding path program 1 times [2018-02-04 13:56:16,890 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:16,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:16,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,891 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:16,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:16,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:16,965 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 13:56:16,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:16,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 13:56:16,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:56:16,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:56:16,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:56:16,966 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-02-04 13:56:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:17,120 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-04 13:56:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:56:17,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 13:56:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:17,121 INFO L225 Difference]: With dead ends: 59 [2018-02-04 13:56:17,121 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 13:56:17,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:56:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 13:56:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 13:56:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 13:56:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 13:56:17,124 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 34 [2018-02-04 13:56:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:17,124 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 13:56:17,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:56:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 13:56:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:56:17,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:17,125 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:17,125 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:17,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666845, now seen corresponding path program 1 times [2018-02-04 13:56:17,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:17,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:17,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:17,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:17,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:17,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:17,167 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 13:56:17,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:17,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:56:17,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:56:17,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:56:17,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:56:17,169 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-02-04 13:56:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:17,196 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 13:56:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:56:17,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 13:56:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:17,197 INFO L225 Difference]: With dead ends: 62 [2018-02-04 13:56:17,198 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 13:56:17,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:56:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 13:56:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 13:56:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 13:56:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 13:56:17,201 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-02-04 13:56:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:17,201 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 13:56:17,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:56:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 13:56:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:56:17,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:17,202 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:17,202 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1908152085, now seen corresponding path program 1 times [2018-02-04 13:56:17,203 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:17,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:17,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:17,204 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:17,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:17,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:17,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:17,244 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:17,253 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:17,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:17,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:17,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 13:56:17,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:56:17,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:56:17,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:56:17,350 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-02-04 13:56:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:17,371 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 13:56:17,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:56:17,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 13:56:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:17,375 INFO L225 Difference]: With dead ends: 63 [2018-02-04 13:56:17,375 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 13:56:17,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:56:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 13:56:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 13:56:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 13:56:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-02-04 13:56:17,378 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 35 [2018-02-04 13:56:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:17,378 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-02-04 13:56:17,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:56:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-02-04 13:56:17,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 13:56:17,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:17,379 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:17,379 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -587259933, now seen corresponding path program 2 times [2018-02-04 13:56:17,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:17,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:17,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:17,381 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:17,381 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:17,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:17,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:17,425 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:17,432 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:56:17,459 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 13:56:17,459 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:17,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:17,489 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 17 treesize of output 16 [2018-02-04 13:56:17,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:17,506 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 20 treesize of output 19 [2018-02-04 13:56:17,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:17,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 13:56:17,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-04 13:56:19,745 WARN L143 SmtUtils]: Spent 2030ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-04 13:56:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:56:20,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:56:20,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-02-04 13:56:20,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:56:20,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:56:20,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:56:20,053 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2018-02-04 13:56:26,053 WARN L143 SmtUtils]: Spent 5801ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-04 13:56:27,988 WARN L143 SmtUtils]: Spent 1870ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-04 13:56:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:28,285 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 13:56:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:56:28,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-04 13:56:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:28,286 INFO L225 Difference]: With dead ends: 63 [2018-02-04 13:56:28,286 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 13:56:28,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-04 13:56:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 13:56:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 13:56:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 13:56:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-02-04 13:56:28,291 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 36 [2018-02-04 13:56:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:28,292 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-02-04 13:56:28,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:56:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-02-04 13:56:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 13:56:28,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:28,293 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:28,293 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463170, now seen corresponding path program 1 times [2018-02-04 13:56:28,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:28,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:28,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:28,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:28,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:28,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:56:28,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:28,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 13:56:28,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:56:28,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:56:28,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:56:28,406 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 10 states. [2018-02-04 13:56:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:28,547 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-04 13:56:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:56:28,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 13:56:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:28,548 INFO L225 Difference]: With dead ends: 59 [2018-02-04 13:56:28,548 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 13:56:28,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:56:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 13:56:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 13:56:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 13:56:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 13:56:28,550 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 42 [2018-02-04 13:56:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:28,550 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 13:56:28,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:56:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 13:56:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 13:56:28,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:28,551 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:28,551 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463169, now seen corresponding path program 1 times [2018-02-04 13:56:28,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:28,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:28,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:28,552 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:28,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:28,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:28,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:28,584 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:28,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:28,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:28,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:28,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 13:56:28,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:56:28,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:56:28,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:56:28,641 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 8 states. [2018-02-04 13:56:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:28,657 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 13:56:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:56:28,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-04 13:56:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:28,659 INFO L225 Difference]: With dead ends: 62 [2018-02-04 13:56:28,659 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 13:56:28,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:56:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 13:56:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 13:56:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 13:56:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 13:56:28,662 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 42 [2018-02-04 13:56:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:28,663 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 13:56:28,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:56:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 13:56:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 13:56:28,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:28,664 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:28,664 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1854641017, now seen corresponding path program 2 times [2018-02-04 13:56:28,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:28,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:28,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:28,665 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:28,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:28,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:28,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:28,709 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:28,714 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:56:28,735 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 13:56:28,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:28,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:28,743 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 17 treesize of output 16 [2018-02-04 13:56:28,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:28,764 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 20 treesize of output 19 [2018-02-04 13:56:28,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:56:28,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 13:56:28,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-04 13:56:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 13:56:29,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:56:29,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-04 13:56:29,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:56:29,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:56:29,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-04 13:56:29,248 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 22 states. [2018-02-04 13:56:31,412 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-04 13:56:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:31,825 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-02-04 13:56:31,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:56:31,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 13:56:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:31,826 INFO L225 Difference]: With dead ends: 61 [2018-02-04 13:56:31,826 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 13:56:31,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-02-04 13:56:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 13:56:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 13:56:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 13:56:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 13:56:31,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 43 [2018-02-04 13:56:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:31,830 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 13:56:31,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:56:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 13:56:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 13:56:31,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:31,831 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:31,831 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -796850259, now seen corresponding path program 1 times [2018-02-04 13:56:31,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:31,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:31,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:31,832 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:31,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:31,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 13:56:31,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:31,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:56:31,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:56:31,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:56:31,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:56:31,888 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 8 states. [2018-02-04 13:56:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:31,926 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-02-04 13:56:31,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:56:31,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-04 13:56:31,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:31,927 INFO L225 Difference]: With dead ends: 61 [2018-02-04 13:56:31,927 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 13:56:31,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:56:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 13:56:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 13:56:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 13:56:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-02-04 13:56:31,929 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 42 [2018-02-04 13:56:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:31,930 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-02-04 13:56:31,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:56:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-02-04 13:56:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 13:56:31,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:31,931 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:31,931 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:31,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1073611946, now seen corresponding path program 1 times [2018-02-04 13:56:31,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:31,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:31,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:31,932 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:31,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:31,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 13:56:31,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:56:31,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 13:56:31,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:56:31,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:56:31,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:56:31,999 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 10 states. [2018-02-04 13:56:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:32,077 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-04 13:56:32,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:56:32,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-02-04 13:56:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:32,078 INFO L225 Difference]: With dead ends: 63 [2018-02-04 13:56:32,078 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 13:56:32,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:56:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 13:56:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 13:56:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 13:56:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-04 13:56:32,081 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 47 [2018-02-04 13:56:32,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:32,081 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-04 13:56:32,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:56:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-04 13:56:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 13:56:32,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:32,082 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:32,082 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:32,082 INFO L82 PathProgramCache]: Analyzing trace with hash 348696970, now seen corresponding path program 1 times [2018-02-04 13:56:32,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:32,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:32,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:32,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:32,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:32,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:32,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:32,150 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:32,158 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:32,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:32,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:32,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 13:56:32,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:56:32,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:56:32,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:56:32,243 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 10 states. [2018-02-04 13:56:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:32,255 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-02-04 13:56:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:56:32,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-04 13:56:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:32,256 INFO L225 Difference]: With dead ends: 62 [2018-02-04 13:56:32,256 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 13:56:32,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:56:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 13:56:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 13:56:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 13:56:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-04 13:56:32,258 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-02-04 13:56:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:32,259 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-04 13:56:32,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:56:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-04 13:56:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 13:56:32,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:32,260 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:32,260 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:32,260 INFO L82 PathProgramCache]: Analyzing trace with hash -648862830, now seen corresponding path program 2 times [2018-02-04 13:56:32,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:32,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:32,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:32,261 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:32,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:32,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:32,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:32,326 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:32,336 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:56:32,365 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:56:32,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:32,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:32,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:32,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-02-04 13:56:32,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:56:32,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:56:32,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:56:32,399 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2018-02-04 13:56:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:32,414 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-04 13:56:32,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:56:32,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-04 13:56:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:32,416 INFO L225 Difference]: With dead ends: 63 [2018-02-04 13:56:32,416 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 13:56:32,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:56:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 13:56:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 13:56:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 13:56:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-02-04 13:56:32,417 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-02-04 13:56:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:32,418 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-02-04 13:56:32,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:56:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-02-04 13:56:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 13:56:32,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:32,418 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:32,418 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:32,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1508445558, now seen corresponding path program 3 times [2018-02-04 13:56:32,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:32,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:32,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:32,419 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:32,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:32,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:32,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:32,505 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:32,513 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:56:33,129 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 13:56:33,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:33,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:33,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:33,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-04 13:56:33,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:56:33,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:56:33,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:56:33,189 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 12 states. [2018-02-04 13:56:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:33,255 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-02-04 13:56:33,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:56:33,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-02-04 13:56:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:33,255 INFO L225 Difference]: With dead ends: 64 [2018-02-04 13:56:33,255 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 13:56:33,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:56:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 13:56:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 13:56:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 13:56:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-02-04 13:56:33,257 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-02-04 13:56:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:33,257 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-02-04 13:56:33,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:56:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-02-04 13:56:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:56:33,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:33,257 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:33,257 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1909260946, now seen corresponding path program 4 times [2018-02-04 13:56:33,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:33,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:33,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:33,258 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:33,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:33,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:33,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:33,313 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:33,318 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:56:33,361 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:56:33,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:33,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:33,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:33,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-02-04 13:56:33,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:56:33,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:56:33,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:56:33,412 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 13 states. [2018-02-04 13:56:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:33,455 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-02-04 13:56:33,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:56:33,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-04 13:56:33,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:33,455 INFO L225 Difference]: With dead ends: 65 [2018-02-04 13:56:33,456 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 13:56:33,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:56:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 13:56:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 13:56:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 13:56:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-04 13:56:33,458 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-02-04 13:56:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:33,458 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-04 13:56:33,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:56:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-04 13:56:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 13:56:33,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:33,459 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:33,459 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 483980170, now seen corresponding path program 5 times [2018-02-04 13:56:33,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:33,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:33,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:33,460 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:33,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:33,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:33,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:33,553 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:33,561 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:56:33,728 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 13:56:33,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:33,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:33,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:33,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-04 13:56:33,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:56:33,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:56:33,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:56:33,785 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-02-04 13:56:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:33,816 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-02-04 13:56:33,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:56:33,817 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-04 13:56:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:33,817 INFO L225 Difference]: With dead ends: 66 [2018-02-04 13:56:33,817 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 13:56:33,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:56:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 13:56:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 13:56:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 13:56:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-04 13:56:33,819 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-02-04 13:56:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:33,819 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-04 13:56:33,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:56:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-04 13:56:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 13:56:33,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:33,820 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:33,820 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -750050926, now seen corresponding path program 6 times [2018-02-04 13:56:33,821 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:33,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:33,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:33,821 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:33,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:33,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:33,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:33,931 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:33,938 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:56:34,604 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 13:56:34,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:34,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:34,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:34,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-04 13:56:34,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:56:34,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:56:34,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:56:34,635 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 15 states. [2018-02-04 13:56:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:34,657 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-04 13:56:34,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:56:34,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-04 13:56:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:34,658 INFO L225 Difference]: With dead ends: 67 [2018-02-04 13:56:34,658 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 13:56:34,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:56:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 13:56:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 13:56:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 13:56:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-02-04 13:56:34,661 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-02-04 13:56:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:34,661 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-02-04 13:56:34,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:56:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-02-04 13:56:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 13:56:34,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:34,662 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:34,662 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:34,662 INFO L82 PathProgramCache]: Analyzing trace with hash -350309238, now seen corresponding path program 7 times [2018-02-04 13:56:34,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:34,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:34,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:34,663 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:34,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:34,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:34,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:34,779 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:34,783 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:34,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:34,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:34,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-04 13:56:34,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:56:34,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:56:34,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:56:34,848 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 16 states. [2018-02-04 13:56:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:34,870 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-04 13:56:34,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:56:34,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2018-02-04 13:56:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:34,871 INFO L225 Difference]: With dead ends: 68 [2018-02-04 13:56:34,871 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 13:56:34,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:56:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 13:56:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 13:56:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 13:56:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-02-04 13:56:34,872 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-02-04 13:56:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:34,872 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-02-04 13:56:34,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:56:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-02-04 13:56:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 13:56:34,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:34,873 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:34,873 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash -843218798, now seen corresponding path program 8 times [2018-02-04 13:56:34,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:34,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:34,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:34,874 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:56:34,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:34,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:35,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:35,013 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:35,018 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:56:35,044 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:56:35,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:35,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:35,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:35,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 13:56:35,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:56:35,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:56:35,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:56:35,072 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 17 states. [2018-02-04 13:56:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:35,103 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-02-04 13:56:35,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:56:35,103 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-02-04 13:56:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:35,103 INFO L225 Difference]: With dead ends: 69 [2018-02-04 13:56:35,103 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 13:56:35,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:56:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 13:56:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 13:56:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 13:56:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-02-04 13:56:35,106 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-02-04 13:56:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:35,106 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-02-04 13:56:35,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:56:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-02-04 13:56:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 13:56:35,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:35,107 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:35,107 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1056454026, now seen corresponding path program 9 times [2018-02-04 13:56:35,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:35,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:35,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:35,108 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:35,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:35,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:35,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:35,250 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:35,257 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:56:37,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-02-04 13:56:37,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:37,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:37,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:37,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2018-02-04 13:56:37,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 13:56:37,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 13:56:37,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 13:56:37,285 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 37 states. [2018-02-04 13:56:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:37,388 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-02-04 13:56:37,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:56:37,389 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66 [2018-02-04 13:56:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:37,389 INFO L225 Difference]: With dead ends: 70 [2018-02-04 13:56:37,389 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 13:56:37,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=415, Invalid=1145, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 13:56:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 13:56:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 13:56:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 13:56:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-04 13:56:37,392 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-02-04 13:56:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:37,392 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-04 13:56:37,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 13:56:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-04 13:56:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 13:56:37,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:37,393 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:37,393 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash -183230574, now seen corresponding path program 10 times [2018-02-04 13:56:37,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:37,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:37,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:37,394 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:37,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:37,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:37,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:37,540 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:37,548 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:56:37,580 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:56:37,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:37,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:37,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:37,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-04 13:56:37,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:56:37,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:56:37,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:56:37,609 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 19 states. [2018-02-04 13:56:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:37,632 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-02-04 13:56:37,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:56:37,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-04 13:56:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:37,633 INFO L225 Difference]: With dead ends: 71 [2018-02-04 13:56:37,633 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 13:56:37,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:56:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 13:56:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 13:56:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 13:56:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-02-04 13:56:37,635 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-02-04 13:56:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:37,635 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-02-04 13:56:37,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:56:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-02-04 13:56:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 13:56:37,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:37,635 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:37,635 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash 41252490, now seen corresponding path program 11 times [2018-02-04 13:56:37,635 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:37,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:37,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:37,636 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:37,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:56:37,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:56:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:37,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:56:37,768 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:56:37,773 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:56:38,619 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-02-04 13:56:38,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:56:38,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:56:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:56:38,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:56:38,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-02-04 13:56:38,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:56:38,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:56:38,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:56:38,650 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 20 states. [2018-02-04 13:56:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:56:38,676 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-02-04 13:56:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:56:38,677 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-02-04 13:56:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:56:38,677 INFO L225 Difference]: With dead ends: 72 [2018-02-04 13:56:38,677 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 13:56:38,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:56:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 13:56:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 13:56:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 13:56:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-02-04 13:56:38,678 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-02-04 13:56:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:56:38,679 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-02-04 13:56:38,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:56:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-02-04 13:56:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 13:56:38,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:56:38,679 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:56:38,679 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 13:56:38,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1589707118, now seen corresponding path program 12 times [2018-02-04 13:56:38,679 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:56:38,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:56:38,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:38,680 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:56:38,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:56:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:56:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:56:38,737 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 13:56:38,749 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-04 13:56:38,751 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 13:56:38,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:56:38 BoogieIcfgContainer [2018-02-04 13:56:38,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:56:38,763 INFO L168 Benchmark]: Toolchain (without parser) took 23293.53 ms. Allocated memory was 414.2 MB in the beginning and 727.7 MB in the end (delta: 313.5 MB). Free memory was 371.1 MB in the beginning and 479.1 MB in the end (delta: -108.0 MB). Peak memory consumption was 205.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:56:38,764 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 414.2 MB. Free memory is still 377.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:56:38,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.15 ms. Allocated memory is still 414.2 MB. Free memory was 371.1 MB in the beginning and 357.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 13:56:38,765 INFO L168 Benchmark]: Boogie Preprocessor took 31.72 ms. Allocated memory is still 414.2 MB. Free memory was 357.8 MB in the beginning and 356.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:56:38,765 INFO L168 Benchmark]: RCFGBuilder took 214.03 ms. Allocated memory is still 414.2 MB. Free memory was 356.5 MB in the beginning and 333.2 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:56:38,765 INFO L168 Benchmark]: TraceAbstraction took 22886.13 ms. Allocated memory was 414.2 MB in the beginning and 727.7 MB in the end (delta: 313.5 MB). Free memory was 333.2 MB in the beginning and 479.1 MB in the end (delta: -145.9 MB). Peak memory consumption was 167.7 MB. Max. memory is 5.3 GB. [2018-02-04 13:56:38,766 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 414.2 MB. Free memory is still 377.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.15 ms. Allocated memory is still 414.2 MB. Free memory was 371.1 MB in the beginning and 357.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.72 ms. Allocated memory is still 414.2 MB. Free memory was 357.8 MB in the beginning and 356.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 214.03 ms. Allocated memory is still 414.2 MB. Free memory was 356.5 MB in the beginning and 333.2 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22886.13 ms. Allocated memory was 414.2 MB in the beginning and 727.7 MB in the end (delta: 313.5 MB). Free memory was 333.2 MB in the beginning and 479.1 MB in the end (delta: -145.9 MB). Peak memory consumption was 167.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1441]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1442] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={19:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={19:0}, malloc(size)={19:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={19:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={19:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={19:0}, memset(kobj, 0, sizeof(*kobj))={19:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={19:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={19:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={19:12}, kref={19:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={19:4}] [L1099] FCALL list->next = list VAL [list={19:4}, list={19:4}] [L1100] FCALL list->prev = list VAL [list={19:4}, list={19:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={19:0}, kobj={19:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1414] RET return kobj; VAL [\result={19:0}, kobj={19:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={19:0}] [L1437] RET kobj = ldv_kobject_create() [L1442] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 65 locations, 9 error locations. UNSAFE Result, 22.8s OverallTime, 26 OverallIterations, 16 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1289 SDtfs, 263 SDslu, 9962 SDs, 0 SdLazy, 2292 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1134 GetRequests, 826 SyntacticMatches, 1 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=25, 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, 25 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2061 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1958 ConstructedInterpolants, 53 QuantifiedInterpolants, 225017 SizeOfPredicates, 34 NumberOfNonLiveVariables, 3798 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 40 InterpolantComputations, 12 PerfectInterpolantSequences, 49/1396 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-56-38-772.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-56-38-772.csv Received shutdown request...