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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:06:36,523 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:06:36,525 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:06:36,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:06:36,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:06:36,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:06:36,543 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:06:36,544 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:06:36,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:06:36,547 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:06:36,548 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:06:36,548 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:06:36,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:06:36,550 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:06:36,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:06:36,554 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:06:36,556 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:06:36,558 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:06:36,559 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:06:36,560 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:06:36,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:06:36,563 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:06:36,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:06:36,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:06:36,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:06:36,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:06:36,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:06:36,567 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:06:36,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:06:36,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:06:36,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:06:36,568 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:06:36,576 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:06:36,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:06:36,577 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:06:36,578 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:06:36,578 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:06:36,578 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:06:36,578 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:06:36,578 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:06:36,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:06:36,579 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:06:36,579 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:06:36,579 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:06:36,579 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:06:36,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:06:36,579 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:06:36,580 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:06:36,580 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:06:36,580 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:06:36,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:06:36,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:06:36,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:06:36,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:06:36,581 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:06:36,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:06:36,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:06:36,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:06:36,581 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:06:36,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:06:36,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:06:36,582 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:06:36,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:06:36,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:06:36,582 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:06:36,582 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:06:36,583 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:06:36,583 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:06:36,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:06:36,624 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:06:36,628 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:06:36,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:06:36,629 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:06:36,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-25 06:06:36,828 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:06:36,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:06:36,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:06:36,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:06:36,843 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:06:36,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:06:36" (1/1) ... [2018-01-25 06:06:36,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be9a57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:36, skipping insertion in model container [2018-01-25 06:06:36,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:06:36" (1/1) ... [2018-01-25 06:06:36,865 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:06:36,915 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:06:37,019 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:06:37,036 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:06:37,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37 WrapperNode [2018-01-25 06:06:37,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:06:37,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:06:37,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:06:37,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:06:37,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (1/1) ... [2018-01-25 06:06:37,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (1/1) ... [2018-01-25 06:06:37,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (1/1) ... [2018-01-25 06:06:37,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (1/1) ... [2018-01-25 06:06:37,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (1/1) ... [2018-01-25 06:06:37,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (1/1) ... [2018-01-25 06:06:37,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (1/1) ... [2018-01-25 06:06:37,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:06:37,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:06:37,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:06:37,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:06:37,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (1/1) ... No working directory specified, using /storage/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-01-25 06:06:37,132 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:06:37,133 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:06:37,134 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:06:37,134 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:06:37,134 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:06:37,134 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:06:37,134 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:06:37,134 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:06:37,134 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:06:37,134 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 06:06:37,134 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 06:06:37,135 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:06:37,135 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:06:37,135 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 06:06:37,135 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:06:37,135 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:06:37,136 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 06:06:37,136 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 06:06:37,136 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 06:06:37,136 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 06:06:37,136 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:06:37,136 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:06:37,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:06:37,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:06:37,276 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:06:37,365 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:06:37,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:06:37 BoogieIcfgContainer [2018-01-25 06:06:37,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:06:37,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:06:37,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:06:37,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:06:37,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:06:36" (1/3) ... [2018-01-25 06:06:37,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ad5d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:06:37, skipping insertion in model container [2018-01-25 06:06:37,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:37" (2/3) ... [2018-01-25 06:06:37,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ad5d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:06:37, skipping insertion in model container [2018-01-25 06:06:37,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:06:37" (3/3) ... [2018-01-25 06:06:37,372 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-25 06:06:37,381 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:06:37,388 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 06:06:37,427 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:06:37,428 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:06:37,428 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:06:37,428 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:06:37,428 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:06:37,428 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:06:37,429 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:06:37,429 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:06:37,430 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:06:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-25 06:06:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:06:37,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:37,455 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:37,455 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-01-25 06:06:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash 13572496, now seen corresponding path program 1 times [2018-01-25 06:06:37,461 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:37,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:37,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:37,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:37,505 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:37,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:37,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:37,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:06:37,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:37,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:06:37,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:06:37,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:06:37,777 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-25 06:06:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:37,829 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-01-25 06:06:37,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:06:37,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:06:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:37,840 INFO L225 Difference]: With dead ends: 118 [2018-01-25 06:06:37,841 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 06:06:37,843 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:06:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 06:06:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-01-25 06:06:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 06:06:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-25 06:06:37,888 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 17 [2018-01-25 06:06:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:37,889 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-25 06:06:37,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:06:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-25 06:06:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:06:37,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:37,890 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:37,890 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-01-25 06:06:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 64872882, now seen corresponding path program 1 times [2018-01-25 06:06:37,891 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:37,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:37,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:37,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:37,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:37,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:38,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:38,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:06:38,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:38,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:06:38,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:06:38,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:06:38,012 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-01-25 06:06:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:38,158 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-01-25 06:06:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:06:38,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:06:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:38,161 INFO L225 Difference]: With dead ends: 68 [2018-01-25 06:06:38,162 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 06:06:38,162 INFO L525 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-01-25 06:06:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 06:06:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-01-25 06:06:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-25 06:06:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-25 06:06:38,172 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 19 [2018-01-25 06:06:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:38,173 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-25 06:06:38,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:06:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-25 06:06:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:06:38,174 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:38,174 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:38,174 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-01-25 06:06:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash 64872883, now seen corresponding path program 1 times [2018-01-25 06:06:38,175 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:38,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:38,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:38,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:38,177 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:38,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:38,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:38,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:06:38,472 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:38,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:06:38,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:06:38,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:06:38,473 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-01-25 06:06:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:38,637 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-25 06:06:38,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:06:38,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 06:06:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:38,639 INFO L225 Difference]: With dead ends: 67 [2018-01-25 06:06:38,639 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 06:06:38,640 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:06:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 06:06:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-01-25 06:06:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 06:06:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-25 06:06:38,649 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 19 [2018-01-25 06:06:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:38,650 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-25 06:06:38,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:06:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-25 06:06:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:06:38,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:38,651 INFO L322 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-01-25 06:06:38,651 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-01-25 06:06:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1610907055, now seen corresponding path program 1 times [2018-01-25 06:06:38,652 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:38,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:38,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:38,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:38,654 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:38,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:38,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:38,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:06:38,706 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:38,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:06:38,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:06:38,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:06:38,707 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2018-01-25 06:06:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:38,761 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-01-25 06:06:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:06:38,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-25 06:06:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:38,763 INFO L225 Difference]: With dead ends: 71 [2018-01-25 06:06:38,763 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 06:06:38,763 INFO L525 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-01-25 06:06:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 06:06:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 06:06:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 06:06:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-25 06:06:38,773 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-01-25 06:06:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:38,773 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-25 06:06:38,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:06:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-25 06:06:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:06:38,774 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:38,774 INFO L322 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-01-25 06:06:38,775 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-01-25 06:06:38,775 INFO L82 PathProgramCache]: Analyzing trace with hash -655458449, now seen corresponding path program 1 times [2018-01-25 06:06:38,775 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:38,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:38,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:38,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:38,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:38,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:38,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:38,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:06:38,832 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:38,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:06:38,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:06:38,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:06:38,833 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2018-01-25 06:06:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:38,859 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-25 06:06:38,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:06:38,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 06:06:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:38,861 INFO L225 Difference]: With dead ends: 67 [2018-01-25 06:06:38,862 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 06:06:38,862 INFO L525 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-01-25 06:06:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 06:06:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 06:06:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 06:06:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-25 06:06:38,869 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 24 [2018-01-25 06:06:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:38,869 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-25 06:06:38,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:06:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-25 06:06:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:06:38,870 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:38,870 INFO L322 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-01-25 06:06:38,870 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-01-25 06:06:38,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666846, now seen corresponding path program 1 times [2018-01-25 06:06:38,870 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:38,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:38,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:38,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:38,871 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:38,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:38,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:38,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:06:38,962 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:38,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:38,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:38,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:38,963 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-01-25 06:06:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:39,184 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-25 06:06:39,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:39,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-25 06:06:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:39,185 INFO L225 Difference]: With dead ends: 60 [2018-01-25 06:06:39,186 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 06:06:39,186 INFO L525 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-01-25 06:06:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 06:06:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 06:06:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 06:06:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-25 06:06:39,194 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 34 [2018-01-25 06:06:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:39,194 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-25 06:06:39,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-25 06:06:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:06:39,196 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:39,196 INFO L322 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-01-25 06:06:39,196 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-01-25 06:06:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666845, now seen corresponding path program 1 times [2018-01-25 06:06:39,196 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:39,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:39,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:39,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:39,198 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:39,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:39,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:39,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:06:39,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:39,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:06:39,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:06:39,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:06:39,240 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-01-25 06:06:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:39,302 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-01-25 06:06:39,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:06:39,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-25 06:06:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:39,303 INFO L225 Difference]: With dead ends: 97 [2018-01-25 06:06:39,303 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 06:06:39,304 INFO L525 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-01-25 06:06:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 06:06:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 06:06:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 06:06:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-25 06:06:39,312 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-01-25 06:06:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:39,313 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-25 06:06:39,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:06:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-25 06:06:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:06:39,314 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:39,314 INFO L322 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-01-25 06:06:39,314 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-01-25 06:06:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1908152085, now seen corresponding path program 1 times [2018-01-25 06:06:39,315 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:39,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:39,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:39,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:39,316 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:39,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:39,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:39,399 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:39,400 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:06:39,401 INFO L201 CegarAbsIntRunner]: [0], [3], [5], [7], [11], [15], [19], [20], [24], [26], [27], [39], [42], [43], [44], [46], [47], [52], [55], [56], [60], [64], [68], [72], [73], [74], [75], [76], [78], [80], [82], [83], [84], [86], [88] [2018-01-25 06:06:39,443 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:39,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:42,552 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:42,554 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-25 06:06:42,565 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:42,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:42,565 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:42,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:42,577 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:42,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:42,682 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:42,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:42,796 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:42,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:42,800 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:42,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:42,887 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:42,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:42,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-25 06:06:42,941 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:42,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:06:42,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:06:42,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:06:42,943 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-01-25 06:06:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:43,001 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-01-25 06:06:43,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:06:43,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 06:06:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:43,003 INFO L225 Difference]: With dead ends: 98 [2018-01-25 06:06:43,004 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 06:06:43,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 06:06:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 06:06:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 06:06:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-25 06:06:43,012 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 35 [2018-01-25 06:06:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:43,012 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-25 06:06:43,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:06:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-25 06:06:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:06:43,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:43,014 INFO L322 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-01-25 06:06:43,014 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-01-25 06:06:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash -587259933, now seen corresponding path program 2 times [2018-01-25 06:06:43,015 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:43,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:43,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:43,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:43,016 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:43,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:43,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:43,104 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:43,104 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:43,104 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:43,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:43,104 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:43,115 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:43,115 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:43,144 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:43,148 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:43,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:43,193 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-01-25 06:06:43,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:43,216 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-01-25 06:06:43,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:43,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:06:43,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:06:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:06:43,937 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:06:46,434 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:06:46,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-25 06:06:46,434 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:46,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:06:46,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:06:46,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=839, Unknown=1, NotChecked=0, Total=930 [2018-01-25 06:06:46,435 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 15 states. [2018-01-25 06:06:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:47,037 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-01-25 06:06:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:06:47,038 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 06:06:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:47,038 INFO L225 Difference]: With dead ends: 61 [2018-01-25 06:06:47,039 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 06:06:47,039 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=118, Invalid=1071, Unknown=1, NotChecked=0, Total=1190 [2018-01-25 06:06:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 06:06:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 06:06:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 06:06:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-25 06:06:47,050 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 36 [2018-01-25 06:06:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:47,051 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-25 06:06:47,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:06:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-25 06:06:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:06:47,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:47,052 INFO L322 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, 1, 1, 1, 1, 1] [2018-01-25 06:06:47,052 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-01-25 06:06:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash -789525114, now seen corresponding path program 1 times [2018-01-25 06:06:47,052 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:47,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:47,054 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:47,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:47,054 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:47,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:06:47,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:47,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:06:47,205 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:47,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:47,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:47,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:47,206 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-01-25 06:06:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:47,390 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-25 06:06:47,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:47,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-25 06:06:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:47,392 INFO L225 Difference]: With dead ends: 60 [2018-01-25 06:06:47,392 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 06:06:47,392 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:06:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 06:06:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-25 06:06:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 06:06:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-25 06:06:47,400 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 41 [2018-01-25 06:06:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:47,401 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-25 06:06:47,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-25 06:06:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:06:47,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:47,402 INFO L322 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, 1, 1, 1, 1, 1] [2018-01-25 06:06:47,403 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-01-25 06:06:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash -789525113, now seen corresponding path program 1 times [2018-01-25 06:06:47,403 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:47,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:47,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:47,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:47,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:47,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:47,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:47,477 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:47,477 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 06:06:47,478 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [11], [15], [19], [20], [24], [26], [27], [31], [34], [39], [42], [43], [44], [46], [47], [52], [55], [56], [60], [64], [68], [72], [73], [74], [75], [76], [78], [80], [82], [83], [84], [86], [88], [89], [90] [2018-01-25 06:06:47,479 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:47,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:50,883 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:50,884 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-25 06:06:50,894 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:50,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:50,894 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:50,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:50,900 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:50,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:50,933 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:51,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:51,066 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:51,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:51,069 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:51,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:51,123 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:51,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:51,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-25 06:06:51,165 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:51,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:06:51,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:06:51,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:06:51,166 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 7 states. [2018-01-25 06:06:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:51,203 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-01-25 06:06:51,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:06:51,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-25 06:06:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:51,204 INFO L225 Difference]: With dead ends: 93 [2018-01-25 06:06:51,204 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 06:06:51,205 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:06:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 06:06:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 06:06:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 06:06:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-25 06:06:51,215 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 41 [2018-01-25 06:06:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:51,215 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-25 06:06:51,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:06:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-25 06:06:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:06:51,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:51,217 INFO L322 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-01-25 06:06:51,217 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-01-25 06:06:51,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463169, now seen corresponding path program 2 times [2018-01-25 06:06:51,217 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:51,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:51,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:51,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:51,219 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:51,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:51,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:51,288 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:51,288 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:51,288 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:51,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:51,288 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:51,294 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:51,294 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:51,313 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:51,316 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:51,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:51,331 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-01-25 06:06:51,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:51,351 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-01-25 06:06:51,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:51,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:06:51,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:06:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:51,868 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:52,285 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:06:52,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-25 06:06:52,286 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:52,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:06:52,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:06:52,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 06:06:52,287 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 16 states. [2018-01-25 06:06:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:52,742 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-01-25 06:06:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:06:52,743 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-25 06:06:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:52,743 INFO L225 Difference]: With dead ends: 59 [2018-01-25 06:06:52,744 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 06:06:52,744 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 06:06:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 06:06:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 06:06:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 06:06:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-25 06:06:52,752 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 42 [2018-01-25 06:06:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:52,753 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-25 06:06:52,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:06:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-25 06:06:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 06:06:52,753 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:52,753 INFO L322 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] [2018-01-25 06:06:52,754 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-01-25 06:06:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1869907629, now seen corresponding path program 1 times [2018-01-25 06:06:52,754 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:52,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:52,755 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:52,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:52,755 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:52,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:52,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:52,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:06:52,829 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:52,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:06:52,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:06:52,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:06:52,830 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-01-25 06:06:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:52,872 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-01-25 06:06:52,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:06:52,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-01-25 06:06:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:52,873 INFO L225 Difference]: With dead ends: 67 [2018-01-25 06:06:52,873 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 06:06:52,874 INFO L525 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-01-25 06:06:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 06:06:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 06:06:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 06:06:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-25 06:06:52,882 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 40 [2018-01-25 06:06:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:52,882 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-25 06:06:52,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:06:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-25 06:06:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 06:06:52,883 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:52,883 INFO L322 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, 1, 1, 1] [2018-01-25 06:06:52,883 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-01-25 06:06:52,883 INFO L82 PathProgramCache]: Analyzing trace with hash 946199638, now seen corresponding path program 1 times [2018-01-25 06:06:52,883 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:52,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:52,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:52,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:52,884 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:52,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:52,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:52,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:06:52,997 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:52,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:52,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:52,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:52,998 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 10 states. [2018-01-25 06:06:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:53,064 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-01-25 06:06:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:53,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-25 06:06:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:53,064 INFO L225 Difference]: With dead ends: 69 [2018-01-25 06:06:53,065 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 06:06:53,065 INFO L525 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-01-25 06:06:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 06:06:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 06:06:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 06:06:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-01-25 06:06:53,073 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 45 [2018-01-25 06:06:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:53,073 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-01-25 06:06:53,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-01-25 06:06:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-25 06:06:53,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:53,074 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:53,074 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-01-25 06:06:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1294061430, now seen corresponding path program 1 times [2018-01-25 06:06:53,074 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:53,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:53,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:53,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:53,075 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:53,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:53,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:53,142 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:53,142 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-25 06:06:53,142 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [11], [15], [17], [18], [19], [20], [24], [26], [27], [30], [31], [32], [35], [38], [39], [42], [43], [44], [46], [47], [52], [54], [55], [56], [60], [62], [63], [64], [68], [71], [72], [73], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [86], [87], [88], [89], [90], [91] [2018-01-25 06:06:53,144 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:53,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:55,816 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:55,816 INFO L268 AbstractInterpreter]: Visited 54 different actions 62 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-25 06:06:55,819 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:55,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:55,819 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:55,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:55,824 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:55,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:55,864 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:55,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:56,008 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:56,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:56,012 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:56,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:56,067 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:56,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:56,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 06:06:56,148 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:56,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:06:56,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:06:56,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:06:56,149 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 8 states. [2018-01-25 06:06:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:56,175 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-01-25 06:06:56,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:06:56,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-25 06:06:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:56,175 INFO L225 Difference]: With dead ends: 90 [2018-01-25 06:06:56,175 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 06:06:56,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:06:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 06:06:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-25 06:06:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 06:06:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-01-25 06:06:56,184 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-01-25 06:06:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:56,184 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-01-25 06:06:56,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:06:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-01-25 06:06:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-25 06:06:56,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:56,186 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:56,186 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-01-25 06:06:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash -34765678, now seen corresponding path program 2 times [2018-01-25 06:06:56,186 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:56,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:56,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,187 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:56,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:56,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:56,319 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:56,319 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:56,319 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:56,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:56,320 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:56,327 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:56,328 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:56,351 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:56,359 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:56,360 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:56,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:56,386 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:56,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-01-25 06:06:56,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:56,557 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:56,560 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:56,560 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:56,591 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:56,621 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:56,638 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:56,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:56,650 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:56,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:56,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-25 06:06:56,737 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:56,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:06:56,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:06:56,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:06:56,738 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 9 states. [2018-01-25 06:06:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:56,763 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-01-25 06:06:56,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:06:56,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-01-25 06:06:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:56,764 INFO L225 Difference]: With dead ends: 91 [2018-01-25 06:06:56,764 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 06:06:56,764 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:06:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 06:06:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 06:06:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 06:06:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-01-25 06:06:56,772 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-01-25 06:06:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:56,772 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-01-25 06:06:56,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:06:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-01-25 06:06:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-25 06:06:56,773 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:56,773 INFO L322 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-01-25 06:06:56,773 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-01-25 06:06:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash 348696970, now seen corresponding path program 3 times [2018-01-25 06:06:56,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:56,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,774 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:56,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:56,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:56,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:56,915 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:56,916 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:56,916 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:56,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:56,916 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:56,925 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 06:06:56,926 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 06:06:56,956 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:06:56,966 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:06:56,986 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:06:57,143 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:06:57,144 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:57,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:57,164 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:57,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:57,359 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:57,362 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 06:06:57,362 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 06:06:57,393 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:06:57,421 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:06:57,544 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:06:57,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:06:57,895 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:57,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:57,906 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:58,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:58,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 17 [2018-01-25 06:06:58,044 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:58,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:58,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:58,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:06:58,045 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 10 states. [2018-01-25 06:06:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:58,068 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-01-25 06:06:58,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:06:58,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-01-25 06:06:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:58,069 INFO L225 Difference]: With dead ends: 92 [2018-01-25 06:06:58,069 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 06:06:58,069 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:06:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 06:06:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 06:06:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 06:06:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-01-25 06:06:58,076 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-01-25 06:06:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:58,077 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-01-25 06:06:58,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-01-25 06:06:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-25 06:06:58,077 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:58,077 INFO L322 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-01-25 06:06:58,077 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-01-25 06:06:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash -648862830, now seen corresponding path program 4 times [2018-01-25 06:06:58,078 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:58,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:58,079 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:58,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:58,079 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:58,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:58,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:58,173 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:58,173 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:58,173 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:58,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:58,173 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:58,188 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 06:06:58,188 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 06:06:58,238 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:58,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:58,265 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:58,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:58,480 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:58,484 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 06:06:58,484 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 06:06:58,570 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:58,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:58,581 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:58,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-01-25 06:06:58,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:58,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 19 [2018-01-25 06:06:58,675 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:58,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:06:58,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:06:58,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-25 06:06:58,675 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2018-01-25 06:06:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:58,707 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-01-25 06:06:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:58,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-01-25 06:06:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:58,708 INFO L225 Difference]: With dead ends: 93 [2018-01-25 06:06:58,708 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 06:06:58,708 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=213, Unknown=0, NotChecked=0, Total=380 [2018-01-25 06:06:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 06:06:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 06:06:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 06:06:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-01-25 06:06:58,716 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-01-25 06:06:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:58,716 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-01-25 06:06:58,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:06:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-01-25 06:06:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-25 06:06:58,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:58,717 INFO L322 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-01-25 06:06:58,717 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-01-25 06:06:58,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1508445558, now seen corresponding path program 5 times [2018-01-25 06:06:58,718 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:58,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:58,718 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:58,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:58,719 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:58,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:58,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:58,956 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:58,956 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:58,956 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:58,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:58,956 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:58,962 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 06:06:58,963 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:58,974 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:58,977 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:58,983 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:58,995 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:59,053 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:59,057 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:59,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:59,074 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:59,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:59,345 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:59,348 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 06:06:59,349 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:59,359 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:59,363 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:59,373 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:59,390 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:59,439 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:59,463 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:59,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:59,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:59,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:59,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 21 [2018-01-25 06:06:59,618 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:59,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 06:06:59,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 06:06:59,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:06:59,619 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 12 states. [2018-01-25 06:06:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:59,657 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-01-25 06:06:59,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:06:59,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-01-25 06:06:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:59,658 INFO L225 Difference]: With dead ends: 94 [2018-01-25 06:06:59,658 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 06:06:59,659 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=257, Unknown=0, NotChecked=0, Total=462 [2018-01-25 06:06:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 06:06:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-25 06:06:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 06:06:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-01-25 06:06:59,667 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-01-25 06:06:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:59,668 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-01-25 06:06:59,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 06:06:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-01-25 06:06:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-25 06:06:59,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:59,668 INFO L322 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-01-25 06:06:59,669 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-01-25 06:06:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1909260946, now seen corresponding path program 6 times [2018-01-25 06:06:59,669 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:59,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:59,670 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:59,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:59,670 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:59,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:59,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:59,829 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:59,830 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:59,830 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:59,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:59,830 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:59,851 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 06:06:59,851 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 06:06:59,876 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:06:59,891 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:06:59,912 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:07:00,009 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:07:00,367 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:07:00,368 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:07:00,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:00,383 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:00,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:00,748 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:07:00,751 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 06:07:00,751 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 06:07:00,800 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:07:00,846 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:07:01,496 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:07:13,515 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:07:25,559 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 06:07:25,606 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:07:25,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:25,621 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:25,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:07:25,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 23 [2018-01-25 06:07:25,746 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:07:25,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:07:25,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:07:25,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-01-25 06:07:25,747 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 13 states. [2018-01-25 06:07:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:25,776 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-01-25 06:07:25,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:07:25,776 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-01-25 06:07:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:25,777 INFO L225 Difference]: With dead ends: 95 [2018-01-25 06:07:25,778 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 06:07:25,778 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=306, Unknown=0, NotChecked=0, Total=552 [2018-01-25 06:07:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 06:07:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-25 06:07:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 06:07:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-01-25 06:07:25,791 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-01-25 06:07:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:25,791 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-01-25 06:07:25,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:07:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-01-25 06:07:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-25 06:07:25,792 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:25,793 INFO L322 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-01-25 06:07:25,793 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-01-25 06:07:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash 483980170, now seen corresponding path program 7 times [2018-01-25 06:07:25,793 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:25,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:25,794 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:07:25,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:25,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:25,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:25,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:25,951 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:07:25,952 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:07:25,952 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:07:25,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:25,952 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:07:25,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:25,957 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:07:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:25,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:25,996 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:26,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:26,255 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:07:26,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:26,259 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:07:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:26,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:26,326 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:26,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:07:26,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 25 [2018-01-25 06:07:26,463 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:07:26,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 06:07:26,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 06:07:26,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=328, Unknown=0, NotChecked=0, Total=600 [2018-01-25 06:07:26,464 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-01-25 06:07:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:26,504 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-01-25 06:07:26,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:07:26,505 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-01-25 06:07:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:26,506 INFO L225 Difference]: With dead ends: 96 [2018-01-25 06:07:26,506 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 06:07:26,506 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=287, Invalid=363, Unknown=0, NotChecked=0, Total=650 [2018-01-25 06:07:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 06:07:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 06:07:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 06:07:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-01-25 06:07:26,519 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-01-25 06:07:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:26,519 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-01-25 06:07:26,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 06:07:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-01-25 06:07:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:07:26,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:26,520 INFO L322 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-01-25 06:07:26,520 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-01-25 06:07:26,521 INFO L82 PathProgramCache]: Analyzing trace with hash -750050926, now seen corresponding path program 8 times [2018-01-25 06:07:26,521 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:26,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:26,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:26,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:26,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:26,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:26,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:26,719 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:07:26,720 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:07:26,720 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:07:26,720 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:26,720 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:07:26,731 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:07:26,731 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:07:26,762 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:07:26,778 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:07:26,781 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:07:26,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:26,797 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:27,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:27,210 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:07:27,214 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:07:27,214 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:07:27,250 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:07:27,285 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:07:27,308 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:07:27,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:27,319 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:27,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:07:27,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14] total 27 [2018-01-25 06:07:27,666 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:07:27,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:07:27,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:07:27,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=390, Unknown=0, NotChecked=0, Total=702 [2018-01-25 06:07:27,667 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 15 states. [2018-01-25 06:07:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:27,747 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-01-25 06:07:27,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 06:07:27,749 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-01-25 06:07:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:27,750 INFO L225 Difference]: With dead ends: 97 [2018-01-25 06:07:27,750 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 06:07:27,750 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=428, Unknown=0, NotChecked=0, Total=756 [2018-01-25 06:07:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 06:07:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-25 06:07:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-25 06:07:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-01-25 06:07:27,759 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-01-25 06:07:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:27,759 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-01-25 06:07:27,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:07:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-01-25 06:07:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-25 06:07:27,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:27,760 INFO L322 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-01-25 06:07:27,760 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-01-25 06:07:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash -350309238, now seen corresponding path program 9 times [2018-01-25 06:07:27,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:27,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:27,761 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:07:27,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:27,762 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:27,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:27,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:27,929 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:07:27,929 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:07:27,929 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:07:27,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:27,929 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:07:27,954 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 06:07:27,954 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 06:07:27,979 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:07:27,994 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:07:28,013 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:07:28,186 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command Received shutdown request... [2018-01-25 06:07:28,795 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:07:29,842 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:07:30,710 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:07:30,712 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:07:30,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:30,724 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:07:30,725 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:07:30,728 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:07:30,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:07:30 BoogieIcfgContainer [2018-01-25 06:07:30,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:07:30,729 INFO L168 Benchmark]: Toolchain (without parser) took 53900.43 ms. Allocated memory was 304.6 MB in the beginning and 1.1 GB in the end (delta: 772.3 MB). Free memory was 263.7 MB in the beginning and 988.0 MB in the end (delta: -724.3 MB). Peak memory consumption was 48.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:30,730 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:07:30,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.93 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 250.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:30,731 INFO L168 Benchmark]: Boogie Preprocessor took 36.91 ms. Allocated memory is still 304.6 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:30,731 INFO L168 Benchmark]: RCFGBuilder took 281.20 ms. Allocated memory is still 304.6 MB. Free memory was 248.3 MB in the beginning and 227.7 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:30,731 INFO L168 Benchmark]: TraceAbstraction took 53362.31 ms. Allocated memory was 304.6 MB in the beginning and 1.1 GB in the end (delta: 772.3 MB). Free memory was 227.7 MB in the beginning and 988.0 MB in the end (delta: -760.3 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:30,733 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 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.93 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 250.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.91 ms. Allocated memory is still 304.6 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 281.20 ms. Allocated memory is still 304.6 MB. Free memory was 248.3 MB in the beginning and 227.7 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53362.31 ms. Allocated memory was 304.6 MB in the beginning and 1.1 GB in the end (delta: 772.3 MB). Free memory was 227.7 MB in the beginning and 988.0 MB in the end (delta: -760.3 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 256 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 108 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.463150 RENAME_VARIABLES(MILLISECONDS) : 0.095058 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.180003 PROJECTAWAY(MILLISECONDS) : 0.043066 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.125486 DISJOIN(MILLISECONDS) : 0.751819 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.120203 ADD_EQUALITY(MILLISECONDS) : 0.020406 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006736 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 145 #UNFREEZE : 0 #CONJOIN : 178 #PROJECTAWAY : 142 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 296 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 120 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.258039 RENAME_VARIABLES(MILLISECONDS) : 0.063999 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.095160 PROJECTAWAY(MILLISECONDS) : 0.030022 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.045414 DISJOIN(MILLISECONDS) : 0.412223 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.080032 ADD_EQUALITY(MILLISECONDS) : 0.016622 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006425 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 53 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 385 LocStat_NO_SUPPORTING_DISEQUALITIES : 43 LocStat_NO_DISJUNCTIONS : -106 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 74 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 130 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 77 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.067009 RENAME_VARIABLES(MILLISECONDS) : 0.034121 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.047708 PROJECTAWAY(MILLISECONDS) : 0.019980 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048813 DISJOIN(MILLISECONDS) : 0.408207 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.045900 ADD_EQUALITY(MILLISECONDS) : 0.008151 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007274 #CONJOIN_DISJUNCTIVE : 115 #RENAME_VARIABLES : 202 #UNFREEZE : 0 #CONJOIN : 255 #PROJECTAWAY : 205 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 199 #ADD_EQUALITY : 146 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1441]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1441). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 65 locations, 9 error locations. TIMEOUT Result, 53.3s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1139 SDtfs, 243 SDslu, 5699 SDs, 0 SdLazy, 1677 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2555 GetRequests, 2229 SyntacticMatches, 23 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 27.1s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2107 NumberOfCodeBlocks, 2102 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 3223 ConstructedInterpolants, 52 QuantifiedInterpolants, 354602 SizeOfPredicates, 46 NumberOfNonLiveVariables, 5221 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 66 InterpolantComputations, 14 PerfectInterpolantSequences, 33/1142 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-07-30-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-07-30-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-07-30-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-07-30-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-07-30-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-07-30-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-07-30-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-07-30-745.csv Completed graceful shutdown