java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:41:45,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:41:45,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:41:45,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:41:45,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:41:45,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:41:45,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:41:45,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:41:45,295 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:41:45,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:41:45,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:41:45,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:41:45,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:41:45,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:41:45,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:41:45,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:41:45,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:41:45,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:41:45,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:41:45,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:41:45,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:41:45,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:41:45,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:41:45,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:41:45,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:41:45,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:41:45,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:41:45,307 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:41:45,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:41:45,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:41:45,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:41:45,308 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:41:45,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:41:45,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:41:45,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:41:45,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:41:45,316 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:41:45,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:41:45,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:41:45,316 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:41:45,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:41:45,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:41:45,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:41:45,317 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:41:45,317 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:41:45,317 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:41:45,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:41:45,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:41:45,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:41:45,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:41:45,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:41:45,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:41:45,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:41:45,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:41:45,318 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:41:45,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:41:45,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:41:45,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:41:45,348 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:41:45,351 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:41:45,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:41:45,352 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:41:45,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i [2018-02-02 18:41:45,491 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:41:45,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:41:45,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:41:45,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:41:45,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:41:45,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36af2533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45, skipping insertion in model container [2018-02-02 18:41:45,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,516 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:41:45,544 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:41:45,644 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:41:45,658 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:41:45,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45 WrapperNode [2018-02-02 18:41:45,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:41:45,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:41:45,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:41:45,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:41:45,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (1/1) ... [2018-02-02 18:41:45,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:41:45,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:41:45,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:41:45,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:41:45,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:41:45,732 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:41:45,732 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:41:45,732 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-02 18:41:45,732 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-02-02 18:41:45,732 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-02-02 18:41:45,732 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-02-02 18:41:45,732 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-02-02 18:41:45,733 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-02-02 18:41:45,733 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-02-02 18:41:45,733 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-02-02 18:41:45,733 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 18:41:45,733 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:41:45,734 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:41:46,039 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:41:46,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:41:46 BoogieIcfgContainer [2018-02-02 18:41:46,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:41:46,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:41:46,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:41:46,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:41:46,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:41:45" (1/3) ... [2018-02-02 18:41:46,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33222d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:41:46, skipping insertion in model container [2018-02-02 18:41:46,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:41:45" (2/3) ... [2018-02-02 18:41:46,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33222d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:41:46, skipping insertion in model container [2018-02-02 18:41:46,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:41:46" (3/3) ... [2018-02-02 18:41:46,045 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0102_true-valid-memsafety.i [2018-02-02 18:41:46,050 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:41:46,055 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-02-02 18:41:46,084 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:41:46,084 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:41:46,084 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:41:46,084 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:41:46,084 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:41:46,084 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:41:46,084 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:41:46,085 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:41:46,085 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:41:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-02-02 18:41:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 18:41:46,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:46,111 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:46,111 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-02-02 18:41:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2078311652, now seen corresponding path program 1 times [2018-02-02 18:41:46,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:46,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:46,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:46,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:46,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:46,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:46,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:46,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:41:46,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:41:46,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:41:46,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:41:46,284 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2018-02-02 18:41:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:46,414 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-02-02 18:41:46,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:41:46,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 18:41:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:46,422 INFO L225 Difference]: With dead ends: 118 [2018-02-02 18:41:46,422 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 18:41:46,423 INFO L554 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-02-02 18:41:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 18:41:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 18:41:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 18:41:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 18:41:46,455 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 7 [2018-02-02 18:41:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:46,455 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 18:41:46,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:41:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 18:41:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 18:41:46,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:46,456 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:46,456 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-02-02 18:41:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2078311651, now seen corresponding path program 1 times [2018-02-02 18:41:46,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:46,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:46,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:46,457 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:46,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:46,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:46,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:46,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:41:46,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:41:46,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:41:46,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:41:46,505 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 3 states. [2018-02-02 18:41:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:46,553 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-02 18:41:46,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:41:46,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 18:41:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:46,555 INFO L225 Difference]: With dead ends: 113 [2018-02-02 18:41:46,555 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 18:41:46,556 INFO L554 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-02-02 18:41:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 18:41:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 18:41:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 18:41:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 18:41:46,564 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 7 [2018-02-02 18:41:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:46,564 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 18:41:46,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:41:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 18:41:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 18:41:46,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:46,565 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:46,565 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-02-02 18:41:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash -491558478, now seen corresponding path program 1 times [2018-02-02 18:41:46,565 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:46,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:46,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:46,566 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:46,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:46,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:46,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:46,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:41:46,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:41:46,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:41:46,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:41:46,632 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-02-02 18:41:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:46,759 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 18:41:46,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:41:46,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 18:41:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:46,761 INFO L225 Difference]: With dead ends: 121 [2018-02-02 18:41:46,761 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 18:41:46,761 INFO L554 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-02-02 18:41:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 18:41:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-02-02 18:41:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 18:41:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-02-02 18:41:46,769 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 19 [2018-02-02 18:41:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:46,769 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-02-02 18:41:46,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:41:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-02-02 18:41:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 18:41:46,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:46,770 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:46,770 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-02-02 18:41:46,770 INFO L82 PathProgramCache]: Analyzing trace with hash -491558477, now seen corresponding path program 1 times [2018-02-02 18:41:46,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:46,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:46,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:46,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:46,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:46,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:46,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:46,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:41:46,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:41:46,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:41:46,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:41:46,865 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 6 states. [2018-02-02 18:41:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:47,011 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-02-02 18:41:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:41:47,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 18:41:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:47,014 INFO L225 Difference]: With dead ends: 117 [2018-02-02 18:41:47,014 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 18:41:47,014 INFO L554 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-02-02 18:41:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 18:41:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-02-02 18:41:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 18:41:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 18:41:47,021 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 19 [2018-02-02 18:41:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:47,021 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 18:41:47,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:41:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 18:41:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:41:47,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:47,022 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:47,022 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-02-02 18:41:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1908309148, now seen corresponding path program 1 times [2018-02-02 18:41:47,022 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:47,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:47,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:47,023 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:47,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:47,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:47,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:47,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:41:47,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:41:47,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:41:47,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:41:47,061 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 4 states. [2018-02-02 18:41:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:47,145 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-02 18:41:47,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:41:47,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 18:41:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:47,146 INFO L225 Difference]: With dead ends: 114 [2018-02-02 18:41:47,146 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 18:41:47,146 INFO L554 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-02-02 18:41:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 18:41:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 18:41:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 18:41:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-02 18:41:47,152 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 27 [2018-02-02 18:41:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:47,153 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-02 18:41:47,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:41:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-02 18:41:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:41:47,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:47,153 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:47,154 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-02-02 18:41:47,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1908309147, now seen corresponding path program 1 times [2018-02-02 18:41:47,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:47,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:47,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:47,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:47,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:47,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:47,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:47,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:41:47,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:41:47,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:41:47,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:41:47,233 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 4 states. [2018-02-02 18:41:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:47,285 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-02 18:41:47,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:41:47,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 18:41:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:47,286 INFO L225 Difference]: With dead ends: 113 [2018-02-02 18:41:47,286 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 18:41:47,286 INFO L554 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-02-02 18:41:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 18:41:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 18:41:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 18:41:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 18:41:47,291 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 27 [2018-02-02 18:41:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:47,291 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 18:41:47,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:41:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 18:41:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 18:41:47,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:47,292 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:47,292 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-02-02 18:41:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2044398882, now seen corresponding path program 1 times [2018-02-02 18:41:47,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:47,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:47,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:47,294 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:47,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:47,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:47,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:47,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:41:47,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:41:47,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:41:47,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:41:47,399 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 9 states. [2018-02-02 18:41:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:47,603 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-02-02 18:41:47,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:41:47,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-02 18:41:47,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:47,604 INFO L225 Difference]: With dead ends: 120 [2018-02-02 18:41:47,604 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 18:41:47,604 INFO L554 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-02-02 18:41:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 18:41:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-02-02 18:41:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 18:41:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-02 18:41:47,607 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-02-02 18:41:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:47,608 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-02 18:41:47,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:41:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-02 18:41:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 18:41:47,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:47,609 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:47,609 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-02-02 18:41:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2044398883, now seen corresponding path program 1 times [2018-02-02 18:41:47,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:47,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:47,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:47,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:47,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:47,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:47,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:47,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:41:47,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:41:47,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:41:47,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:41:47,784 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 11 states. [2018-02-02 18:41:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:48,092 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-02-02 18:41:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 18:41:48,093 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-02 18:41:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:48,093 INFO L225 Difference]: With dead ends: 141 [2018-02-02 18:41:48,093 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 18:41:48,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:41:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 18:41:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-02-02 18:41:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 18:41:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-02-02 18:41:48,098 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 30 [2018-02-02 18:41:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:48,098 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-02-02 18:41:48,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:41:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-02-02 18:41:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 18:41:48,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:48,099 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:48,099 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-02-02 18:41:48,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2050970924, now seen corresponding path program 1 times [2018-02-02 18:41:48,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:48,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:48,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:48,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:48,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:48,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:48,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:48,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:41:48,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:41:48,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:41:48,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:41:48,166 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 5 states. [2018-02-02 18:41:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:48,227 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-02 18:41:48,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:41:48,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 18:41:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:48,228 INFO L225 Difference]: With dead ends: 138 [2018-02-02 18:41:48,228 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 18:41:48,229 INFO L554 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-02-02 18:41:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 18:41:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 18:41:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 18:41:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2018-02-02 18:41:48,232 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 33 [2018-02-02 18:41:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:48,232 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2018-02-02 18:41:48,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:41:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-02-02 18:41:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 18:41:48,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:48,233 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:48,233 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-02-02 18:41:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2050970925, now seen corresponding path program 1 times [2018-02-02 18:41:48,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:48,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:48,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:48,234 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:48,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:48,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:48,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:48,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 18:41:48,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:41:48,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:41:48,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:41:48,347 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 13 states. [2018-02-02 18:41:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:48,529 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2018-02-02 18:41:48,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:41:48,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-02 18:41:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:48,531 INFO L225 Difference]: With dead ends: 152 [2018-02-02 18:41:48,531 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 18:41:48,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:41:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 18:41:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2018-02-02 18:41:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 18:41:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-02-02 18:41:48,535 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 33 [2018-02-02 18:41:48,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:48,535 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-02-02 18:41:48,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:41:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-02-02 18:41:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:41:48,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:48,536 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:48,536 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-02-02 18:41:48,537 INFO L82 PathProgramCache]: Analyzing trace with hash -844410822, now seen corresponding path program 1 times [2018-02-02 18:41:48,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:48,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:48,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:48,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:48,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:48,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:48,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-02-02 18:41:48,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:48,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:41:48,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:41:48,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:41:48,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:41:48,581 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 7 states. [2018-02-02 18:41:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:48,735 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-02-02 18:41:48,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:41:48,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-02 18:41:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:48,736 INFO L225 Difference]: With dead ends: 149 [2018-02-02 18:41:48,736 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 18:41:48,737 INFO L554 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-02-02 18:41:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 18:41:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2018-02-02 18:41:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 18:41:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-02-02 18:41:48,741 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 34 [2018-02-02 18:41:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:48,741 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-02-02 18:41:48,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:41:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-02-02 18:41:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:41:48,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:48,742 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:48,742 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-02-02 18:41:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash -844410821, now seen corresponding path program 1 times [2018-02-02 18:41:48,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:48,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:48,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:48,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:48,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:48,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:48,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:48,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:41:48,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:41:48,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:41:48,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:41:48,862 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 8 states. [2018-02-02 18:41:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:49,049 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-02-02 18:41:49,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:41:49,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 18:41:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:49,051 INFO L225 Difference]: With dead ends: 147 [2018-02-02 18:41:49,051 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 18:41:49,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:41:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 18:41:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2018-02-02 18:41:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 18:41:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-02 18:41:49,055 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 34 [2018-02-02 18:41:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:49,055 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-02 18:41:49,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:41:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-02 18:41:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 18:41:49,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:49,056 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:49,056 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-02-02 18:41:49,056 INFO L82 PathProgramCache]: Analyzing trace with hash 270018269, now seen corresponding path program 1 times [2018-02-02 18:41:49,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:49,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:49,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:49,057 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:49,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:49,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:49,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:49,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 18:41:49,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 18:41:49,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 18:41:49,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:41:49,239 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 17 states. [2018-02-02 18:41:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:49,712 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2018-02-02 18:41:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 18:41:49,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-02-02 18:41:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:49,713 INFO L225 Difference]: With dead ends: 177 [2018-02-02 18:41:49,713 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 18:41:49,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-02-02 18:41:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 18:41:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-02-02 18:41:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 18:41:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2018-02-02 18:41:49,718 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 36 [2018-02-02 18:41:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:49,718 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2018-02-02 18:41:49,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 18:41:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2018-02-02 18:41:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 18:41:49,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:49,719 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:49,719 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-02-02 18:41:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash 270018270, now seen corresponding path program 1 times [2018-02-02 18:41:49,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:49,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:49,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:49,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:49,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:49,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:50,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:50,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 18:41:50,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 18:41:50,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 18:41:50,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:41:50,046 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand 16 states. [2018-02-02 18:41:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:50,518 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2018-02-02 18:41:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 18:41:50,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-02-02 18:41:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:50,519 INFO L225 Difference]: With dead ends: 181 [2018-02-02 18:41:50,520 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 18:41:50,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-02-02 18:41:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 18:41:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-02-02 18:41:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 18:41:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-02-02 18:41:50,525 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 36 [2018-02-02 18:41:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:50,525 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-02-02 18:41:50,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 18:41:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-02-02 18:41:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 18:41:50,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:50,527 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:50,527 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-02-02 18:41:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2076004954, now seen corresponding path program 1 times [2018-02-02 18:41:50,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:50,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:50,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:50,528 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:50,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:50,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:50,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:50,604 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:50,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:50,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:50,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:50,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-02-02 18:41:50,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:41:50,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:41:50,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:41:50,791 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand 13 states. [2018-02-02 18:41:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:51,143 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2018-02-02 18:41:51,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:41:51,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-02-02 18:41:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:51,145 INFO L225 Difference]: With dead ends: 204 [2018-02-02 18:41:51,145 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 18:41:51,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:41:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 18:41:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 179. [2018-02-02 18:41:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 18:41:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2018-02-02 18:41:51,151 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 50 [2018-02-02 18:41:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:51,152 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2018-02-02 18:41:51,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:41:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2018-02-02 18:41:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 18:41:51,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:51,153 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:51,153 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-02-02 18:41:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2076004955, now seen corresponding path program 1 times [2018-02-02 18:41:51,153 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:51,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:51,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:51,154 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:51,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:51,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:51,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:51,370 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:51,379 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:51,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:51,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:41:51,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:51,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:51,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:41:51,566 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-02-02 18:41:51,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:51,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:41:51,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:51,570 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-02-02 18:41:51,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-02-02 18:41:51,596 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~0.base Int)) (= (select |c_#length| insert_sub_~sub~0.base) 12)) (exists ((v_prenex_1 Int)) (and (= (select |c_old(#valid)| v_prenex_1) 0) (= |c_#length| (store |c_old(#length)| v_prenex_1 12))))) is different from true [2018-02-02 18:41:51,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:51,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:51,611 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-02-02 18:41:51,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:51,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:51,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:16 [2018-02-02 18:41:51,620 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~0.base Int)) (= (select |c_#length| insert_sub_~sub~0.base) 12)) (exists ((v_prenex_1 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_1 12)) (not (= v_prenex_1 |c_create_sub_list_#in~sub.base|))))) is different from true [2018-02-02 18:41:51,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:51,630 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-02-02 18:41:51,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:51,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:51,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-02 18:41:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:51,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:51,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-02-02 18:41:51,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 18:41:51,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 18:41:51,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=467, Unknown=3, NotChecked=90, Total=650 [2018-02-02 18:41:51,733 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand 26 states. [2018-02-02 18:41:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:53,180 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2018-02-02 18:41:53,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 18:41:53,181 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-02-02 18:41:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:53,182 INFO L225 Difference]: With dead ends: 234 [2018-02-02 18:41:53,182 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 18:41:53,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=1352, Unknown=18, NotChecked=158, Total=1806 [2018-02-02 18:41:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 18:41:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 197. [2018-02-02 18:41:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 18:41:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2018-02-02 18:41:53,189 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 50 [2018-02-02 18:41:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:53,190 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2018-02-02 18:41:53,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 18:41:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2018-02-02 18:41:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 18:41:53,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:53,191 INFO L351 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-02-02 18:41:53,191 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-02-02 18:41:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash 463776635, now seen corresponding path program 1 times [2018-02-02 18:41:53,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:53,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:53,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:53,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:53,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:53,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:53,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:53,461 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:53,467 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:53,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:53,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:53,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:53,637 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-02-02 18:41:53,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:53,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:53,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:53,646 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-02-02 18:41:53,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:53,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:53,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2018-02-02 18:41:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:53,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:53,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-02-02 18:41:53,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 18:41:53,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 18:41:53,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2018-02-02 18:41:53,746 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand 29 states. [2018-02-02 18:41:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:54,441 INFO L93 Difference]: Finished difference Result 220 states and 243 transitions. [2018-02-02 18:41:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 18:41:54,441 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2018-02-02 18:41:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:54,442 INFO L225 Difference]: With dead ends: 220 [2018-02-02 18:41:54,442 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 18:41:54,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 18:41:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 18:41:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2018-02-02 18:41:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 18:41:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 214 transitions. [2018-02-02 18:41:54,449 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 214 transitions. Word has length 61 [2018-02-02 18:41:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:54,449 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 214 transitions. [2018-02-02 18:41:54,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 18:41:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 214 transitions. [2018-02-02 18:41:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 18:41:54,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:54,450 INFO L351 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-02-02 18:41:54,450 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-02-02 18:41:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1948121973, now seen corresponding path program 1 times [2018-02-02 18:41:54,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:54,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:54,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:54,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:54,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:54,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:55,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:55,132 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:55,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:55,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:55,286 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-02-02 18:41:55,287 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-02-02 18:41:55,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,293 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-02-02 18:41:55,295 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-02-02 18:41:55,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-02 18:41:55,338 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-02-02 18:41:55,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:55,341 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-02-02 18:41:55,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,360 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-02-02 18:41:55,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:55,365 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-02-02 18:41:55,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,392 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-02 18:41:55,626 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-02-02 18:41:55,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,634 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-02-02 18:41:55,636 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-02-02 18:41:55,636 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,646 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:55,651 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-02-02 18:41:55,651 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:47, output treesize:12 [2018-02-02 18:41:56,350 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:56,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:56,379 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:56,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:56,400 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-02-02 18:41:56,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:156, output treesize:230 [2018-02-02 18:41:56,667 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 71 DAG size of output 53 [2018-02-02 18:41:56,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,673 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-02-02 18:41:56,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:56,719 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-02-02 18:41:56,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:41:56,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:56,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,739 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-02-02 18:41:56,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,765 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 59 treesize of output 47 [2018-02-02 18:41:56,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:56,781 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-02-02 18:41:56,797 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-02-02 18:41:56,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,801 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-02-02 18:41:56,802 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:56,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,832 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-02-02 18:41:56,833 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-02 18:41:56,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:41:56,892 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-02-02 18:41:56,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,900 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-02-02 18:41:56,901 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-02 18:41:56,921 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:41:56,926 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-02-02 18:41:56,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,937 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-02-02 18:41:56,937 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-02 18:41:56,957 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:41:56,961 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-02-02 18:41:56,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:56,970 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-02-02 18:41:56,971 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-02-02 18:41:56,990 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:41:57,032 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 18:41:57,085 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 18:41:57,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 18:41:57,178 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-02-02 18:41:57,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:57,180 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-02-02 18:41:57,181 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:57,183 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:57,233 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-02-02 18:41:57,233 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:270, output treesize:457 [2018-02-02 18:41:57,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:57,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:57,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:57,624 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 82 treesize of output 102 [2018-02-02 18:41:57,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:57,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:57,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:57,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:57,653 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 92 treesize of output 104 [2018-02-02 18:41:57,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:57,682 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-02-02 18:41:57,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:175, output treesize:189 [2018-02-02 18:41:57,935 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 97 [2018-02-02 18:41:57,940 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-02-02 18:41:57,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:57,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,001 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 113 treesize of output 105 [2018-02-02 18:41:58,003 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-02-02 18:41:58,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,055 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-02-02 18:41:58,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:219, output treesize:181 [2018-02-02 18:41:58,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:58,479 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 82 treesize of output 69 [2018-02-02 18:41:58,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:58,482 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-02-02 18:41:58,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,492 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-02-02 18:41:58,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:58,520 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 92 treesize of output 77 [2018-02-02 18:41:58,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:58,523 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-02-02 18:41:58,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:58,536 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 37 treesize of output 22 [2018-02-02 18:41:58,536 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:58,560 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-02-02 18:41:58,560 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:175, output treesize:57 [2018-02-02 18:41:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:41:58,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:58,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34] total 62 [2018-02-02 18:41:58,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 18:41:58,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 18:41:58,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3665, Unknown=54, NotChecked=0, Total=3906 [2018-02-02 18:41:58,802 INFO L87 Difference]: Start difference. First operand 196 states and 214 transitions. Second operand 63 states. [2018-02-02 18:42:07,046 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 111 DAG size of output 72 [2018-02-02 18:42:07,340 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 138 DAG size of output 80 [2018-02-02 18:42:07,607 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 131 DAG size of output 93 [2018-02-02 18:42:16,163 WARN L146 SmtUtils]: Spent 8139ms on a formula simplification. DAG size of input: 142 DAG size of output 87 [2018-02-02 18:42:16,451 WARN L146 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 32 DAG size of output 28 [2018-02-02 18:42:16,843 WARN L146 SmtUtils]: Spent 336ms on a formula simplification. DAG size of input: 58 DAG size of output 42 [2018-02-02 18:42:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:42:22,786 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2018-02-02 18:42:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 18:42:22,787 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 61 [2018-02-02 18:42:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:42:22,788 INFO L225 Difference]: With dead ends: 251 [2018-02-02 18:42:22,788 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 18:42:22,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3013 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=753, Invalid=11578, Unknown=101, NotChecked=0, Total=12432 [2018-02-02 18:42:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 18:42:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2018-02-02 18:42:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 18:42:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 234 transitions. [2018-02-02 18:42:22,796 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 234 transitions. Word has length 61 [2018-02-02 18:42:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:42:22,797 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 234 transitions. [2018-02-02 18:42:22,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-02 18:42:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 234 transitions. [2018-02-02 18:42:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 18:42:22,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:42:22,797 INFO L351 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-02-02 18:42:22,798 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-02-02 18:42:22,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1948121972, now seen corresponding path program 1 times [2018-02-02 18:42:22,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:42:22,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:42:22,798 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:42:22,799 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:42:22,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:42:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:42:22,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:42:23,297 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 29 DAG size of output 20 [2018-02-02 18:42:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:42:24,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:42:24,291 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:42:24,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:42:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:42:24,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:42:24,494 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-02-02 18:42:24,496 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-02-02 18:42:24,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,504 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-02-02 18:42:24,514 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-02-02 18:42:24,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-02 18:42:24,555 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-02-02 18:42:24,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:24,557 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-02-02 18:42:24,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,567 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-02-02 18:42:24,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:24,569 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-02-02 18:42:24,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-02 18:42:24,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:42:24,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-02-02 18:42:24,754 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-02-02 18:42:24,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,764 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-02-02 18:42:24,765 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-02-02 18:42:24,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,773 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-02-02 18:42:24,774 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-02-02 18:42:24,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,775 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:24,787 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-02-02 18:42:24,787 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:53, output treesize:12 [2018-02-02 18:42:25,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:25,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:26,025 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:26,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:26,283 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-02-02 18:42:26,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:289, output treesize:467 [2018-02-02 18:42:27,362 WARN L146 SmtUtils]: Spent 887ms on a formula simplification. DAG size of input: 119 DAG size of output 71 [2018-02-02 18:42:27,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,371 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-02-02 18:42:27,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,492 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-02-02 18:42:27,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:42:27,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,568 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-02-02 18:42:27,671 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 60 DAG size of output 52 [2018-02-02 18:42:27,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,678 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 248 treesize of output 228 [2018-02-02 18:42:27,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,731 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-02-02 18:42:27,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,740 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-02-02 18:42:27,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,753 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-02-02 18:42:27,754 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,807 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-02-02 18:42:27,810 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-02-02 18:42:27,811 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,831 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,849 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,936 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-02-02 18:42:27,939 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-02-02 18:42:27,939 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:27,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:27,961 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-02-02 18:42:27,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,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, 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-02-02 18:42:28,000 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,001 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 18:42:28,001 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,028 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 102 [2018-02-02 18:42:28,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,041 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-02-02 18:42:28,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,047 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-02-02 18:42:28,047 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,054 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,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, 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-02-02 18:42:28,085 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-02-02 18:42:28,085 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,113 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,120 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,128 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,137 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,165 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-02-02 18:42:28,165 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:502, output treesize:139 [2018-02-02 18:42:28,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-02 18:42:28,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,491 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-02-02 18:42:28,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:28,509 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-02-02 18:42:28,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:129 [2018-02-02 18:42:28,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:28,779 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-02-02 18:42:28,952 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-02-02 18:42:28,967 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 155 treesize of output 143 [2018-02-02 18:42:28,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:29,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,234 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 97 treesize of output 101 [2018-02-02 18:42:29,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 18:42:29,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:42:29,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,377 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 92 treesize of output 128 [2018-02-02 18:42:29,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,408 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-02-02 18:42:29,409 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:42:29,445 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:42:29,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,461 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-02-02 18:42:29,464 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-02-02 18:42:29,464 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:29,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,545 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-02-02 18:42:29,545 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-02 18:42:29,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:42:29,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,596 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 109 [2018-02-02 18:42:29,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:29,630 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-02-02 18:42:29,632 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:42:29,651 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:29,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-02-02 18:42:29,756 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:159, output treesize:720 [2018-02-02 18:42:30,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:30,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:30,275 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 138 treesize of output 115 [2018-02-02 18:42:30,286 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 68 treesize of output 64 [2018-02-02 18:42:30,287 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:42:30,307 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 67 treesize of output 48 [2018-02-02 18:42:30,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,345 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-02-02 18:42:30,347 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-02-02 18:42:30,347 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,359 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-02-02 18:42:30,360 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,369 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,392 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-02-02 18:42:30,394 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-02-02 18:42:30,394 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,401 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-02-02 18:42:30,402 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:30,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:30,453 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 61 treesize of output 55 [2018-02-02 18:42:30,491 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 28 treesize of output 56 [2018-02-02 18:42:30,493 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-02-02 18:42:30,518 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-02-02 18:42:30,518 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,524 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:30,541 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:252, output treesize:16 [2018-02-02 18:42:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:42:30,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:42:30,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 62 [2018-02-02 18:42:30,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 18:42:30,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 18:42:30,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3701, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 18:42:30,753 INFO L87 Difference]: Start difference. First operand 214 states and 234 transitions. Second operand 63 states. [2018-02-02 18:42:32,436 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 91 DAG size of output 77 [2018-02-02 18:42:35,165 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 101 DAG size of output 67 [2018-02-02 18:42:41,526 WARN L146 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 100 DAG size of output 86 [2018-02-02 18:42:45,175 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 91 DAG size of output 90 [2018-02-02 18:42:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:42:50,720 INFO L93 Difference]: Finished difference Result 276 states and 305 transitions. [2018-02-02 18:42:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-02 18:42:50,721 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 61 [2018-02-02 18:42:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:42:50,722 INFO L225 Difference]: With dead ends: 276 [2018-02-02 18:42:50,722 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 18:42:50,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3742 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=799, Invalid=12763, Unknown=10, NotChecked=0, Total=13572 [2018-02-02 18:42:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 18:42:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 232. [2018-02-02 18:42:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 18:42:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 254 transitions. [2018-02-02 18:42:50,732 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 254 transitions. Word has length 61 [2018-02-02 18:42:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:42:50,732 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 254 transitions. [2018-02-02 18:42:50,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-02 18:42:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 254 transitions. [2018-02-02 18:42:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 18:42:50,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:42:50,734 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 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-02-02 18:42:50,734 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__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-02-02 18:42:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1093164234, now seen corresponding path program 1 times [2018-02-02 18:42:50,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:42:50,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:42:50,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:42:50,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:42:50,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:42:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:42:50,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:42:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:42:51,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:42:51,269 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:42:51,274 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:42:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:42:51,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:42:51,388 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-02-02 18:42:51,389 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-02-02 18:42:51,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,396 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-02-02 18:42:51,397 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-02-02 18:42:51,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-02 18:42:51,429 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-02-02 18:42:51,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:51,431 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-02-02 18:42:51,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,442 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-02-02 18:42:51,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:51,444 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-02-02 18:42:51,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-02 18:42:51,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:51,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:51,548 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-02-02 18:42:51,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2018-02-02 18:42:51,615 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 30 treesize of output 31 [2018-02-02 18:42:51,617 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-02-02 18:42:51,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,630 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 30 treesize of output 31 [2018-02-02 18:42:51,631 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-02-02 18:42:51,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:32 [2018-02-02 18:42:51,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-02 18:42:51,749 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 16 treesize of output 3 [2018-02-02 18:42:51,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-02 18:42:51,756 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 16 treesize of output 3 [2018-02-02 18:42:51,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:51,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:9 [2018-02-02 18:42:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:42:51,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:42:51,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2018-02-02 18:42:51,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 18:42:51,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 18:42:51,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1522, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 18:42:51,847 INFO L87 Difference]: Start difference. First operand 232 states and 254 transitions. Second operand 41 states. [2018-02-02 18:42:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:42:53,104 INFO L93 Difference]: Finished difference Result 257 states and 283 transitions. [2018-02-02 18:42:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 18:42:53,104 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 67 [2018-02-02 18:42:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:42:53,105 INFO L225 Difference]: With dead ends: 257 [2018-02-02 18:42:53,105 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 18:42:53,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=313, Invalid=3469, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 18:42:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 18:42:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2018-02-02 18:42:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 18:42:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 253 transitions. [2018-02-02 18:42:53,113 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 253 transitions. Word has length 67 [2018-02-02 18:42:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:42:53,113 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 253 transitions. [2018-02-02 18:42:53,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 18:42:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 253 transitions. [2018-02-02 18:42:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 18:42:53,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:42:53,114 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 18:42:53,114 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__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-02-02 18:42:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1583175799, now seen corresponding path program 1 times [2018-02-02 18:42:53,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:42:53,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:42:53,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:42:53,115 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:42:53,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:42:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:42:53,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:42:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 18:42:53,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:42:53,523 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:42:53,537 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:42:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:42:53,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:42:53,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:42:53,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:42:53,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:42:53,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,682 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-02-02 18:42:53,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,683 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-02-02 18:42:53,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-02-02 18:42:53,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:53,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:53,823 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-02-02 18:42:53,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:53,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:19 [2018-02-02 18:42:53,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:42:53,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,861 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-02-02 18:42:53,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,862 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-02-02 18:42:53,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-02-02 18:42:53,866 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((insert_sub_~sub~0.base Int)) (= (select |c_#length| insert_sub_~sub~0.base) 12)) (exists ((v_prenex_28 Int)) (and (= (select |c_old(#valid)| v_prenex_28) 0) (= |c_#length| (store |c_old(#length)| v_prenex_28 12))))) is different from true [2018-02-02 18:42:53,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:53,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:53,870 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 11 treesize of output 4 [2018-02-02 18:42:53,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:53,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:23 [2018-02-02 18:42:53,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:53,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-02-02 18:42:53,914 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 23 treesize of output 30 [2018-02-02 18:42:53,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:53,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:53,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2018-02-02 18:42:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2018-02-02 18:42:54,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:42:54,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-02-02 18:42:54,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 18:42:54,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 18:42:54,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1285, Unknown=41, NotChecked=74, Total=1560 [2018-02-02 18:42:54,017 INFO L87 Difference]: Start difference. First operand 232 states and 253 transitions. Second operand 40 states. [2018-02-02 18:42:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:42:55,928 INFO L93 Difference]: Finished difference Result 287 states and 323 transitions. [2018-02-02 18:42:55,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 18:42:55,928 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-02-02 18:42:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:42:55,929 INFO L225 Difference]: With dead ends: 287 [2018-02-02 18:42:55,929 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 18:42:55,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=547, Invalid=4078, Unknown=71, NotChecked=134, Total=4830 [2018-02-02 18:42:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 18:42:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 215. [2018-02-02 18:42:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 18:42:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 232 transitions. [2018-02-02 18:42:55,935 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 232 transitions. Word has length 75 [2018-02-02 18:42:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:42:55,935 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 232 transitions. [2018-02-02 18:42:55,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 18:42:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 232 transitions. [2018-02-02 18:42:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 18:42:55,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:42:55,937 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 18:42:55,937 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__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-02-02 18:42:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1833875810, now seen corresponding path program 2 times [2018-02-02 18:42:55,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:42:55,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:42:55,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:42:55,938 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:42:55,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:42:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:42:56,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:42:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 19 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 18:42:57,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:42:57,335 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:42:57,340 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:42:57,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:42:57,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:42:57,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:42:57,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:42:57,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:42:57,589 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-02-02 18:42:57,591 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-02-02 18:42:57,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,598 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-02-02 18:42:57,599 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-02-02 18:42:57,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-02 18:42:57,644 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-02-02 18:42:57,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:57,646 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-02-02 18:42:57,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,658 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-02-02 18:42:57,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:57,660 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-02-02 18:42:57,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:57,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-02 18:42:58,275 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__list_add_~new.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| |c___list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$.base)| |c___list_add_#in~next.base|) (+ |c___list_add_#in~next.offset| 4) |c___list_add_#in~new.base|)))) (store .cse1 |c___list_add_#in~new.base| (store (store (select .cse1 |c___list_add_#in~new.base|) __list_add_~new.offset |c___list_add_#in~next.base|) (+ __list_add_~new.offset 4) |c___list_add_#in~prev.base|))))) (store .cse0 |c___list_add_#in~prev.base| (store (select .cse0 |c___list_add_#in~prev.base|) |c___list_add_#in~prev.offset| |c___list_add_#in~new.base|))))) is different from true [2018-02-02 18:42:58,279 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__list_add_~new.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse4 (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head.base|)) (.cse2 (+ |c_list_add_tail_#in~head.offset| 4))) (let ((.cse1 (select .cse4 .cse2))) (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head.base| (store .cse4 .cse2 |c_list_add_tail_#in~new.base|)))) (store .cse3 |c_list_add_tail_#in~new.base| (store (store (select .cse3 |c_list_add_tail_#in~new.base|) __list_add_~new.offset |c_list_add_tail_#in~head.base|) (+ __list_add_~new.offset 4) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select |c_old(#memory_$Pointer$.offset)| |c_list_add_tail_#in~head.base|) .cse2) |c_list_add_tail_#in~new.base|))))))) is different from true [2018-02-02 18:42:58,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:58,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:58,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:58,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:58,317 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-02-02 18:42:58,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:143, output treesize:217 [2018-02-02 18:42:58,321 WARN L1033 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~0.base Int) (__list_add_~new.offset Int) (v_DerPreprocessor_14 Int) (v_DerPreprocessor_12 Int) (insert_sub_~sub~0.offset Int)) (and (= (select |c_old(#valid)| insert_sub_~sub~0.base) 0) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| insert_sub_~sub~0.base (store (select |c_old(#memory_$Pointer$.base)| insert_sub_~sub~0.base) insert_sub_~sub~0.offset v_DerPreprocessor_12)))) (let ((.cse5 (select .cse4 |c_insert_sub_#in~head.base|)) (.cse2 (+ |c_insert_sub_#in~head.offset| 4))) (let ((.cse1 (select .cse5 .cse2))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_insert_sub_#in~head.base| (store .cse5 .cse2 insert_sub_~sub~0.base)))) (store .cse3 insert_sub_~sub~0.base (store (store (select .cse3 insert_sub_~sub~0.base) __list_add_~new.offset |c_insert_sub_#in~head.base|) (+ __list_add_~new.offset 4) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select (store |c_old(#memory_$Pointer$.offset)| insert_sub_~sub~0.base (store (select |c_old(#memory_$Pointer$.offset)| insert_sub_~sub~0.base) insert_sub_~sub~0.offset v_DerPreprocessor_14)) |c_insert_sub_#in~head.base|) .cse2) insert_sub_~sub~0.base))))))))) is different from true [2018-02-02 18:42:58,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,407 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-02-02 18:42:58,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,432 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 188 treesize of output 136 [2018-02-02 18:42:58,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:42:58,434 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,449 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 131 treesize of output 101 [2018-02-02 18:42:58,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,478 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 73 treesize of output 57 [2018-02-02 18:42:58,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,492 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 54 treesize of output 56 [2018-02-02 18:42:58,503 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-02-02 18:42:58,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,505 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-02-02 18:42:58,506 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,526 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-02-02 18:42:58,526 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-02 18:42:58,543 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:42:58,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 66 [2018-02-02 18:42:58,572 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 39 treesize of output 42 [2018-02-02 18:42:58,572 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,579 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,582 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 62 [2018-02-02 18:42:58,584 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 39 treesize of output 42 [2018-02-02 18:42:58,584 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,591 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,594 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 64 [2018-02-02 18:42:58,596 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 39 treesize of output 42 [2018-02-02 18:42:58,596 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,603 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,623 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:42:58,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:42:58,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:42:58,693 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 58 treesize of output 52 [2018-02-02 18:42:58,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,695 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 24 treesize of output 14 [2018-02-02 18:42:58,695 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,708 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,709 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 62 treesize of output 56 [2018-02-02 18:42:58,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,711 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 24 treesize of output 14 [2018-02-02 18:42:58,711 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,716 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,718 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 60 treesize of output 54 [2018-02-02 18:42:58,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:58,720 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 24 treesize of output 14 [2018-02-02 18:42:58,720 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,725 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 18:42:58,748 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 8 variables, input treesize:257, output treesize:166 [2018-02-02 18:42:58,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:42:58,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:58,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-02 18:42:59,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:59,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:59,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:59,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:14 [2018-02-02 18:42:59,258 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-02-02 18:42:59,260 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-02-02 18:42:59,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:59,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:59,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:42:59,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-02 18:42:59,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-02 18:42:59,352 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 22 treesize of output 27 [2018-02-02 18:42:59,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:59,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-02-02 18:42:59,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:42:59,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:42:59,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:42:59,411 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:140 [2018-02-02 18:42:59,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2018-02-02 18:42:59,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:59,603 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-02-02 18:42:59,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:59,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:42:59,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 99 [2018-02-02 18:42:59,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:59,740 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 90 treesize of output 103 [2018-02-02 18:42:59,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:42:59,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:59,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:42:59,960 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 2 case distinctions, treesize of input 85 treesize of output 104 [2018-02-02 18:42:59,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-02 18:43:00,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:43:00,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 18:43:00,081 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:176, output treesize:250 [2018-02-02 18:43:00,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 142 [2018-02-02 18:43:00,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:43:00,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:43:00,354 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 159 [2018-02-02 18:43:00,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-02-02 18:43:00,504 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 131 treesize of output 130 [2018-02-02 18:43:00,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:43:00,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:43:01,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 132 [2018-02-02 18:43:01,825 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 125 treesize of output 124 [2018-02-02 18:43:01,825 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:43:01,886 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:43:02,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 175 treesize of output 182 [2018-02-02 18:43:02,837 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 180 treesize of output 179 [2018-02-02 18:43:02,837 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:43:04,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:43:04,473 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 212 [2018-02-02 18:43:04,474 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. Received shutdown request... [2018-02-02 18:43:04,741 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 18:43:04,741 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:43:04,744 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:43:04,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:43:04 BoogieIcfgContainer [2018-02-02 18:43:04,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:43:04,745 INFO L168 Benchmark]: Toolchain (without parser) took 79253.72 ms. Allocated memory was 402.1 MB in the beginning and 942.1 MB in the end (delta: 540.0 MB). Free memory was 359.0 MB in the beginning and 438.3 MB in the end (delta: -79.3 MB). Peak memory consumption was 460.7 MB. Max. memory is 5.3 GB. [2018-02-02 18:43:04,746 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:43:04,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.44 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 347.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 18:43:04,746 INFO L168 Benchmark]: Boogie Preprocessor took 28.27 ms. Allocated memory is still 402.1 MB. Free memory was 347.1 MB in the beginning and 345.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:43:04,746 INFO L168 Benchmark]: RCFGBuilder took 345.07 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 313.2 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:43:04,746 INFO L168 Benchmark]: TraceAbstraction took 78704.60 ms. Allocated memory was 402.1 MB in the beginning and 942.1 MB in the end (delta: 540.0 MB). Free memory was 311.9 MB in the beginning and 438.3 MB in the end (delta: -126.5 MB). Peak memory consumption was 413.5 MB. Max. memory is 5.3 GB. [2018-02-02 18:43:04,747 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.44 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 347.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.27 ms. Allocated memory is still 402.1 MB. Free memory was 347.1 MB in the beginning and 345.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 345.07 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 313.2 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 78704.60 ms. Allocated memory was 402.1 MB in the beginning and 942.1 MB in the end (delta: 540.0 MB). Free memory was 311.9 MB in the beginning and 438.3 MB in the end (delta: -126.5 MB). Peak memory consumption was 413.5 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 analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 696]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 696). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 93. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 120 locations, 33 error locations. TIMEOUT Result, 78.6s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 52.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2046 SDtfs, 1942 SDslu, 13229 SDs, 0 SdLazy, 19215 SolverSat, 801 SolverUnsat, 205 SolverUnknown, 0 SolverNotchecked, 21.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 947 GetRequests, 328 SyntacticMatches, 39 SemanticMatches, 580 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 9731 ImplicationChecksByTransitivity, 37.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 296 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1194 ConstructedInterpolants, 158 QuantifiedInterpolants, 998952 SizeOfPredicates, 148 NumberOfNonLiveVariables, 2576 ConjunctsInSsa, 537 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 43/190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-43-04-753.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-43-04-753.csv Completed graceful shutdown