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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:55:56,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:55:56,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:55:56,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:55:56,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:55:56,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:55:56,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:55:56,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:55:56,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:55:56,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:55:56,945 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:55:56,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:55:56,946 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:55:56,948 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:55:56,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:55:56,951 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:55:56,954 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:55:56,956 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:55:56,957 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:55:56,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:55:56,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:55:56,961 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:55:56,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:55:56,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:55:56,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:55:56,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:55:56,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:55:56,966 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:55:56,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:55:56,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:55:56,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:55:56,967 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:55:56,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:55:56,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:55:56,978 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:55:56,979 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:55:56,979 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:55:56,979 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:55:56,979 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:55:56,980 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:55:56,980 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:55:56,980 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:55:56,980 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:55:56,980 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:55:56,980 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:55:56,981 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:55:56,981 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:55:56,981 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:55:56,981 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:55:56,981 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:55:56,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:55:56,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:55:56,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:55:56,982 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:55:56,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:55:56,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:55:56,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:55:56,983 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:55:56,983 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:55:56,983 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:55:56,984 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:55:56,984 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:55:56,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:55:56,984 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:55:56,985 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:55:56,985 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:55:57,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:55:57,032 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:55:57,035 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:55:57,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:55:57,037 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:55:57,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-01-24 11:55:57,249 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:55:57,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:55:57,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:55:57,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:55:57,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:55:57,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5977c944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57, skipping insertion in model container [2018-01-24 11:55:57,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,277 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:55:57,318 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:55:57,444 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:55:57,469 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:55:57,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57 WrapperNode [2018-01-24 11:55:57,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:55:57,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:55:57,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:55:57,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:55:57,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (1/1) ... [2018-01-24 11:55:57,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:55:57,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:55:57,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:55:57,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:55:57,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (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-24 11:55:57,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:55:57,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:55:57,567 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 11:55:57,567 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-24 11:55:57,567 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-24 11:55:57,567 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-24 11:55:57,567 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-24 11:55:57,567 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-24 11:55:57,568 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-24 11:55:57,568 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-24 11:55:57,568 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:55:57,568 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:55:57,568 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:55:57,568 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 11:55:57,568 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 11:55:57,568 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:55:57,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:55:57,569 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:55:57,569 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 11:55:57,569 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 11:55:57,569 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:55:57,569 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 11:55:57,569 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-24 11:55:57,569 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-24 11:55:57,570 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-24 11:55:57,570 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-24 11:55:57,570 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-24 11:55:57,570 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-24 11:55:57,570 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-24 11:55:57,570 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:55:57,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:55:57,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:55:57,980 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:55:57,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:55:57 BoogieIcfgContainer [2018-01-24 11:55:57,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:55:57,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:55:57,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:55:57,984 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:55:57,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:55:57" (1/3) ... [2018-01-24 11:55:57,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd8d416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:55:57, skipping insertion in model container [2018-01-24 11:55:57,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:57" (2/3) ... [2018-01-24 11:55:57,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd8d416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:55:57, skipping insertion in model container [2018-01-24 11:55:57,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:55:57" (3/3) ... [2018-01-24 11:55:57,988 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-24 11:55:57,997 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:55:58,004 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-24 11:55:58,054 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:55:58,054 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:55:58,055 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:55:58,055 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:55:58,055 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:55:58,055 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:55:58,055 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:55:58,056 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:55:58,056 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:55:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-24 11:55:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 11:55:58,086 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:58,087 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:58,087 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:55:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash -475500327, now seen corresponding path program 1 times [2018-01-24 11:55:58,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:58,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:58,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:58,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:58,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:58,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:58,258 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-24 11:55:58,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:58,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:55:58,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:55:58,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:55:58,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:58,275 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-01-24 11:55:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:58,515 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2018-01-24 11:55:58,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:55:58,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 11:55:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:58,525 INFO L225 Difference]: With dead ends: 224 [2018-01-24 11:55:58,525 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 11:55:58,529 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 11:55:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 11:55:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 11:55:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 11:55:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 11:55:58,568 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 7 [2018-01-24 11:55:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:58,569 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 11:55:58,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:55:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 11:55:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 11:55:58,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:58,570 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:58,570 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:55:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash -475500326, now seen corresponding path program 1 times [2018-01-24 11:55:58,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:58,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:58,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:58,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:58,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:58,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:58,673 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-24 11:55:58,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:58,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:55:58,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:55:58,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:55:58,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:58,676 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2018-01-24 11:55:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:58,765 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 11:55:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:55:58,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 11:55:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:58,768 INFO L225 Difference]: With dead ends: 114 [2018-01-24 11:55:58,768 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 11:55:58,769 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 11:55:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 11:55:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 11:55:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 11:55:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 11:55:58,782 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2018-01-24 11:55:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:58,783 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 11:55:58,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:55:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 11:55:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:55:58,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:58,784 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-24 11:55:58,784 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:55:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash 644933486, now seen corresponding path program 1 times [2018-01-24 11:55:58,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:58,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:58,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:58,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:58,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:58,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:58,887 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-24 11:55:58,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:58,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:55:58,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:55:58,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:55:58,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:55:58,888 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 6 states. [2018-01-24 11:55:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:59,177 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-24 11:55:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:55:59,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 11:55:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:59,181 INFO L225 Difference]: With dead ends: 122 [2018-01-24 11:55:59,181 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 11:55:59,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:55:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 11:55:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-01-24 11:55:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 11:55:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-24 11:55:59,196 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2018-01-24 11:55:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:59,196 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-24 11:55:59,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:55:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-24 11:55:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:55:59,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:59,197 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-24 11:55:59,197 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:55:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash 644933487, now seen corresponding path program 1 times [2018-01-24 11:55:59,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:59,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:59,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:59,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:59,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:59,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:59,333 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-24 11:55:59,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:59,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:55:59,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:55:59,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:55:59,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:55:59,334 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-01-24 11:55:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:59,479 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-24 11:55:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:55:59,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 11:55:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:59,481 INFO L225 Difference]: With dead ends: 118 [2018-01-24 11:55:59,481 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 11:55:59,482 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:55:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 11:55:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-24 11:55:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 11:55:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 11:55:59,493 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-01-24 11:55:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:59,493 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 11:55:59,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:55:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 11:55:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:55:59,494 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:59,494 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] [2018-01-24 11:55:59,495 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:55:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash 264154241, now seen corresponding path program 1 times [2018-01-24 11:55:59,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:59,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:59,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:59,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:59,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:59,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:59,579 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-24 11:55:59,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:59,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:59,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:55:59,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:55:59,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:55:59,581 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 4 states. [2018-01-24 11:55:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:59,713 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 11:55:59,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:55:59,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 11:55:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:59,716 INFO L225 Difference]: With dead ends: 114 [2018-01-24 11:55:59,716 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 11:55:59,716 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 11:55:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 11:55:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 11:55:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 11:55:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-24 11:55:59,725 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 27 [2018-01-24 11:55:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:59,726 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-24 11:55:59,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:55:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-24 11:55:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:55:59,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:59,727 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] [2018-01-24 11:55:59,727 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:55:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash 264154242, now seen corresponding path program 1 times [2018-01-24 11:55:59,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:59,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:59,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:59,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:59,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:59,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:59,859 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-24 11:55:59,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:59,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:59,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:55:59,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:55:59,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:55:59,860 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-01-24 11:55:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:59,931 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-24 11:55:59,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:55:59,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 11:55:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:59,933 INFO L225 Difference]: With dead ends: 113 [2018-01-24 11:55:59,933 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 11:55:59,934 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:55:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 11:55:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 11:55:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 11:55:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 11:55:59,943 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 27 [2018-01-24 11:55:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:59,944 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 11:55:59,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:55:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 11:55:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:55:59,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:59,945 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] [2018-01-24 11:55:59,945 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:55:59,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036196, now seen corresponding path program 1 times [2018-01-24 11:55:59,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:59,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:59,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:59,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:59,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:59,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:00,089 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-24 11:56:00,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:56:00,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:56:00,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:56:00,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:56:00,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:56:00,090 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 9 states. [2018-01-24 11:56:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:00,352 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-24 11:56:00,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:56:00,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 11:56:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:00,353 INFO L225 Difference]: With dead ends: 120 [2018-01-24 11:56:00,354 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 11:56:00,354 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:56:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 11:56:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-01-24 11:56:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 11:56:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-24 11:56:00,362 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 30 [2018-01-24 11:56:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:00,362 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-24 11:56:00,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:56:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-24 11:56:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:56:00,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:00,363 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] [2018-01-24 11:56:00,364 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036197, now seen corresponding path program 1 times [2018-01-24 11:56:00,364 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:00,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:00,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:00,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:00,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:00,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:00,626 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-24 11:56:00,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:56:00,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:56:00,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:56:00,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:56:00,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:56:00,628 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 11 states. [2018-01-24 11:56:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:01,028 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-01-24 11:56:01,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:56:01,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 11:56:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:01,029 INFO L225 Difference]: With dead ends: 141 [2018-01-24 11:56:01,030 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 11:56:01,030 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:56:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 11:56:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-01-24 11:56:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 11:56:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-01-24 11:56:01,037 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 30 [2018-01-24 11:56:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:01,038 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-01-24 11:56:01,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:56:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-01-24 11:56:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:56:01,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:01,039 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] [2018-01-24 11:56:01,039 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:01,039 INFO L82 PathProgramCache]: Analyzing trace with hash 98146345, now seen corresponding path program 1 times [2018-01-24 11:56:01,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:01,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:01,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:01,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:01,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:01,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:01,137 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-24 11:56:01,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:56:01,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:56:01,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:56:01,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:56:01,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:56:01,138 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 5 states. [2018-01-24 11:56:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:01,257 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-01-24 11:56:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:56:01,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 11:56:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:01,263 INFO L225 Difference]: With dead ends: 138 [2018-01-24 11:56:01,263 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 11:56:01,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:56:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 11:56:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 11:56:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 11:56:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-01-24 11:56:01,272 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 33 [2018-01-24 11:56:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:01,272 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-01-24 11:56:01,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:56:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-01-24 11:56:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:56:01,273 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:01,273 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] [2018-01-24 11:56:01,273 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash 98146346, now seen corresponding path program 1 times [2018-01-24 11:56:01,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:01,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:01,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:01,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:01,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:01,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:01,441 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-24 11:56:01,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:56:01,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 11:56:01,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:56:01,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:56:01,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:56:01,442 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 13 states. [2018-01-24 11:56:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:01,829 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-01-24 11:56:01,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:56:01,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 11:56:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:01,831 INFO L225 Difference]: With dead ends: 152 [2018-01-24 11:56:01,832 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 11:56:01,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:56:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 11:56:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-01-24 11:56:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 11:56:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-01-24 11:56:01,843 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 33 [2018-01-24 11:56:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:01,844 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-01-24 11:56:01,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:56:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-01-24 11:56:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:56:01,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:01,845 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-24 11:56:01,845 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430627, now seen corresponding path program 1 times [2018-01-24 11:56:01,846 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:01,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:01,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:01,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:01,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:01,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:01,952 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-24 11:56:01,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:56:01,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:56:01,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:56:01,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:56:01,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:56:01,954 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 7 states. [2018-01-24 11:56:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:02,210 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-01-24 11:56:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:56:02,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-24 11:56:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:02,212 INFO L225 Difference]: With dead ends: 150 [2018-01-24 11:56:02,212 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 11:56:02,213 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:56:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 11:56:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-01-24 11:56:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 11:56:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-24 11:56:02,224 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 34 [2018-01-24 11:56:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:02,225 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-24 11:56:02,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:56:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-24 11:56:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:56:02,226 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:02,226 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-24 11:56:02,226 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430626, now seen corresponding path program 1 times [2018-01-24 11:56:02,244 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:02,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:02,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:02,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:02,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:02,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:02,522 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-24 11:56:02,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:56:02,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:56:02,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:56:02,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:56:02,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:56:02,524 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 8 states. [2018-01-24 11:56:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:02,808 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-01-24 11:56:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:56:02,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-24 11:56:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:02,809 INFO L225 Difference]: With dead ends: 148 [2018-01-24 11:56:02,810 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 11:56:02,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:56:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 11:56:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-01-24 11:56:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 11:56:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-24 11:56:02,821 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 34 [2018-01-24 11:56:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:02,821 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-24 11:56:02,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:56:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-24 11:56:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 11:56:02,822 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:02,822 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, 1] [2018-01-24 11:56:02,823 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:02,823 INFO L82 PathProgramCache]: Analyzing trace with hash -994990400, now seen corresponding path program 1 times [2018-01-24 11:56:02,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:02,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:02,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:02,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:02,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:02,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:03,132 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-24 11:56:03,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:56:03,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 11:56:03,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:56:03,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:56:03,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:56:03,133 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-01-24 11:56:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:03,615 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-01-24 11:56:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 11:56:03,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 11:56:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:03,616 INFO L225 Difference]: With dead ends: 177 [2018-01-24 11:56:03,616 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 11:56:03,617 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:56:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 11:56:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-01-24 11:56:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-24 11:56:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-01-24 11:56:03,633 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 36 [2018-01-24 11:56:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:03,634 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2018-01-24 11:56:03,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:56:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2018-01-24 11:56:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 11:56:03,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:03,635 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, 1] [2018-01-24 11:56:03,635 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash -994990399, now seen corresponding path program 1 times [2018-01-24 11:56:03,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:03,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:03,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:03,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:03,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:03,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:04,147 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-24 11:56:04,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:56:04,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 11:56:04,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:56:04,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:56:04,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:56:04,148 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 17 states. [2018-01-24 11:56:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:04,936 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-01-24 11:56:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:56:04,937 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 11:56:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:04,938 INFO L225 Difference]: With dead ends: 181 [2018-01-24 11:56:04,939 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 11:56:04,939 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:56:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 11:56:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-01-24 11:56:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-24 11:56:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-01-24 11:56:04,953 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 36 [2018-01-24 11:56:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:04,953 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-01-24 11:56:04,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:56:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-01-24 11:56:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 11:56:04,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:04,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:56:04,954 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:04,954 INFO L82 PathProgramCache]: Analyzing trace with hash -315835362, now seen corresponding path program 1 times [2018-01-24 11:56:04,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:04,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:04,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:04,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:04,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:04,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:05,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:56:05,187 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-24 11:56:05,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:05,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:56:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:05,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:56:05,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-01-24 11:56:05,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:56:05,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:56:05,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:56:05,506 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 13 states. [2018-01-24 11:56:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:06,191 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2018-01-24 11:56:06,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:56:06,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-01-24 11:56:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:06,193 INFO L225 Difference]: With dead ends: 199 [2018-01-24 11:56:06,193 INFO L226 Difference]: Without dead ends: 198 [2018-01-24 11:56:06,194 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:56:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-24 11:56:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2018-01-24 11:56:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-24 11:56:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2018-01-24 11:56:06,210 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 50 [2018-01-24 11:56:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:06,211 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2018-01-24 11:56:06,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:56:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2018-01-24 11:56:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 11:56:06,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:06,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:56:06,212 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash -315835361, now seen corresponding path program 1 times [2018-01-24 11:56:06,212 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:06,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:06,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:06,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:06,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:06,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:06,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:56:06,823 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:56:06,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:06,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:56:06,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:56:06,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:06,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:06,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:56:07,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 11:56:07,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:07,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:56:07,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:07,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:07,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-01-24 11:56:07,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:07,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:07,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:56:07,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:07,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:07,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-01-24 11:56:07,196 WARN L1029 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (not (= insert_sub_~sub~10.base |c_create_sub_list_#in~sub.base|)))) is different from true [2018-01-24 11:56:07,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:07,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-24 11:56:07,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:07,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:07,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-01-24 11:56:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:07,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:56:07,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-24 11:56:07,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 11:56:07,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 11:56:07,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=641, Unknown=9, NotChecked=52, Total=812 [2018-01-24 11:56:07,296 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 29 states. [2018-01-24 11:56:08,136 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (= 0 (select |c_old(#valid)| insert_sub_~sub~10.base)))) (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (not (= insert_sub_~sub~10.base |c_create_sub_list_#in~sub.base|))))) is different from true [2018-01-24 11:56:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:09,174 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-24 11:56:09,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 11:56:09,174 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2018-01-24 11:56:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:09,175 INFO L225 Difference]: With dead ends: 234 [2018-01-24 11:56:09,176 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 11:56:09,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=320, Invalid=1629, Unknown=39, NotChecked=174, Total=2162 [2018-01-24 11:56:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 11:56:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 196. [2018-01-24 11:56:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-24 11:56:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 215 transitions. [2018-01-24 11:56:09,195 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 215 transitions. Word has length 50 [2018-01-24 11:56:09,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:09,196 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 215 transitions. [2018-01-24 11:56:09,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-24 11:56:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 215 transitions. [2018-01-24 11:56:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 11:56:09,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:09,197 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-24 11:56:09,197 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash -345518987, now seen corresponding path program 1 times [2018-01-24 11:56:09,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:09,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:09,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:09,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:09,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:09,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:09,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:56:09,788 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-24 11:56:09,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:09,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:56:10,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:10,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:10,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 11:56:10,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:10,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:10,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:10,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:56:10,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:10,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:10,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2018-01-24 11:56:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:10,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:56:10,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-01-24 11:56:10,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 11:56:10,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 11:56:10,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2018-01-24 11:56:10,284 INFO L87 Difference]: Start difference. First operand 196 states and 215 transitions. Second operand 29 states. [2018-01-24 11:56:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:11,293 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-01-24 11:56:11,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 11:56:11,293 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2018-01-24 11:56:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:11,295 INFO L225 Difference]: With dead ends: 216 [2018-01-24 11:56:11,295 INFO L226 Difference]: Without dead ends: 214 [2018-01-24 11:56:11,296 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 11:56:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-01-24 11:56:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 195. [2018-01-24 11:56:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 11:56:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2018-01-24 11:56:11,320 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 61 [2018-01-24 11:56:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:11,320 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2018-01-24 11:56:11,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-24 11:56:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2018-01-24 11:56:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 11:56:11,321 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:11,321 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-24 11:56:11,322 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:11,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1287618042, now seen corresponding path program 1 times [2018-01-24 11:56:11,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:11,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:11,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:11,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:11,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:11,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:12,076 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 48 DAG size of output 42 [2018-01-24 11:56:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:12,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:56:12,495 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-24 11:56:12,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:12,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:56:12,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 11:56:12,689 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 10 treesize of output 9 [2018-01-24 11:56:12,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 11:56:12,699 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 10 treesize of output 9 [2018-01-24 11:56:12,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-24 11:56:12,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 11:56:12,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:12,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 11:56:12,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 11:56:12,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:12,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 11:56:12,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:12,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-01-24 11:56:13,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 11:56:13,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:13,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 11:56:13,027 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 12 treesize of output 1 [2018-01-24 11:56:13,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:13,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:13,038 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:13,039 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:13,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:13,049 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:47, output treesize:12 [2018-01-24 11:56:14,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:14,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:14,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:14,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:14,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:14,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:156, output treesize:230 [2018-01-24 11:56:15,012 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 71 DAG size of output 53 [2018-01-24 11:56:15,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:56:15,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:15,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 130 [2018-01-24 11:56:15,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:56:15,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:15,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2018-01-24 11:56:15,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2018-01-24 11:56:15,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:15,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2018-01-24 11:56:15,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-01-24 11:56:15,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-01-24 11:56:15,212 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:15,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 36 [2018-01-24 11:56:15,245 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-24 11:56:15,270 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:56:15,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-24 11:56:15,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 40 [2018-01-24 11:56:15,317 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-24 11:56:15,342 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:56:15,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-01-24 11:56:15,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 40 [2018-01-24 11:56:15,361 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-24 11:56:15,384 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:56:15,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-01-24 11:56:15,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 40 [2018-01-24 11:56:15,401 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-24 11:56:15,429 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:56:15,487 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 11:56:15,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 11:56:15,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 11:56:15,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-24 11:56:15,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:15,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2018-01-24 11:56:15,680 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:15,684 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:15,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-01-24 11:56:15,750 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:270, output treesize:409 [2018-01-24 11:56:16,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:16,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:16,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:16,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 88 [2018-01-24 11:56:16,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:16,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:16,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:16,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:16,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 100 [2018-01-24 11:56:16,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:16,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 11:56:16,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:173 [2018-01-24 11:56:16,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 103 [2018-01-24 11:56:16,603 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 12 treesize of output 1 [2018-01-24 11:56:16,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:16,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:16,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 95 [2018-01-24 11:56:16,667 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 12 treesize of output 1 [2018-01-24 11:56:16,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:16,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:16,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-24 11:56:16,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:203, output treesize:181 [2018-01-24 11:56:17,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:17,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 64 [2018-01-24 11:56:17,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:17,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-24 11:56:17,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:17,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2018-01-24 11:56:17,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:17,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:17,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:17,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 72 [2018-01-24 11:56:17,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:17,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2018-01-24 11:56:17,433 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:17,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:17,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-24 11:56:17,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:17,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:17,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 11:56:17,475 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:175, output treesize:57 [2018-01-24 11:56:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:17,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:56:17,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34] total 62 [2018-01-24 11:56:17,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-24 11:56:17,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-24 11:56:17,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3665, Unknown=54, NotChecked=0, Total=3906 [2018-01-24 11:56:17,720 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand 63 states. [2018-01-24 11:56:23,895 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 73 DAG size of output 48 [2018-01-24 11:56:26,524 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 75 DAG size of output 66 [2018-01-24 11:56:27,587 WARN L146 SmtUtils]: Spent 256ms on a formula simplification. DAG size of input: 146 DAG size of output 72 [2018-01-24 11:56:27,945 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 139 DAG size of output 85 [2018-01-24 11:56:29,209 WARN L146 SmtUtils]: Spent 861ms on a formula simplification. DAG size of input: 147 DAG size of output 92 [2018-01-24 11:56:30,170 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 93 DAG size of output 61 [2018-01-24 11:56:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:32,947 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2018-01-24 11:56:32,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-24 11:56:32,948 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 61 [2018-01-24 11:56:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:32,949 INFO L225 Difference]: With dead ends: 245 [2018-01-24 11:56:32,949 INFO L226 Difference]: Without dead ends: 244 [2018-01-24 11:56:32,951 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3011 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=754, Invalid=11575, Unknown=103, NotChecked=0, Total=12432 [2018-01-24 11:56:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-24 11:56:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 213. [2018-01-24 11:56:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-24 11:56:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2018-01-24 11:56:32,986 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 61 [2018-01-24 11:56:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:32,987 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2018-01-24 11:56:32,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-24 11:56:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2018-01-24 11:56:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 11:56:32,988 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:32,988 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-24 11:56:32,988 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 11:56:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1287618041, now seen corresponding path program 1 times [2018-01-24 11:56:32,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:32,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:32,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:32,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:32,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:33,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:34,050 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 69 DAG size of output 58 [2018-01-24 11:56:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:34,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:56:34,881 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:56:34,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:34,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:56:35,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 11:56:35,059 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 10 treesize of output 9 [2018-01-24 11:56:35,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 11:56:35,069 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 10 treesize of output 9 [2018-01-24 11:56:35,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,076 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-24 11:56:35,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 11:56:35,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:35,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 11:56:35,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 11:56:35,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:35,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 11:56:35,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-01-24 11:56:35,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:56:35,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-01-24 11:56:35,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 11:56:35,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 11:56:35,400 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 12 treesize of output 1 [2018-01-24 11:56:35,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 11:56:35,414 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 12 treesize of output 1 [2018-01-24 11:56:35,414 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:35,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:35,431 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:53, output treesize:12 [2018-01-24 11:56:36,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:36,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:36,981 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:37,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:37,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:37,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:289, output treesize:467 [2018-01-24 11:56:38,095 WARN L146 SmtUtils]: Spent 717ms on a formula simplification. DAG size of input: 119 DAG size of output 71 [2018-01-24 11:56:38,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:56:38,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 325 [2018-01-24 11:56:38,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:56:38,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 286 [2018-01-24 11:56:38,494 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 60 DAG size of output 52 [2018-01-24 11:56:38,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 232 [2018-01-24 11:56:38,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-01-24 11:56:38,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-01-24 11:56:38,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 11:56:38,598 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,625 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 83 [2018-01-24 11:56:38,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-01-24 11:56:38,680 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,708 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,733 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 193 [2018-01-24 11:56:38,864 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 14 treesize of output 13 [2018-01-24 11:56:38,865 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 145 [2018-01-24 11:56:38,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2018-01-24 11:56:38,949 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,950 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-24 11:56:38,950 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:38,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 108 [2018-01-24 11:56:38,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-01-24 11:56:38,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:38,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:39,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-01-24 11:56:39,000 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,009 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:39,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:39,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 114 [2018-01-24 11:56:39,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-01-24 11:56:39,050 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,063 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,071 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,080 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,090 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:39,115 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:502, output treesize:129 [2018-01-24 11:56:39,476 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:39,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:39,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:56:39,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 11:56:39,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:39,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:56:39,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:129 [2018-01-24 11:56:39,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:39,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:39,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 141 [2018-01-24 11:56:39,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:39,923 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 124 treesize of output 161 [2018-01-24 11:56:39,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 13 xjuncts. [2018-01-24 11:56:40,311 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 123 treesize of output 111 [2018-01-24 11:56:40,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:40,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-01-24 11:56:40,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 188 [2018-01-24 11:56:40,613 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 185 treesize of output 173 [2018-01-24 11:56:40,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:40,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 121 [2018-01-24 11:56:40,700 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-01-24 11:56:40,763 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:56:40,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 120 [2018-01-24 11:56:40,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,805 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 85 [2018-01-24 11:56:40,806 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 11:56:40,835 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:40,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 163 [2018-01-24 11:56:40,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,868 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 103 [2018-01-24 11:56:40,870 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 11:56:40,925 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 11:56:40,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 147 [2018-01-24 11:56:40,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:40,960 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 103 [2018-01-24 11:56:40,962 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 11:56:41,037 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 11:56:41,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:41,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:41,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 158 [2018-01-24 11:56:41,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:41,075 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 103 [2018-01-24 11:56:41,077 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 11:56:41,260 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 11:56:41,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 25 dim-0 vars, and 12 xjuncts. [2018-01-24 11:56:41,537 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:159, output treesize:1727 [2018-01-24 11:56:42,084 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 350 DAG size of output 60 [2018-01-24 11:56:43,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:43,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:43,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 98 [2018-01-24 11:56:43,416 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 58 [2018-01-24 11:56:43,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-01-24 11:56:43,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-24 11:56:43,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 88 [2018-01-24 11:56:43,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2018-01-24 11:56:43,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2018-01-24 11:56:43,510 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:43,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:56:43,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-01-24 11:56:43,556 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 32 [2018-01-24 11:56:43,557 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 11:56:43,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-24 11:56:43,568 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-01-24 11:56:43,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 11:56:43,596 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-24 11:56:43,604 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,610 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:56:43,627 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:256, output treesize:16 [2018-01-24 11:56:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:56:43,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:56:43,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 63 [2018-01-24 11:56:43,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-01-24 11:56:43,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-01-24 11:56:43,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3820, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 11:56:43,859 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand 64 states. [2018-01-24 11:56:45,889 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 94 DAG size of output 81 [2018-01-24 11:56:47,767 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 159 DAG size of output 87 [2018-01-24 11:56:48,012 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 171 DAG size of output 90 [2018-01-24 11:56:48,779 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 100 DAG size of output 58 Received shutdown request... [2018-01-24 11:56:49,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-24 11:56:49,165 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 11:56:49,168 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 11:56:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:56:49 BoogieIcfgContainer [2018-01-24 11:56:49,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:56:49,169 INFO L168 Benchmark]: Toolchain (without parser) took 51919.57 ms. Allocated memory was 300.4 MB in the beginning and 745.0 MB in the end (delta: 444.6 MB). Free memory was 259.3 MB in the beginning and 439.4 MB in the end (delta: -180.1 MB). Peak memory consumption was 264.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:49,170 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 300.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:56:49,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.93 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 247.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:49,171 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 ms. Allocated memory is still 300.4 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:49,171 INFO L168 Benchmark]: RCFGBuilder took 464.01 ms. Allocated memory is still 300.4 MB. Free memory was 245.2 MB in the beginning and 214.1 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:49,171 INFO L168 Benchmark]: TraceAbstraction took 51186.87 ms. Allocated memory was 300.4 MB in the beginning and 745.0 MB in the end (delta: 444.6 MB). Free memory was 214.1 MB in the beginning and 439.4 MB in the end (delta: -225.4 MB). Peak memory consumption was 219.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:49,173 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.19 ms. Allocated memory is still 300.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.93 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 247.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.11 ms. Allocated memory is still 300.4 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 464.01 ms. Allocated memory is still 300.4 MB. Free memory was 245.2 MB in the beginning and 214.1 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51186.87 ms. Allocated memory was 300.4 MB in the beginning and 745.0 MB in the end (delta: 444.6 MB). Free memory was 214.1 MB in the beginning and 439.4 MB in the end (delta: -225.4 MB). Peak memory consumption was 219.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 695]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 695). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (213states) and interpolant automaton (currently 41 states, 64 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 104. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 119 locations, 33 error locations. TIMEOUT Result, 51.1s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 28.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1800 SDtfs, 1137 SDslu, 10113 SDs, 0 SdLazy, 12467 SolverSat, 449 SolverUnsat, 51 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 679 GetRequests, 219 SyntacticMatches, 24 SemanticMatches, 435 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6366 ImplicationChecksByTransitivity, 29.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 914 ConstructedInterpolants, 104 QuantifiedInterpolants, 795842 SizeOfPredicates, 108 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 393 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 12/98 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/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-56-49-181.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-56-49-181.csv Completed graceful shutdown