java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 21:08:02,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:08:02,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:08:02,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:08:02,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:08:02,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:08:02,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:08:02,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:08:02,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:08:02,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:08:02,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:08:02,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:08:02,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:08:02,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:08:02,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:08:02,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:08:02,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:08:02,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:08:02,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:08:02,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:08:02,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:08:02,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:08:02,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:08:02,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:08:02,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:08:02,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:08:02,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:08:02,928 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:08:02,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:08:02,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:08:02,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:08:02,929 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 21:08:02,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:08:02,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:08:02,946 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:08:02,946 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:08:02,946 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:08:02,946 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:08:02,953 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:08:02,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:08:02,954 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:08:02,954 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:08:02,954 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:08:02,954 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:08:02,954 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:08:02,954 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:08:02,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:08:02,955 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:08:02,955 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:08:02,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:08:02,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:08:02,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:08:02,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:08:02,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:08:02,956 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:08:02,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:08:02,956 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:08:02,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:08:02,995 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:08:02,998 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:08:03,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:08:03,000 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:08:03,000 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-02 21:08:03,145 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:08:03,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:08:03,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:08:03,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:08:03,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:08:03,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b8cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03, skipping insertion in model container [2018-02-02 21:08:03,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,171 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:08:03,215 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:08:03,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:08:03,324 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:08:03,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03 WrapperNode [2018-02-02 21:08:03,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:08:03,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:08:03,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:08:03,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:08:03,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (1/1) ... [2018-02-02 21:08:03,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:08:03,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:08:03,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:08:03,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:08:03,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (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-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 21:08:03,411 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 21:08:03,412 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 21:08:03,412 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:08:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:08:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:08:03,555 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 21:08:03,697 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:08:03,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:08:03 BoogieIcfgContainer [2018-02-02 21:08:03,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:08:03,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:08:03,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:08:03,701 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:08:03,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:08:03" (1/3) ... [2018-02-02 21:08:03,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be47338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:08:03, skipping insertion in model container [2018-02-02 21:08:03,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:03" (2/3) ... [2018-02-02 21:08:03,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be47338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:08:03, skipping insertion in model container [2018-02-02 21:08:03,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:08:03" (3/3) ... [2018-02-02 21:08:03,703 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-02-02 21:08:03,708 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:08:03,713 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 21:08:03,746 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:08:03,746 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:08:03,746 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:08:03,746 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:08:03,747 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:08:03,747 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:08:03,747 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:08:03,747 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:08:03,748 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:08:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-02 21:08:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:08:03,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:03,770 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:08:03,770 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-02 21:08:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash 13572496, now seen corresponding path program 1 times [2018-02-02 21:08:03,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:03,776 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:03,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:03,826 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:03,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:03,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:04,100 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-02 21:08:04,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:04,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:08:04,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:08:04,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:08:04,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:08:04,114 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-02-02 21:08:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:04,214 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-02-02 21:08:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:08:04,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:08:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:04,224 INFO L225 Difference]: With dead ends: 71 [2018-02-02 21:08:04,224 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 21:08:04,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:08:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 21:08:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-02-02 21:08:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 21:08:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-02 21:08:04,252 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 17 [2018-02-02 21:08:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:04,252 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-02 21:08:04,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:08:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-02 21:08:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:08:04,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:04,253 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-02 21:08:04,253 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-02 21:08:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash 64872882, now seen corresponding path program 1 times [2018-02-02 21:08:04,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:04,253 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:04,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:04,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:04,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:04,314 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-02 21:08:04,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:04,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:08:04,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:08:04,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:08:04,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:08:04,316 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-02-02 21:08:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:04,398 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-02 21:08:04,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:08:04,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 21:08:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:04,399 INFO L225 Difference]: With dead ends: 67 [2018-02-02 21:08:04,399 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 21:08:04,400 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-02 21:08:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 21:08:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-02 21:08:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 21:08:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-02 21:08:04,405 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 19 [2018-02-02 21:08:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:04,405 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-02 21:08:04,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:08:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-02 21:08:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:08:04,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:04,406 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-02 21:08:04,406 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-02 21:08:04,407 INFO L82 PathProgramCache]: Analyzing trace with hash 64872883, now seen corresponding path program 1 times [2018-02-02 21:08:04,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:04,407 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:04,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:04,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:04,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:04,569 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-02 21:08:04,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:04,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:08:04,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:08:04,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:08:04,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:08:04,570 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-02-02 21:08:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:04,675 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-02 21:08:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:08:04,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 21:08:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:04,677 INFO L225 Difference]: With dead ends: 66 [2018-02-02 21:08:04,677 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 21:08:04,677 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-02 21:08:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 21:08:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-02-02 21:08:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 21:08:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-02 21:08:04,682 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 19 [2018-02-02 21:08:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:04,682 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-02 21:08:04,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:08:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-02 21:08:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 21:08:04,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:04,683 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-02 21:08:04,684 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-02 21:08:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1610907055, now seen corresponding path program 1 times [2018-02-02 21:08:04,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:04,684 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:04,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,685 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:04,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:04,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:04,725 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-02 21:08:04,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:04,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:08:04,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:08:04,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:08:04,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:08:04,727 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2018-02-02 21:08:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:04,785 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-02-02 21:08:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:08:04,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 21:08:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:04,786 INFO L225 Difference]: With dead ends: 70 [2018-02-02 21:08:04,786 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 21:08:04,787 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-02 21:08:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 21:08:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 21:08:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 21:08:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-02 21:08:04,791 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-02-02 21:08:04,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:04,791 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-02 21:08:04,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:08:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-02 21:08:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 21:08:04,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:04,792 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-02 21:08:04,792 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-02 21:08:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash -655458449, now seen corresponding path program 1 times [2018-02-02 21:08:04,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:04,793 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:04,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:04,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:04,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:04,869 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-02 21:08:04,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:04,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:08:04,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:08:04,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:08:04,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:08:04,870 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2018-02-02 21:08:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:04,889 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-02 21:08:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:08:04,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 21:08:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:04,890 INFO L225 Difference]: With dead ends: 60 [2018-02-02 21:08:04,891 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 21:08:04,891 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-02 21:08:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 21:08:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 21:08:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 21:08:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-02 21:08:04,895 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 24 [2018-02-02 21:08:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:04,895 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-02 21:08:04,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:08:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-02 21:08:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 21:08:04,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:04,896 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-02 21:08:04,896 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-02 21:08:04,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666846, now seen corresponding path program 1 times [2018-02-02 21:08:04,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:04,897 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:04,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,898 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:04,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:04,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:04,985 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-02 21:08:04,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:04,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 21:08:04,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:08:04,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:08:04,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:08:04,986 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-02-02 21:08:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:05,133 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-02 21:08:05,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:08:05,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 21:08:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:05,135 INFO L225 Difference]: With dead ends: 59 [2018-02-02 21:08:05,135 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:08:05,136 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-02 21:08:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:08:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 21:08:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 21:08:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-02 21:08:05,140 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 34 [2018-02-02 21:08:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:05,140 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-02 21:08:05,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:08:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-02 21:08:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 21:08:05,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:05,141 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-02 21:08:05,141 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-02 21:08:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666845, now seen corresponding path program 1 times [2018-02-02 21:08:05,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:05,141 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:05,143 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:05,143 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:05,143 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:05,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:05,184 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-02 21:08:05,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:05,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:08:05,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:08:05,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:08:05,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:08:05,186 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-02-02 21:08:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:05,207 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-02 21:08:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:08:05,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 21:08:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:05,216 INFO L225 Difference]: With dead ends: 62 [2018-02-02 21:08:05,216 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 21:08:05,216 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-02 21:08:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 21:08:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 21:08:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 21:08:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-02 21:08:05,220 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-02-02 21:08:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:05,221 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-02 21:08:05,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:08:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-02 21:08:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 21:08:05,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:05,222 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-02 21:08:05,222 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-02 21:08:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1908152085, now seen corresponding path program 1 times [2018-02-02 21:08:05,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:05,222 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:05,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:05,223 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:05,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:05,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:05,275 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-02 21:08:05,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:05,275 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:05,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:05,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:05,334 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-02 21:08:05,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:05,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 21:08:05,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:08:05,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:08:05,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:08:05,336 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-02-02 21:08:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:05,357 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-02 21:08:05,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:08:05,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 21:08:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:05,358 INFO L225 Difference]: With dead ends: 63 [2018-02-02 21:08:05,358 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 21:08:05,358 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-02 21:08:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 21:08:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 21:08:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 21:08:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-02-02 21:08:05,362 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 35 [2018-02-02 21:08:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:05,362 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-02-02 21:08:05,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:08:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-02-02 21:08:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 21:08:05,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:05,363 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-02 21:08:05,363 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-02 21:08:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash -587259933, now seen corresponding path program 2 times [2018-02-02 21:08:05,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:05,363 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:05,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:05,365 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:05,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:05,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:05,409 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-02 21:08:05,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:05,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:05,411 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:08:05,450 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:08:05,450 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:05,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:05,488 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-02 21:08:05,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:08:05,508 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-02 21:08:05,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:08:05,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:08:05,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:08:05,794 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-02 21:08:05,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:08:05,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 20 [2018-02-02 21:08:05,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:08:05,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:08:05,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:08:05,796 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 20 states. [2018-02-02 21:08:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:06,150 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-02 21:08:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:08:06,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-02-02 21:08:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:06,151 INFO L225 Difference]: With dead ends: 63 [2018-02-02 21:08:06,151 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 21:08:06,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:08:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 21:08:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 21:08:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 21:08:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-02-02 21:08:06,154 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 36 [2018-02-02 21:08:06,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:06,155 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-02-02 21:08:06,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:08:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-02-02 21:08:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:08:06,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:06,156 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-02 21:08:06,156 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-02 21:08:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463170, now seen corresponding path program 1 times [2018-02-02 21:08:06,156 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:06,156 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:06,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:06,157 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:06,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:06,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:06,236 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-02 21:08:06,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:06,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 21:08:06,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:08:06,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:08:06,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:08:06,239 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 10 states. [2018-02-02 21:08:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:06,354 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-02 21:08:06,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:08:06,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 21:08:06,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:06,355 INFO L225 Difference]: With dead ends: 59 [2018-02-02 21:08:06,355 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:08:06,355 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-02 21:08:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:08:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 21:08:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 21:08:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-02 21:08:06,357 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 42 [2018-02-02 21:08:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:06,358 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-02 21:08:06,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:08:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-02 21:08:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:08:06,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:06,358 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-02 21:08:06,358 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-02 21:08:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463169, now seen corresponding path program 1 times [2018-02-02 21:08:06,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:06,359 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:06,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:06,360 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:06,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:06,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:06,414 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-02 21:08:06,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:06,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:06,415 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:06,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:06,450 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-02 21:08:06,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:06,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 21:08:06,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:08:06,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:08:06,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:08:06,451 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 8 states. [2018-02-02 21:08:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:06,472 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-02 21:08:06,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:08:06,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 21:08:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:06,474 INFO L225 Difference]: With dead ends: 62 [2018-02-02 21:08:06,474 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 21:08:06,474 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-02 21:08:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 21:08:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 21:08:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 21:08:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-02 21:08:06,477 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 42 [2018-02-02 21:08:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:06,478 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-02 21:08:06,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:08:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-02 21:08:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 21:08:06,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:06,479 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-02 21:08:06,479 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-02 21:08:06,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1854641017, now seen corresponding path program 2 times [2018-02-02 21:08:06,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:06,479 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:06,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:06,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:06,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:06,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:06,536 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-02 21:08:06,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:06,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:06,537 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:08:06,554 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:08:06,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:06,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:06,568 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-02 21:08:06,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:08:06,582 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-02 21:08:06,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:08:06,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:08:06,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:08:06,881 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-02 21:08:06,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:08:06,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-02 21:08:06,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:08:06,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:08:06,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:08:06,883 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 22 states. [2018-02-02 21:08:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:07,283 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-02-02 21:08:07,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 21:08:07,283 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-02 21:08:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:07,283 INFO L225 Difference]: With dead ends: 61 [2018-02-02 21:08:07,283 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:08:07,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 21:08:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:08:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 21:08:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 21:08:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-02 21:08:07,286 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 43 [2018-02-02 21:08:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:07,286 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-02 21:08:07,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 21:08:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-02 21:08:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:08:07,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:07,286 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-02 21:08:07,287 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-02 21:08:07,287 INFO L82 PathProgramCache]: Analyzing trace with hash -796850259, now seen corresponding path program 1 times [2018-02-02 21:08:07,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:07,287 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:07,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,288 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:07,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:07,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:07,342 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-02 21:08:07,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:07,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 21:08:07,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:08:07,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:08:07,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:08:07,343 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 8 states. [2018-02-02 21:08:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:07,374 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-02-02 21:08:07,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:08:07,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 21:08:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:07,375 INFO L225 Difference]: With dead ends: 61 [2018-02-02 21:08:07,375 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:08:07,375 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-02 21:08:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:08:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 21:08:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 21:08:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-02-02 21:08:07,378 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 42 [2018-02-02 21:08:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:07,378 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-02-02 21:08:07,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:08:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-02-02 21:08:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 21:08:07,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:07,379 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-02 21:08:07,379 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-02 21:08:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1073611946, now seen corresponding path program 1 times [2018-02-02 21:08:07,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:07,380 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:07,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,381 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:07,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:07,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:07,449 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-02 21:08:07,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:07,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 21:08:07,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:08:07,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:08:07,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:08:07,450 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 10 states. [2018-02-02 21:08:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:07,502 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-02 21:08:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:08:07,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-02-02 21:08:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:07,503 INFO L225 Difference]: With dead ends: 63 [2018-02-02 21:08:07,503 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:08:07,503 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-02 21:08:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:08:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 21:08:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 21:08:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-02 21:08:07,505 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 47 [2018-02-02 21:08:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:07,505 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-02 21:08:07,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:08:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-02 21:08:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 21:08:07,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:07,506 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-02 21:08:07,506 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-02 21:08:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash 348696970, now seen corresponding path program 1 times [2018-02-02 21:08:07,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:07,506 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:07,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:07,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:07,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:07,554 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-02 21:08:07,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:07,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:07,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:07,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:07,586 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-02 21:08:07,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:07,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-02 21:08:07,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:08:07,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:08:07,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:08:07,587 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 10 states. [2018-02-02 21:08:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:07,602 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-02-02 21:08:07,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:08:07,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-02 21:08:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:07,602 INFO L225 Difference]: With dead ends: 62 [2018-02-02 21:08:07,602 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 21:08:07,602 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-02 21:08:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 21:08:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 21:08:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 21:08:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-02 21:08:07,604 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-02-02 21:08:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:07,604 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-02 21:08:07,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:08:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-02 21:08:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 21:08:07,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:07,605 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-02 21:08:07,605 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-02 21:08:07,605 INFO L82 PathProgramCache]: Analyzing trace with hash -648862830, now seen corresponding path program 2 times [2018-02-02 21:08:07,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:07,605 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:07,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,606 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:07,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:07,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:07,673 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-02 21:08:07,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:07,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:07,674 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:08:07,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:08:07,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:07,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:07,728 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-02 21:08:07,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:07,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-02-02 21:08:07,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:08:07,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:08:07,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:08:07,729 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2018-02-02 21:08:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:07,753 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-02 21:08:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:08:07,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-02 21:08:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:07,754 INFO L225 Difference]: With dead ends: 63 [2018-02-02 21:08:07,754 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 21:08:07,754 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-02 21:08:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 21:08:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 21:08:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 21:08:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-02-02 21:08:07,756 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-02-02 21:08:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:07,757 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-02-02 21:08:07,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:08:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-02-02 21:08:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 21:08:07,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:07,758 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-02 21:08:07,758 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-02 21:08:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1508445558, now seen corresponding path program 3 times [2018-02-02 21:08:07,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:07,758 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:07,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,759 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:07,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:07,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:07,831 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-02 21:08:07,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:07,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:07,832 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:08:07,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-02 21:08:07,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:07,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:07,872 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-02 21:08:07,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:07,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-02 21:08:07,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:08:07,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:08:07,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:08:07,873 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 12 states. [2018-02-02 21:08:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:07,897 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-02-02 21:08:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:08:07,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-02-02 21:08:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:07,897 INFO L225 Difference]: With dead ends: 64 [2018-02-02 21:08:07,897 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 21:08:07,898 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-02 21:08:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 21:08:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-02 21:08:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 21:08:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-02-02 21:08:07,900 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-02-02 21:08:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:07,900 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-02-02 21:08:07,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:08:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-02-02 21:08:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 21:08:07,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:07,900 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-02 21:08:07,900 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-02 21:08:07,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1909260946, now seen corresponding path program 4 times [2018-02-02 21:08:07,901 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:07,901 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:07,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,902 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:07,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:07,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:07,984 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-02 21:08:07,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:07,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:07,985 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:08:08,007 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:08:08,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:08,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:08,027 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-02 21:08:08,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:08,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-02-02 21:08:08,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:08:08,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:08:08,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:08:08,028 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 13 states. [2018-02-02 21:08:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:08,054 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-02-02 21:08:08,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:08:08,054 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-02 21:08:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:08,055 INFO L225 Difference]: With dead ends: 65 [2018-02-02 21:08:08,055 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 21:08:08,055 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-02 21:08:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 21:08:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-02 21:08:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 21:08:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-02 21:08:08,057 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-02-02 21:08:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:08,057 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-02 21:08:08,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:08:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-02 21:08:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 21:08:08,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:08,058 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-02 21:08:08,058 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-02 21:08:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash 483980170, now seen corresponding path program 5 times [2018-02-02 21:08:08,058 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:08,058 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:08,059 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,059 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:08,059 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:08,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:08,153 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-02 21:08:08,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:08,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:08,154 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:08:08,168 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-02 21:08:08,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:08,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:08,186 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-02 21:08:08,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:08,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-02 21:08:08,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:08:08,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:08:08,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:08:08,188 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-02-02 21:08:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:08,213 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-02-02 21:08:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:08:08,213 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-02 21:08:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:08,214 INFO L225 Difference]: With dead ends: 66 [2018-02-02 21:08:08,214 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 21:08:08,214 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-02 21:08:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 21:08:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-02 21:08:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 21:08:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-02 21:08:08,215 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-02-02 21:08:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:08,216 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-02 21:08:08,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:08:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-02 21:08:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 21:08:08,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:08,216 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-02 21:08:08,216 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-02 21:08:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash -750050926, now seen corresponding path program 6 times [2018-02-02 21:08:08,217 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:08,217 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:08,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,218 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:08,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:08,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:08,292 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-02 21:08:08,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:08,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:08,293 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:08:08,313 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-02 21:08:08,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:08,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:08,331 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-02 21:08:08,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:08,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-02 21:08:08,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:08:08,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:08:08,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:08:08,333 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 15 states. [2018-02-02 21:08:08,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:08,377 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-02 21:08:08,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:08:08,378 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-02 21:08:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:08,379 INFO L225 Difference]: With dead ends: 67 [2018-02-02 21:08:08,379 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 21:08:08,379 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-02 21:08:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 21:08:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-02 21:08:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 21:08:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-02-02 21:08:08,381 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-02-02 21:08:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:08,382 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-02-02 21:08:08,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:08:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-02-02 21:08:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 21:08:08,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:08,383 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-02 21:08:08,383 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-02 21:08:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash -350309238, now seen corresponding path program 7 times [2018-02-02 21:08:08,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:08,383 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:08,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,384 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:08,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:08,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:08,511 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-02 21:08:08,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:08,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:08,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:08,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:08,538 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-02 21:08:08,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:08,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-02 21:08:08,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 21:08:08,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 21:08:08,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:08:08,540 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 16 states. [2018-02-02 21:08:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:08,577 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-02 21:08:08,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:08:08,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2018-02-02 21:08:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:08,578 INFO L225 Difference]: With dead ends: 68 [2018-02-02 21:08:08,578 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 21:08:08,579 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-02 21:08:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 21:08:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-02 21:08:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 21:08:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-02-02 21:08:08,581 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-02-02 21:08:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:08,581 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-02-02 21:08:08,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 21:08:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-02-02 21:08:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 21:08:08,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:08,582 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-02 21:08:08,582 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-02 21:08:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -843218798, now seen corresponding path program 8 times [2018-02-02 21:08:08,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:08,584 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:08,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:08,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:08,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:08,702 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-02 21:08:08,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:08,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:08,703 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:08:08,723 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:08:08,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:08,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:08,740 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-02 21:08:08,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:08,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-02 21:08:08,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:08:08,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:08:08,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:08:08,742 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 17 states. [2018-02-02 21:08:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:08,775 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-02-02 21:08:08,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 21:08:08,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-02-02 21:08:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:08,778 INFO L225 Difference]: With dead ends: 69 [2018-02-02 21:08:08,778 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 21:08:08,778 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-02 21:08:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 21:08:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 21:08:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 21:08:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-02-02 21:08:08,781 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-02-02 21:08:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:08,781 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-02-02 21:08:08,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:08:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-02-02 21:08:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 21:08:08,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:08,782 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-02 21:08:08,782 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-02 21:08:08,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1056454026, now seen corresponding path program 9 times [2018-02-02 21:08:08,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:08,782 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:08,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,783 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:08,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:08,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:08,946 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-02 21:08:08,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:08,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:08,947 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:08:08,979 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-02-02 21:08:08,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:08,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:09,003 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-02 21:08:09,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:09,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-02 21:08:09,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:08:09,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:08:09,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:08:09,004 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 18 states. [2018-02-02 21:08:09,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:09,038 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-02-02 21:08:09,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:08:09,039 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-02 21:08:09,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:09,039 INFO L225 Difference]: With dead ends: 70 [2018-02-02 21:08:09,039 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 21:08:09,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:08:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 21:08:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-02 21:08:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 21:08:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-02 21:08:09,042 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-02-02 21:08:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:09,042 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-02 21:08:09,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:08:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-02 21:08:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 21:08:09,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:09,043 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-02 21:08:09,043 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-02 21:08:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash -183230574, now seen corresponding path program 10 times [2018-02-02 21:08:09,043 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:09,043 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:09,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:09,044 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:09,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:09,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:09,189 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-02 21:08:09,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:09,189 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:09,190 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:08:09,210 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:08:09,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:09,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:09,237 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-02 21:08:09,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:09,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-02 21:08:09,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 21:08:09,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 21:08:09,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:08:09,239 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 19 states. [2018-02-02 21:08:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:09,269 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-02-02 21:08:09,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:08:09,269 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-02 21:08:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:09,270 INFO L225 Difference]: With dead ends: 71 [2018-02-02 21:08:09,270 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 21:08:09,270 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-02 21:08:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 21:08:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-02 21:08:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 21:08:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-02-02 21:08:09,272 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-02-02 21:08:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:09,272 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-02-02 21:08:09,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 21:08:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-02-02 21:08:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 21:08:09,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:09,273 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-02 21:08:09,273 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-02 21:08:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash 41252490, now seen corresponding path program 11 times [2018-02-02 21:08:09,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:09,274 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:09,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:09,274 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:09,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:09,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:09,417 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-02 21:08:09,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:09,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:09,419 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:08:09,443 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-02-02 21:08:09,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:08:09,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:09,458 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-02 21:08:09,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:09,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-02-02 21:08:09,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:08:09,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:08:09,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:08:09,459 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 20 states. [2018-02-02 21:08:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:09,493 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-02-02 21:08:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:08:09,494 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-02-02 21:08:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:09,494 INFO L225 Difference]: With dead ends: 72 [2018-02-02 21:08:09,494 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 21:08:09,495 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-02 21:08:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 21:08:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 21:08:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 21:08:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-02-02 21:08:09,497 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-02-02 21:08:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:09,497 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-02-02 21:08:09,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:08:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-02-02 21:08:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 21:08:09,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:09,498 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-02 21:08:09,498 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-02 21:08:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1589707118, now seen corresponding path program 12 times [2018-02-02 21:08:09,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:09,498 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:09,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:09,499 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:08:09,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 21:08:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 21:08:09,557 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 21:08:09,567 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-02 21:08:09,569 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 21:08:09,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:08:09 BoogieIcfgContainer [2018-02-02 21:08:09,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 21:08:09,581 INFO L168 Benchmark]: Toolchain (without parser) took 6435.74 ms. Allocated memory was 390.1 MB in the beginning and 711.5 MB in the end (delta: 321.4 MB). Free memory was 346.9 MB in the beginning and 445.4 MB in the end (delta: -98.5 MB). Peak memory consumption was 222.9 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:09,582 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 390.1 MB. Free memory is still 353.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:08:09,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.50 ms. Allocated memory is still 390.1 MB. Free memory was 346.9 MB in the beginning and 333.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:09,582 INFO L168 Benchmark]: Boogie Preprocessor took 32.80 ms. Allocated memory is still 390.1 MB. Free memory was 333.7 MB in the beginning and 332.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:09,582 INFO L168 Benchmark]: RCFGBuilder took 331.20 ms. Allocated memory is still 390.1 MB. Free memory was 332.4 MB in the beginning and 309.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:09,583 INFO L168 Benchmark]: TraceAbstraction took 5881.92 ms. Allocated memory was 390.1 MB in the beginning and 711.5 MB in the end (delta: 321.4 MB). Free memory was 309.1 MB in the beginning and 445.4 MB in the end (delta: -136.3 MB). Peak memory consumption was 185.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:09,584 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.13 ms. Allocated memory is still 390.1 MB. Free memory is still 353.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 186.50 ms. Allocated memory is still 390.1 MB. Free memory was 346.9 MB in the beginning and 333.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.80 ms. Allocated memory is still 390.1 MB. Free memory was 333.7 MB in the beginning and 332.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 331.20 ms. Allocated memory is still 390.1 MB. Free memory was 332.4 MB in the beginning and 309.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5881.92 ms. Allocated memory was 390.1 MB in the beginning and 711.5 MB in the end (delta: 321.4 MB). Free memory was 309.1 MB in the beginning and 445.4 MB in the end (delta: -136.3 MB). Peak memory consumption was 185.1 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: - UnprovableResult [Line: 1441]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1441. Possible 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, 5.8s OverallTime, 26 OverallIterations, 16 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1291 SDtfs, 251 SDslu, 7944 SDs, 0 SdLazy, 2139 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1134 GetRequests, 843 SyntacticMatches, 2 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.2s 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2061 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1958 ConstructedInterpolants, 20 QuantifiedInterpolants, 181342 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3798 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 40 InterpolantComputations, 12 PerfectInterpolantSequences, 49/1396 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces 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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_21-08-09-589.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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_21-08-09-589.csv Received shutdown request...