java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:46:49,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:46:49,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:46:49,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:46:49,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:46:49,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:46:49,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:46:49,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:46:49,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:46:49,236 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:46:49,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:46:49,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:46:49,238 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:46:49,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:46:49,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:46:49,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:46:49,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:46:49,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:46:49,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:46:49,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:46:49,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:46:49,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:46:49,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:46:49,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:46:49,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:46:49,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:46:49,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:46:49,255 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:46:49,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:46:49,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:46:49,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:46:49,257 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:46:49,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:46:49,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:46:49,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:46:49,267 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:46:49,268 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:46:49,268 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:46:49,268 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:46:49,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:46:49,269 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:46:49,269 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:46:49,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:46:49,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:46:49,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:46:49,270 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:46:49,270 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:46:49,270 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:46:49,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:46:49,270 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:46:49,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:46:49,271 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:46:49,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:46:49,271 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:46:49,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:46:49,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:46:49,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:46:49,272 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:46:49,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:46:49,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:46:49,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:46:49,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:46:49,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:46:49,273 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:46:49,274 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:46:49,274 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:46:49,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:46:49,322 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:46:49,326 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:46:49,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:46:49,328 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:46:49,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-01-28 22:46:49,515 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:46:49,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:46:49,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:46:49,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:46:49,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:46:49,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e97ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49, skipping insertion in model container [2018-01-28 22:46:49,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,552 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:46:49,592 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:46:49,707 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:46:49,724 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:46:49,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49 WrapperNode [2018-01-28 22:46:49,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:46:49,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:46:49,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:46:49,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:46:49,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (1/1) ... [2018-01-28 22:46:49,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:46:49,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:46:49,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:46:49,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:46:49,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:46:49,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:46:49,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:46:49,819 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-28 22:46:49,819 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-01-28 22:46:49,819 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-01-28 22:46:49,820 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-01-28 22:46:49,820 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:46:49,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:46:49,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:46:49,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:46:49,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:46:49,821 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:46:49,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-28 22:46:49,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-01-28 22:46:49,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-28 22:46:49,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-28 22:46:49,821 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-01-28 22:46:49,822 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-01-28 22:46:49,822 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-01-28 22:46:49,822 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:46:49,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:46:49,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:46:50,271 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:46:50,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:46:50 BoogieIcfgContainer [2018-01-28 22:46:50,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:46:50,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:46:50,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:46:50,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:46:50,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:46:49" (1/3) ... [2018-01-28 22:46:50,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6425ac9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:46:50, skipping insertion in model container [2018-01-28 22:46:50,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:46:49" (2/3) ... [2018-01-28 22:46:50,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6425ac9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:46:50, skipping insertion in model container [2018-01-28 22:46:50,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:46:50" (3/3) ... [2018-01-28 22:46:50,293 INFO L107 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-01-28 22:46:50,299 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:46:50,305 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-28 22:46:50,354 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:46:50,354 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:46:50,354 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:46:50,354 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:46:50,354 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:46:50,355 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:46:50,355 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:46:50,355 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:46:50,355 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:46:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-01-28 22:46:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-28 22:46:50,378 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:50,379 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:50,379 INFO L371 AbstractCegarLoop]: === Iteration 1 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:50,383 INFO L82 PathProgramCache]: Analyzing trace with hash -899082593, now seen corresponding path program 1 times [2018-01-28 22:46:50,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:50,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:50,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:50,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:50,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:50,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:50,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:50,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:46:50,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:46:50,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:46:50,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:46:50,550 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-01-28 22:46:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:50,753 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2018-01-28 22:46:50,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:46:50,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-28 22:46:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:50,765 INFO L225 Difference]: With dead ends: 263 [2018-01-28 22:46:50,765 INFO L226 Difference]: Without dead ends: 143 [2018-01-28 22:46:50,768 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:46:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-28 22:46:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-28 22:46:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-28 22:46:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2018-01-28 22:46:50,809 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 8 [2018-01-28 22:46:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:50,809 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2018-01-28 22:46:50,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:46:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2018-01-28 22:46:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-28 22:46:50,810 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:50,810 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:50,810 INFO L371 AbstractCegarLoop]: === Iteration 2 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash -899082592, now seen corresponding path program 1 times [2018-01-28 22:46:50,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:50,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:50,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:50,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:50,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:50,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:50,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:50,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:46:50,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:46:50,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:46:50,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:46:50,879 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand 3 states. [2018-01-28 22:46:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:51,013 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-01-28 22:46:51,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:46:51,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-28 22:46:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:51,016 INFO L225 Difference]: With dead ends: 143 [2018-01-28 22:46:51,016 INFO L226 Difference]: Without dead ends: 141 [2018-01-28 22:46:51,017 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:46:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-28 22:46:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-28 22:46:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-28 22:46:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2018-01-28 22:46:51,030 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 8 [2018-01-28 22:46:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:51,031 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2018-01-28 22:46:51,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:46:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2018-01-28 22:46:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 22:46:51,031 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:51,031 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:51,032 INFO L371 AbstractCegarLoop]: === Iteration 3 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:51,032 INFO L82 PathProgramCache]: Analyzing trace with hash -963325212, now seen corresponding path program 1 times [2018-01-28 22:46:51,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:51,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:51,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:51,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:51,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:51,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:51,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:51,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:46:51,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:46:51,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:46:51,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:46:51,217 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand 6 states. [2018-01-28 22:46:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:51,469 INFO L93 Difference]: Finished difference Result 296 states and 335 transitions. [2018-01-28 22:46:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:46:51,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-28 22:46:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:51,473 INFO L225 Difference]: With dead ends: 296 [2018-01-28 22:46:51,473 INFO L226 Difference]: Without dead ends: 187 [2018-01-28 22:46:51,474 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:46:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-28 22:46:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2018-01-28 22:46:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-28 22:46:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2018-01-28 22:46:51,492 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 19 [2018-01-28 22:46:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:51,492 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2018-01-28 22:46:51,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:46:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2018-01-28 22:46:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 22:46:51,493 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:51,493 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:51,493 INFO L371 AbstractCegarLoop]: === Iteration 4 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash -501960631, now seen corresponding path program 1 times [2018-01-28 22:46:51,494 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:51,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:51,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:51,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:51,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:51,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:51,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:51,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:46:51,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:46:51,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:46:51,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:46:51,555 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand 4 states. [2018-01-28 22:46:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:51,709 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2018-01-28 22:46:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:46:51,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-28 22:46:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:51,711 INFO L225 Difference]: With dead ends: 195 [2018-01-28 22:46:51,711 INFO L226 Difference]: Without dead ends: 193 [2018-01-28 22:46:51,712 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:46:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-28 22:46:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 170. [2018-01-28 22:46:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-28 22:46:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 196 transitions. [2018-01-28 22:46:51,730 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 196 transitions. Word has length 18 [2018-01-28 22:46:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:51,730 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 196 transitions. [2018-01-28 22:46:51,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:46:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 196 transitions. [2018-01-28 22:46:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 22:46:51,731 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:51,732 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:51,732 INFO L371 AbstractCegarLoop]: === Iteration 5 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:51,732 INFO L82 PathProgramCache]: Analyzing trace with hash -501960630, now seen corresponding path program 1 times [2018-01-28 22:46:51,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:51,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:51,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:51,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:51,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:51,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:51,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:51,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:46:51,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:46:51,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:46:51,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:46:51,812 INFO L87 Difference]: Start difference. First operand 170 states and 196 transitions. Second operand 4 states. [2018-01-28 22:46:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:52,066 INFO L93 Difference]: Finished difference Result 196 states and 230 transitions. [2018-01-28 22:46:52,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:46:52,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-28 22:46:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:52,069 INFO L225 Difference]: With dead ends: 196 [2018-01-28 22:46:52,069 INFO L226 Difference]: Without dead ends: 194 [2018-01-28 22:46:52,069 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:46:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-28 22:46:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 168. [2018-01-28 22:46:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-28 22:46:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 192 transitions. [2018-01-28 22:46:52,086 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 192 transitions. Word has length 18 [2018-01-28 22:46:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:52,087 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 192 transitions. [2018-01-28 22:46:52,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:46:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 192 transitions. [2018-01-28 22:46:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:46:52,088 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:52,088 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:52,089 INFO L371 AbstractCegarLoop]: === Iteration 6 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1347829204, now seen corresponding path program 1 times [2018-01-28 22:46:52,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:52,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:52,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:52,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:52,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:52,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:52,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:52,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:46:52,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:46:52,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:46:52,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:46:52,194 INFO L87 Difference]: Start difference. First operand 168 states and 192 transitions. Second operand 7 states. [2018-01-28 22:46:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:52,403 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2018-01-28 22:46:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:46:52,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-28 22:46:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:52,406 INFO L225 Difference]: With dead ends: 204 [2018-01-28 22:46:52,406 INFO L226 Difference]: Without dead ends: 203 [2018-01-28 22:46:52,406 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:46:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-28 22:46:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 167. [2018-01-28 22:46:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-28 22:46:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2018-01-28 22:46:52,420 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 20 [2018-01-28 22:46:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:52,421 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2018-01-28 22:46:52,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:46:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-01-28 22:46:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:46:52,422 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:52,422 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:52,422 INFO L371 AbstractCegarLoop]: === Iteration 7 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1347829203, now seen corresponding path program 1 times [2018-01-28 22:46:52,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:52,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:52,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:52,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:52,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:52,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:52,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:52,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:46:52,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:46:52,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:46:52,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:46:52,558 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand 6 states. [2018-01-28 22:46:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:52,703 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-01-28 22:46:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:46:52,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-28 22:46:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:52,705 INFO L225 Difference]: With dead ends: 167 [2018-01-28 22:46:52,705 INFO L226 Difference]: Without dead ends: 166 [2018-01-28 22:46:52,706 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:46:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-28 22:46:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-01-28 22:46:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-28 22:46:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 188 transitions. [2018-01-28 22:46:52,721 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 188 transitions. Word has length 20 [2018-01-28 22:46:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:52,721 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 188 transitions. [2018-01-28 22:46:52,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:46:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2018-01-28 22:46:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 22:46:52,722 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:52,722 INFO L330 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] [2018-01-28 22:46:52,722 INFO L371 AbstractCegarLoop]: === Iteration 8 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash -564056031, now seen corresponding path program 1 times [2018-01-28 22:46:52,723 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:52,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:52,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:52,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:52,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:52,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:52,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:52,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:46:52,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:46:52,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:46:52,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:46:52,804 INFO L87 Difference]: Start difference. First operand 166 states and 188 transitions. Second operand 6 states. [2018-01-28 22:46:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:53,078 INFO L93 Difference]: Finished difference Result 204 states and 233 transitions. [2018-01-28 22:46:53,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:46:53,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-28 22:46:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:53,080 INFO L225 Difference]: With dead ends: 204 [2018-01-28 22:46:53,081 INFO L226 Difference]: Without dead ends: 198 [2018-01-28 22:46:53,081 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:46:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-28 22:46:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2018-01-28 22:46:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-28 22:46:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2018-01-28 22:46:53,097 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 26 [2018-01-28 22:46:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:53,097 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2018-01-28 22:46:53,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:46:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2018-01-28 22:46:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 22:46:53,098 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:53,098 INFO L330 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] [2018-01-28 22:46:53,098 INFO L371 AbstractCegarLoop]: === Iteration 9 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:53,099 INFO L82 PathProgramCache]: Analyzing trace with hash -564056030, now seen corresponding path program 1 times [2018-01-28 22:46:53,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:53,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:53,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:53,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:53,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:53,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:53,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:53,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:46:53,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:46:53,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:46:53,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:46:53,203 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand 6 states. [2018-01-28 22:46:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:53,652 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2018-01-28 22:46:53,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:46:53,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-28 22:46:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:53,655 INFO L225 Difference]: With dead ends: 201 [2018-01-28 22:46:53,655 INFO L226 Difference]: Without dead ends: 195 [2018-01-28 22:46:53,655 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:46:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-28 22:46:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2018-01-28 22:46:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-28 22:46:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2018-01-28 22:46:53,670 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 26 [2018-01-28 22:46:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:53,671 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2018-01-28 22:46:53,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:46:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2018-01-28 22:46:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:46:53,672 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:53,672 INFO L330 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] [2018-01-28 22:46:53,672 INFO L371 AbstractCegarLoop]: === Iteration 10 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:53,672 INFO L82 PathProgramCache]: Analyzing trace with hash 460412558, now seen corresponding path program 1 times [2018-01-28 22:46:53,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:53,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:53,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:53,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:53,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:53,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:53,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:53,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:46:53,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:46:53,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:46:53,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:46:53,914 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand 9 states. [2018-01-28 22:46:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:54,258 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2018-01-28 22:46:54,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:46:54,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-28 22:46:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:54,260 INFO L225 Difference]: With dead ends: 293 [2018-01-28 22:46:54,261 INFO L226 Difference]: Without dead ends: 217 [2018-01-28 22:46:54,261 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:46:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-28 22:46:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2018-01-28 22:46:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-28 22:46:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 234 transitions. [2018-01-28 22:46:54,283 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 234 transitions. Word has length 31 [2018-01-28 22:46:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:54,283 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 234 transitions. [2018-01-28 22:46:54,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:46:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 234 transitions. [2018-01-28 22:46:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:46:54,285 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:54,285 INFO L330 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] [2018-01-28 22:46:54,285 INFO L371 AbstractCegarLoop]: === Iteration 11 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash -181292614, now seen corresponding path program 1 times [2018-01-28 22:46:54,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:54,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:54,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:54,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:54,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:54,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:54,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:46:54,353 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:46:54,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:54,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:46:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:54,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:46:54,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-28 22:46:54,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:46:54,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:46:54,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:46:54,446 INFO L87 Difference]: Start difference. First operand 202 states and 234 transitions. Second operand 6 states. [2018-01-28 22:46:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:54,651 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2018-01-28 22:46:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:46:54,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-28 22:46:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:54,654 INFO L225 Difference]: With dead ends: 223 [2018-01-28 22:46:54,654 INFO L226 Difference]: Without dead ends: 221 [2018-01-28 22:46:54,655 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:46:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-28 22:46:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-01-28 22:46:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-28 22:46:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 253 transitions. [2018-01-28 22:46:54,676 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 253 transitions. Word has length 31 [2018-01-28 22:46:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:54,676 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 253 transitions. [2018-01-28 22:46:54,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:46:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 253 transitions. [2018-01-28 22:46:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:46:54,677 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:54,677 INFO L330 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] [2018-01-28 22:46:54,677 INFO L371 AbstractCegarLoop]: === Iteration 12 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash -181292613, now seen corresponding path program 1 times [2018-01-28 22:46:54,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:54,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:54,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:54,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:54,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:54,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:54,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:46:54,767 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:46:54,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:54,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:46:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:54,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:46:54,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-01-28 22:46:54,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:46:54,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:46:54,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:46:54,971 INFO L87 Difference]: Start difference. First operand 217 states and 253 transitions. Second operand 12 states. [2018-01-28 22:46:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:55,636 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2018-01-28 22:46:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:46:55,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-01-28 22:46:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:55,675 INFO L225 Difference]: With dead ends: 220 [2018-01-28 22:46:55,675 INFO L226 Difference]: Without dead ends: 218 [2018-01-28 22:46:55,675 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:46:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-28 22:46:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-01-28 22:46:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-28 22:46:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2018-01-28 22:46:55,693 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 31 [2018-01-28 22:46:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:55,693 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2018-01-28 22:46:55,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:46:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2018-01-28 22:46:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:46:55,694 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:55,695 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:55,695 INFO L371 AbstractCegarLoop]: === Iteration 13 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash 935312203, now seen corresponding path program 1 times [2018-01-28 22:46:55,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:55,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:55,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:55,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:55,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:55,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:55,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:55,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:46:55,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:46:55,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:46:55,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:46:55,860 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand 8 states. [2018-01-28 22:46:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:56,090 INFO L93 Difference]: Finished difference Result 290 states and 331 transitions. [2018-01-28 22:46:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:46:56,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-28 22:46:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:56,092 INFO L225 Difference]: With dead ends: 290 [2018-01-28 22:46:56,092 INFO L226 Difference]: Without dead ends: 225 [2018-01-28 22:46:56,093 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:46:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-28 22:46:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 216. [2018-01-28 22:46:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-28 22:46:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 248 transitions. [2018-01-28 22:46:56,104 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 248 transitions. Word has length 34 [2018-01-28 22:46:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:56,104 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 248 transitions. [2018-01-28 22:46:56,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:46:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 248 transitions. [2018-01-28 22:46:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:46:56,105 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:56,105 INFO L330 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] [2018-01-28 22:46:56,105 INFO L371 AbstractCegarLoop]: === Iteration 14 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1667896459, now seen corresponding path program 1 times [2018-01-28 22:46:56,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:56,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:56,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:56,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:56,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:56,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:56,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:46:56,215 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:46:56,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:56,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:46:56,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:46:56,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:46:56,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:46:56,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:46:56,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:46:56,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:46:56,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:46:56,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:46:56,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:46:56,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-28 22:46:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:56,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:46:56,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-28 22:46:56,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:46:56,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:46:56,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:46:56,326 INFO L87 Difference]: Start difference. First operand 216 states and 248 transitions. Second operand 9 states. [2018-01-28 22:46:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:56,599 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2018-01-28 22:46:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:46:56,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-28 22:46:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:56,600 INFO L225 Difference]: With dead ends: 363 [2018-01-28 22:46:56,600 INFO L226 Difference]: Without dead ends: 242 [2018-01-28 22:46:56,601 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:46:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-28 22:46:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2018-01-28 22:46:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-28 22:46:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2018-01-28 22:46:56,614 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 38 [2018-01-28 22:46:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:56,614 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2018-01-28 22:46:56,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:46:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2018-01-28 22:46:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 22:46:56,615 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:56,615 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:56,615 INFO L371 AbstractCegarLoop]: === Iteration 15 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:56,615 INFO L82 PathProgramCache]: Analyzing trace with hash 743369402, now seen corresponding path program 1 times [2018-01-28 22:46:56,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:56,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:56,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:56,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:56,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:56,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:56,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:46:56,946 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:46:56,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:56,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:46:57,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:46:57,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:46:57,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:46:57,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:46:57,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:46:57,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-28 22:46:57,102 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 21 treesize of output 17 [2018-01-28 22:46:57,104 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 17 treesize of output 5 [2018-01-28 22:46:57,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:46:57,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:46:57,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:46:57,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-28 22:46:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:57,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:46:57,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 25 [2018-01-28 22:46:57,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 22:46:57,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 22:46:57,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:46:57,177 INFO L87 Difference]: Start difference. First operand 215 states and 246 transitions. Second operand 25 states. [2018-01-28 22:46:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:58,562 INFO L93 Difference]: Finished difference Result 462 states and 541 transitions. [2018-01-28 22:46:58,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 22:46:58,563 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-01-28 22:46:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:58,565 INFO L225 Difference]: With dead ends: 462 [2018-01-28 22:46:58,565 INFO L226 Difference]: Without dead ends: 345 [2018-01-28 22:46:58,567 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2018-01-28 22:46:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-28 22:46:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 281. [2018-01-28 22:46:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-28 22:46:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 318 transitions. [2018-01-28 22:46:58,591 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 318 transitions. Word has length 39 [2018-01-28 22:46:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:58,591 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 318 transitions. [2018-01-28 22:46:58,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 22:46:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 318 transitions. [2018-01-28 22:46:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 22:46:58,593 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:58,593 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:58,593 INFO L371 AbstractCegarLoop]: === Iteration 16 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash -632231427, now seen corresponding path program 1 times [2018-01-28 22:46:58,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:58,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:58,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:58,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:58,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:58,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:58,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:58,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:46:58,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:46:58,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:46:58,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:46:58,648 INFO L87 Difference]: Start difference. First operand 281 states and 318 transitions. Second operand 6 states. [2018-01-28 22:46:59,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:59,109 INFO L93 Difference]: Finished difference Result 326 states and 377 transitions. [2018-01-28 22:46:59,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:46:59,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-28 22:46:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:59,112 INFO L225 Difference]: With dead ends: 326 [2018-01-28 22:46:59,113 INFO L226 Difference]: Without dead ends: 325 [2018-01-28 22:46:59,113 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:46:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-01-28 22:46:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 280. [2018-01-28 22:46:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-28 22:46:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 317 transitions. [2018-01-28 22:46:59,136 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 317 transitions. Word has length 41 [2018-01-28 22:46:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:59,137 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 317 transitions. [2018-01-28 22:46:59,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:46:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 317 transitions. [2018-01-28 22:46:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 22:46:59,138 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:59,138 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:46:59,138 INFO L371 AbstractCegarLoop]: === Iteration 17 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash -632231426, now seen corresponding path program 1 times [2018-01-28 22:46:59,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:59,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:59,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:59,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:59,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:59,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 22:46:59,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:46:59,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:46:59,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:46:59,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:46:59,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:46:59,175 INFO L87 Difference]: Start difference. First operand 280 states and 317 transitions. Second operand 4 states. [2018-01-28 22:46:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:46:59,197 INFO L93 Difference]: Finished difference Result 406 states and 456 transitions. [2018-01-28 22:46:59,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:46:59,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-01-28 22:46:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:46:59,199 INFO L225 Difference]: With dead ends: 406 [2018-01-28 22:46:59,199 INFO L226 Difference]: Without dead ends: 282 [2018-01-28 22:46:59,200 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:46:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-28 22:46:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 276. [2018-01-28 22:46:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-01-28 22:46:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2018-01-28 22:46:59,220 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 41 [2018-01-28 22:46:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:46:59,221 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2018-01-28 22:46:59,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:46:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2018-01-28 22:46:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:46:59,221 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:46:59,222 INFO L330 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] [2018-01-28 22:46:59,222 INFO L371 AbstractCegarLoop]: === Iteration 18 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:46:59,222 INFO L82 PathProgramCache]: Analyzing trace with hash 262692435, now seen corresponding path program 1 times [2018-01-28 22:46:59,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:46:59,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:46:59,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:59,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:59,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:46:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:59,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:46:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:59,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:46:59,506 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:46:59,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:46:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:46:59,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:46:59,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:46:59,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:46:59,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:46:59,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:46:59,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:46:59,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-28 22:46:59,780 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 21 treesize of output 17 [2018-01-28 22:46:59,790 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-01-28 22:46:59,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:46:59,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:46:59,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:46:59,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:24 [2018-01-28 22:46:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:46:59,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:46:59,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-28 22:46:59,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:46:59,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:46:59,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:46:59,909 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 21 states. [2018-01-28 22:47:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:01,615 INFO L93 Difference]: Finished difference Result 484 states and 555 transitions. [2018-01-28 22:47:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:47:01,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-01-28 22:47:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:01,642 INFO L225 Difference]: With dead ends: 484 [2018-01-28 22:47:01,643 INFO L226 Difference]: Without dead ends: 483 [2018-01-28 22:47:01,643 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2018-01-28 22:47:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-01-28 22:47:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 391. [2018-01-28 22:47:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-01-28 22:47:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 454 transitions. [2018-01-28 22:47:01,672 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 454 transitions. Word has length 42 [2018-01-28 22:47:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:01,672 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 454 transitions. [2018-01-28 22:47:01,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:47:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 454 transitions. [2018-01-28 22:47:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:47:01,673 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:01,673 INFO L330 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] [2018-01-28 22:47:01,673 INFO L371 AbstractCegarLoop]: === Iteration 19 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:47:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash 262692436, now seen corresponding path program 1 times [2018-01-28 22:47:01,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:01,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:01,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:01,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:01,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:01,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:02,056 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 25 DAG size of output 23 [2018-01-28 22:47:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:02,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:47:02,500 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:47:02,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:02,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:47:02,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:47:02,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:47:02,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:47:02,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:47:02,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:38 [2018-01-28 22:47:02,825 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 29 treesize of output 25 [2018-01-28 22:47:02,827 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 25 treesize of output 13 [2018-01-28 22:47:02,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,837 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 41 treesize of output 33 [2018-01-28 22:47:02,839 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 33 treesize of output 14 [2018-01-28 22:47:02,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:02,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:14 [2018-01-28 22:47:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:02,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:47:02,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 28 [2018-01-28 22:47:02,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:47:02,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:47:02,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=716, Unknown=4, NotChecked=0, Total=812 [2018-01-28 22:47:02,891 INFO L87 Difference]: Start difference. First operand 391 states and 454 transitions. Second operand 29 states. [2018-01-28 22:47:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:06,834 INFO L93 Difference]: Finished difference Result 463 states and 536 transitions. [2018-01-28 22:47:06,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-28 22:47:06,863 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2018-01-28 22:47:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:06,864 INFO L225 Difference]: With dead ends: 463 [2018-01-28 22:47:06,864 INFO L226 Difference]: Without dead ends: 462 [2018-01-28 22:47:06,865 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=385, Invalid=2055, Unknown=10, NotChecked=0, Total=2450 [2018-01-28 22:47:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-01-28 22:47:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 410. [2018-01-28 22:47:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-01-28 22:47:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 475 transitions. [2018-01-28 22:47:06,890 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 475 transitions. Word has length 42 [2018-01-28 22:47:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:06,891 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 475 transitions. [2018-01-28 22:47:06,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:47:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 475 transitions. [2018-01-28 22:47:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:47:06,892 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:06,892 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:06,892 INFO L371 AbstractCegarLoop]: === Iteration 20 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:47:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2116034005, now seen corresponding path program 1 times [2018-01-28 22:47:06,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:06,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:06,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:06,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:06,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:06,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:07,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:07,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:47:07,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:47:07,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:47:07,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:47:07,012 INFO L87 Difference]: Start difference. First operand 410 states and 475 transitions. Second operand 7 states. [2018-01-28 22:47:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:07,347 INFO L93 Difference]: Finished difference Result 450 states and 526 transitions. [2018-01-28 22:47:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:47:07,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-01-28 22:47:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:07,349 INFO L225 Difference]: With dead ends: 450 [2018-01-28 22:47:07,349 INFO L226 Difference]: Without dead ends: 446 [2018-01-28 22:47:07,350 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-01-28 22:47:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 433. [2018-01-28 22:47:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-01-28 22:47:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 509 transitions. [2018-01-28 22:47:07,384 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 509 transitions. Word has length 45 [2018-01-28 22:47:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:07,384 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 509 transitions. [2018-01-28 22:47:07,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:47:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 509 transitions. [2018-01-28 22:47:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:47:07,386 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:07,386 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:07,386 INFO L371 AbstractCegarLoop]: === Iteration 21 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:47:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2116034004, now seen corresponding path program 1 times [2018-01-28 22:47:07,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:07,386 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:07,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:07,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:07,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:07,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:07,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:07,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:47:07,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:47:07,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:47:07,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:47:07,553 INFO L87 Difference]: Start difference. First operand 433 states and 509 transitions. Second operand 7 states. [2018-01-28 22:47:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:07,737 INFO L93 Difference]: Finished difference Result 449 states and 518 transitions. [2018-01-28 22:47:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:47:07,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-01-28 22:47:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:07,739 INFO L225 Difference]: With dead ends: 449 [2018-01-28 22:47:07,739 INFO L226 Difference]: Without dead ends: 445 [2018-01-28 22:47:07,740 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-01-28 22:47:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 433. [2018-01-28 22:47:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-01-28 22:47:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 503 transitions. [2018-01-28 22:47:07,776 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 503 transitions. Word has length 45 [2018-01-28 22:47:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:07,777 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 503 transitions. [2018-01-28 22:47:07,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:47:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 503 transitions. [2018-01-28 22:47:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:47:07,778 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:07,778 INFO L330 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] [2018-01-28 22:47:07,778 INFO L371 AbstractCegarLoop]: === Iteration 22 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:47:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash -944709274, now seen corresponding path program 1 times [2018-01-28 22:47:07,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:07,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:07,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:07,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:07,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:07,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:08,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:47:08,246 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:47:08,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:08,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:47:08,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:47:08,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-01-28 22:47:08,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:08,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:08,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:47:08,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-01-28 22:47:10,543 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 20 treesize of output 16 [2018-01-28 22:47:10,550 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-01-28 22:47:10,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:47:10,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:47:10,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:47:10,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:18 [2018-01-28 22:47:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:10,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:47:10,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-01-28 22:47:10,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 22:47:10,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 22:47:10,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=621, Unknown=1, NotChecked=0, Total=702 [2018-01-28 22:47:10,628 INFO L87 Difference]: Start difference. First operand 433 states and 503 transitions. Second operand 27 states. [2018-01-28 22:48:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:45,254 INFO L93 Difference]: Finished difference Result 586 states and 667 transitions. [2018-01-28 22:48:45,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-28 22:48:45,254 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-01-28 22:48:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:45,256 INFO L225 Difference]: With dead ends: 586 [2018-01-28 22:48:45,256 INFO L226 Difference]: Without dead ends: 494 [2018-01-28 22:48:45,257 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=374, Invalid=1968, Unknown=10, NotChecked=0, Total=2352 [2018-01-28 22:48:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-01-28 22:48:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 403. [2018-01-28 22:48:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-01-28 22:48:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 465 transitions. [2018-01-28 22:48:45,293 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 465 transitions. Word has length 45 [2018-01-28 22:48:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:45,294 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 465 transitions. [2018-01-28 22:48:45,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 22:48:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 465 transitions. [2018-01-28 22:48:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 22:48:45,295 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:45,295 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:45,295 INFO L371 AbstractCegarLoop]: === Iteration 23 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:48:45,295 INFO L82 PathProgramCache]: Analyzing trace with hash -306767953, now seen corresponding path program 1 times [2018-01-28 22:48:45,296 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:45,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:45,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:45,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:45,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:45,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:45,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:45,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 22:48:45,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:48:45,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:48:45,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:48:45,482 INFO L87 Difference]: Start difference. First operand 403 states and 465 transitions. Second operand 10 states. [2018-01-28 22:48:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:45,864 INFO L93 Difference]: Finished difference Result 503 states and 577 transitions. [2018-01-28 22:48:45,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:48:45,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-01-28 22:48:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:45,866 INFO L225 Difference]: With dead ends: 503 [2018-01-28 22:48:45,866 INFO L226 Difference]: Without dead ends: 468 [2018-01-28 22:48:45,866 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:48:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-01-28 22:48:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 435. [2018-01-28 22:48:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-01-28 22:48:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 507 transitions. [2018-01-28 22:48:45,895 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 507 transitions. Word has length 49 [2018-01-28 22:48:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:45,895 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 507 transitions. [2018-01-28 22:48:45,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:48:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 507 transitions. [2018-01-28 22:48:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-28 22:48:45,896 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:45,896 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:45,896 INFO L371 AbstractCegarLoop]: === Iteration 24 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:48:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1348399841, now seen corresponding path program 1 times [2018-01-28 22:48:45,897 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:45,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:45,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:45,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:45,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:45,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:46,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:46,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:48:46,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:48:46,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:48:46,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:48:46,019 INFO L87 Difference]: Start difference. First operand 435 states and 507 transitions. Second operand 9 states. [2018-01-28 22:48:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:46,263 INFO L93 Difference]: Finished difference Result 561 states and 656 transitions. [2018-01-28 22:48:46,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:48:46,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-01-28 22:48:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:46,265 INFO L225 Difference]: With dead ends: 561 [2018-01-28 22:48:46,265 INFO L226 Difference]: Without dead ends: 494 [2018-01-28 22:48:46,266 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:48:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-01-28 22:48:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 473. [2018-01-28 22:48:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-01-28 22:48:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 556 transitions. [2018-01-28 22:48:46,316 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 556 transitions. Word has length 52 [2018-01-28 22:48:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:46,316 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 556 transitions. [2018-01-28 22:48:46,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:48:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 556 transitions. [2018-01-28 22:48:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 22:48:46,317 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:46,317 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:46,318 INFO L371 AbstractCegarLoop]: === Iteration 25 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:48:46,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1955781941, now seen corresponding path program 1 times [2018-01-28 22:48:46,318 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:46,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:46,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:46,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:46,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:46,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:48:46,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:46,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:48:46,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:48:46,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:48:46,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:48:46,445 INFO L87 Difference]: Start difference. First operand 473 states and 556 transitions. Second operand 7 states. [2018-01-28 22:48:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:46,783 INFO L93 Difference]: Finished difference Result 493 states and 576 transitions. [2018-01-28 22:48:46,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:48:46,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-28 22:48:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:46,785 INFO L225 Difference]: With dead ends: 493 [2018-01-28 22:48:46,785 INFO L226 Difference]: Without dead ends: 487 [2018-01-28 22:48:46,786 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:48:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-01-28 22:48:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 467. [2018-01-28 22:48:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-01-28 22:48:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions. [2018-01-28 22:48:46,835 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 51 [2018-01-28 22:48:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:46,836 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions. [2018-01-28 22:48:46,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:48:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions. [2018-01-28 22:48:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 22:48:46,837 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:46,837 INFO L330 BasicCegarLoop]: trace histogram [3, 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-01-28 22:48:46,837 INFO L371 AbstractCegarLoop]: === Iteration 26 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:48:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash -488470124, now seen corresponding path program 1 times [2018-01-28 22:48:46,838 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:46,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:46,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:46,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:46,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:46,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:47,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:48:47,377 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 22:48:47,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:47,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:48:47,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:48:47,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:48:47,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:48:47,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:48:47,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2018-01-28 22:48:47,726 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 29 treesize of output 25 [2018-01-28 22:48:47,728 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 25 treesize of output 13 [2018-01-28 22:48:47,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,737 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 41 treesize of output 33 [2018-01-28 22:48:47,739 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 33 treesize of output 14 [2018-01-28 22:48:47,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:47,748 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2018-01-28 22:48:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:47,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:48:47,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-01-28 22:48:47,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:48:47,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:48:47,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:48:47,867 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 33 states. [2018-01-28 22:48:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:49,002 INFO L93 Difference]: Finished difference Result 520 states and 626 transitions. [2018-01-28 22:48:49,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:48:49,003 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 50 [2018-01-28 22:48:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:49,004 INFO L225 Difference]: With dead ends: 520 [2018-01-28 22:48:49,004 INFO L226 Difference]: Without dead ends: 519 [2018-01-28 22:48:49,005 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=1540, Unknown=0, NotChecked=0, Total=1806 [2018-01-28 22:48:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-01-28 22:48:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 467. [2018-01-28 22:48:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-01-28 22:48:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 546 transitions. [2018-01-28 22:48:49,036 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 546 transitions. Word has length 50 [2018-01-28 22:48:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:49,036 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 546 transitions. [2018-01-28 22:48:49,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 22:48:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 546 transitions. [2018-01-28 22:48:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 22:48:49,037 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:49,037 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:49,037 INFO L371 AbstractCegarLoop]: === Iteration 27 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:48:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1660920035, now seen corresponding path program 1 times [2018-01-28 22:48:49,038 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:49,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:49,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:49,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:49,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:49,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:49,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:48:49,508 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:48:49,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:49,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:48:49,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:48:49,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:48:49,558 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 11 treesize of output 8 [2018-01-28 22:48:49,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:49,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,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 11 treesize of output 8 [2018-01-28 22:48:49,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 8 treesize of output 7 [2018-01-28 22:48:49,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-01-28 22:48:49,581 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 26 treesize of output 21 [2018-01-28 22:48:49,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:49,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:48:49,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,600 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 26 treesize of output 21 [2018-01-28 22:48:49,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:49,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:48:49,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-01-28 22:48:49,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:49,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:49,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:48:49,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-01-28 22:48:49,759 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 28 treesize of output 29 [2018-01-28 22:48:49,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:49,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,786 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 28 treesize of output 29 [2018-01-28 22:48:49,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:49,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-01-28 22:48:49,844 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 37 treesize of output 36 [2018-01-28 22:48:49,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:49,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:48:49,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,885 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 37 treesize of output 44 [2018-01-28 22:48:49,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:49,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:48:49,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:49,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:86 [2018-01-28 22:48:49,956 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 74 treesize of output 71 [2018-01-28 22:48:49,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:49,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:49,968 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 27 treesize of output 61 [2018-01-28 22:48:49,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:49,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:48:50,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 96 [2018-01-28 22:48:50,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:50,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:50,054 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 31 treesize of output 73 [2018-01-28 22:48:50,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:50,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:48:50,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 98 [2018-01-28 22:48:50,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:50,100 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:48:50,102 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 0 case distinctions, treesize of input 31 treesize of output 67 [2018-01-28 22:48:50,102 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:50,119 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:50,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:48:50,161 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:203 [2018-01-28 22:48:50,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 151 [2018-01-28 22:48:50,910 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-28 22:48:50,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:51,120 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-01-28 22:48:51,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:51,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:51,286 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:48:51,289 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 0 case distinctions, treesize of input 126 treesize of output 133 [2018-01-28 22:48:51,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:51,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:51,402 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 2 case distinctions, treesize of input 128 treesize of output 155 [2018-01-28 22:48:51,403 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:51,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:48:51,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 161 [2018-01-28 22:48:51,681 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 157 treesize of output 156 [2018-01-28 22:48:51,682 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:51,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:51,870 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 2 case distinctions, treesize of input 142 treesize of output 159 [2018-01-28 22:48:51,871 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:51,967 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:48:52,142 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:48:52,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 118 [2018-01-28 22:48:52,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 73 [2018-01-28 22:48:52,148 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:52,164 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:52,192 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 130 treesize of output 149 [2018-01-28 22:48:52,197 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 159 treesize of output 158 [2018-01-28 22:48:52,197 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:52,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,275 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:48:52,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 161 [2018-01-28 22:48:52,287 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:52,347 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:48:52,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 141 [2018-01-28 22:48:52,359 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:48:52,383 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 166 [2018-01-28 22:48:52,385 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 22:48:52,420 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:52,621 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 148 treesize of output 159 [2018-01-28 22:48:52,626 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 177 treesize of output 176 [2018-01-28 22:48:52,626 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:52,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,727 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 198 [2018-01-28 22:48:52,728 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:48:52,801 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:48:52,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 138 [2018-01-28 22:48:52,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:52,812 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2018-01-28 22:48:52,812 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:52,835 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:52,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 11 dim-0 vars, and 6 xjuncts. [2018-01-28 22:48:52,992 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 10 variables, input treesize:287, output treesize:966 [2018-01-28 22:48:53,650 WARN L146 SmtUtils]: Spent 478ms on a formula simplification. DAG size of input: 187 DAG size of output 156 [2018-01-28 22:48:53,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 151 [2018-01-28 22:48:53,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:53,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 150 [2018-01-28 22:48:53,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:53,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:53,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:53,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:53,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 141 [2018-01-28 22:48:53,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 22:48:54,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:54,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 155 [2018-01-28 22:48:54,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:54,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:54,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:54,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 98 [2018-01-28 22:48:54,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:54,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:54,351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 97 [2018-01-28 22:48:54,352 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:54,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:54,590 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 112 [2018-01-28 22:48:54,591 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:54,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:54,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:54,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 115 [2018-01-28 22:48:54,595 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:54,797 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 105 treesize of output 92 [2018-01-28 22:48:54,798 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:54,799 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 106 treesize of output 95 [2018-01-28 22:48:54,800 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:54,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:54,993 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:48:54,997 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 118 [2018-01-28 22:48:54,999 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:48:55,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:55,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:55,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 106 treesize of output 101 [2018-01-28 22:48:55,227 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:55,229 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 116 treesize of output 97 [2018-01-28 22:48:55,229 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:55,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2018-01-28 22:48:55,757 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 139 treesize of output 106 [2018-01-28 22:48:55,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:55,760 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:48:55,761 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 19 treesize of output 16 [2018-01-28 22:48:55,761 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:55,773 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2018-01-28 22:48:55,774 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:55,780 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:56,113 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 60 treesize of output 43 [2018-01-28 22:48:56,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:56,116 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-28 22:48:56,116 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:56,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:56,123 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 18 treesize of output 10 [2018-01-28 22:48:56,123 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:56,126 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:56,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 10 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:56,197 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 21 variables, input treesize:772, output treesize:7 [2018-01-28 22:48:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:56,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:48:56,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 30 [2018-01-28 22:48:56,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 22:48:56,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 22:48:56,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=752, Unknown=10, NotChecked=0, Total=870 [2018-01-28 22:48:56,261 INFO L87 Difference]: Start difference. First operand 467 states and 546 transitions. Second operand 30 states. [2018-01-28 22:48:58,948 WARN L146 SmtUtils]: Spent 477ms on a formula simplification. DAG size of input: 181 DAG size of output 177 [2018-01-28 22:48:59,270 WARN L143 SmtUtils]: Spent 272ms on a formula simplification that was a NOOP. DAG size: 165 [2018-01-28 22:48:59,650 WARN L143 SmtUtils]: Spent 296ms on a formula simplification that was a NOOP. DAG size: 169 [2018-01-28 22:49:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:49:00,616 INFO L93 Difference]: Finished difference Result 675 states and 775 transitions. [2018-01-28 22:49:00,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-28 22:49:00,617 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 50 [2018-01-28 22:49:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:49:00,619 INFO L225 Difference]: With dead ends: 675 [2018-01-28 22:49:00,619 INFO L226 Difference]: Without dead ends: 613 [2018-01-28 22:49:00,620 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=312, Invalid=2019, Unknown=21, NotChecked=0, Total=2352 [2018-01-28 22:49:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-01-28 22:49:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 439. [2018-01-28 22:49:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-01-28 22:49:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 509 transitions. [2018-01-28 22:49:00,671 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 509 transitions. Word has length 50 [2018-01-28 22:49:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:49:00,671 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 509 transitions. [2018-01-28 22:49:00,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 22:49:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 509 transitions. [2018-01-28 22:49:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:49:00,673 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:49:00,673 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:49:00,673 INFO L371 AbstractCegarLoop]: === Iteration 28 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:49:00,673 INFO L82 PathProgramCache]: Analyzing trace with hash 313515355, now seen corresponding path program 1 times [2018-01-28 22:49:00,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:49:00,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:49:00,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:49:00,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:49:00,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:49:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:49:00,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:49:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-28 22:49:01,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:49:01,191 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:49:01,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:49:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:49:01,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:49:01,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:49:01,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:49:01,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:01,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:01,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:49:01,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:49:01,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:01,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:01,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:01,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-01-28 22:49:01,328 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 23 treesize of output 35 [2018-01-28 22:49:01,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 23 [2018-01-28 22:49:01,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:01,352 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 21 treesize of output 30 [2018-01-28 22:49:01,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:49:01,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:49:01,391 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 23 treesize of output 35 [2018-01-28 22:49:01,394 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 24 treesize of output 23 [2018-01-28 22:49:01,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:01,406 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:01,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:49:01,421 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:54, output treesize:87 [2018-01-28 22:49:02,205 WARN L143 SmtUtils]: Spent 180ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-28 22:49:03,250 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 83 treesize of output 68 [2018-01-28 22:49:03,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 29 [2018-01-28 22:49:03,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:49:03,264 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 1 case distinctions, treesize of input 21 treesize of output 18 [2018-01-28 22:49:03,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:49:03,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:49:03,289 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 59 treesize of output 47 [2018-01-28 22:49:03,291 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-01-28 22:49:03,291 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:49:03,303 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 22:49:03,303 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-28 22:49:03,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:49:03,313 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 70 treesize of output 56 [2018-01-28 22:49:03,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 25 [2018-01-28 22:49:03,315 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:49:03,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:49:03,325 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 15 treesize of output 8 [2018-01-28 22:49:03,325 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:03,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:03,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:49:03,344 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:110, output treesize:25 [2018-01-28 22:49:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-28 22:49:03,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:49:03,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 31 [2018-01-28 22:49:03,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 22:49:03,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 22:49:03,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=823, Unknown=2, NotChecked=0, Total=930 [2018-01-28 22:49:03,440 INFO L87 Difference]: Start difference. First operand 439 states and 509 transitions. Second operand 31 states. [2018-01-28 22:49:04,592 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 59 DAG size of output 57 [2018-01-28 22:49:05,840 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 64 DAG size of output 56 [2018-01-28 22:49:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:49:06,444 INFO L93 Difference]: Finished difference Result 665 states and 788 transitions. [2018-01-28 22:49:06,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-28 22:49:06,444 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-01-28 22:49:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:49:06,446 INFO L225 Difference]: With dead ends: 665 [2018-01-28 22:49:06,446 INFO L226 Difference]: Without dead ends: 541 [2018-01-28 22:49:06,447 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=423, Invalid=2437, Unknown=2, NotChecked=0, Total=2862 [2018-01-28 22:49:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-01-28 22:49:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 463. [2018-01-28 22:49:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-01-28 22:49:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 535 transitions. [2018-01-28 22:49:06,491 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 535 transitions. Word has length 56 [2018-01-28 22:49:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:49:06,492 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 535 transitions. [2018-01-28 22:49:06,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 22:49:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 535 transitions. [2018-01-28 22:49:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 22:49:06,493 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:49:06,493 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-01-28 22:49:06,493 INFO L371 AbstractCegarLoop]: === Iteration 29 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-28 22:49:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1858414189, now seen corresponding path program 1 times [2018-01-28 22:49:06,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:49:06,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:49:06,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:49:06,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:49:06,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:49:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:49:06,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:49:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:49:07,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:49:07,082 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:49:07,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:49:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:49:07,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:49:07,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:49:07,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:49:07,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:49:07,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-28 22:49:07,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-01-28 22:49:07,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:49:07,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-01-28 22:49:07,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:49:07,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-01-28 22:49:07,269 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 23 treesize of output 24 [2018-01-28 22:49:07,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:49:07,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,286 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 23 treesize of output 24 [2018-01-28 22:49:07,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-01-28 22:49:07,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:71 [2018-01-28 22:49:07,562 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 95 treesize of output 80 [2018-01-28 22:49:07,564 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 27 treesize of output 3 [2018-01-28 22:49:07,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 35 [2018-01-28 22:49:07,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:49:07,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:49:07,583 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 49 treesize of output 41 [2018-01-28 22:49:07,585 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-01-28 22:49:07,585 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:49:07,591 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 15 treesize of output 3 [2018-01-28 22:49:07,591 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,594 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:49:07,597 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:113, output treesize:7 [2018-01-28 22:49:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:49:07,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:49:07,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 33 [2018-01-28 22:49:07,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:49:07,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:49:07,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=927, Unknown=19, NotChecked=0, Total=1056 [2018-01-28 22:49:07,660 INFO L87 Difference]: Start difference. First operand 463 states and 535 transitions. Second operand 33 states. Received shutdown request... [2018-01-28 22:49:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:49:08,681 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:49:08,688 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:49:08,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:49:08 BoogieIcfgContainer [2018-01-28 22:49:08,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:49:08,689 INFO L168 Benchmark]: Toolchain (without parser) took 139173.77 ms. Allocated memory was 302.0 MB in the beginning and 552.6 MB in the end (delta: 250.6 MB). Free memory was 260.7 MB in the beginning and 384.0 MB in the end (delta: -123.3 MB). Peak memory consumption was 127.3 MB. Max. memory is 5.3 GB. [2018-01-28 22:49:08,690 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:49:08,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.62 ms. Allocated memory is still 302.0 MB. Free memory was 260.7 MB in the beginning and 248.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:49:08,691 INFO L168 Benchmark]: Boogie Preprocessor took 36.86 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:49:08,691 INFO L168 Benchmark]: RCFGBuilder took 513.78 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 213.8 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:49:08,691 INFO L168 Benchmark]: TraceAbstraction took 138402.91 ms. Allocated memory was 302.0 MB in the beginning and 552.6 MB in the end (delta: 250.6 MB). Free memory was 211.8 MB in the beginning and 384.0 MB in the end (delta: -172.2 MB). Peak memory consumption was 78.4 MB. Max. memory is 5.3 GB. [2018-01-28 22:49:08,693 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.18 ms. Allocated memory is still 302.0 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.62 ms. Allocated memory is still 302.0 MB. Free memory was 260.7 MB in the beginning and 248.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.86 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 513.78 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 213.8 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 138402.91 ms. Allocated memory was 302.0 MB in the beginning and 552.6 MB in the end (delta: 250.6 MB). Free memory was 211.8 MB in the beginning and 384.0 MB in the end (delta: -172.2 MB). Peak memory consumption was 78.4 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 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 587]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 587). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (463states) and interpolant automaton (currently 17 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 149 locations, 43 error locations. TIMEOUT Result, 138.3s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 117.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4461 SDtfs, 5467 SDslu, 25484 SDs, 0 SdLazy, 14573 SolverSat, 2086 SolverUnsat, 99 SolverUnknown, 0 SolverNotchecked, 88.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 943 GetRequests, 393 SyntacticMatches, 58 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4342 ImplicationChecksByTransitivity, 37.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=24, 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.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 939 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 1516 NumberOfCodeBlocks, 1516 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1476 ConstructedInterpolants, 105 QuantifiedInterpolants, 1229067 SizeOfPredicates, 142 NumberOfNonLiveVariables, 1870 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 40 InterpolantComputations, 18 PerfectInterpolantSequences, 76/161 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-49-08-703.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-49-08-703.csv Completed graceful shutdown