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-1cceb4a [2018-01-30 00:22:51,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:22:51,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:22:51,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:22:51,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:22:51,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:22:51,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:22:51,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:22:51,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:22:51,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:22:51,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:22:51,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:22:51,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:22:51,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:22:51,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:22:51,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:22:51,323 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:22:51,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:22:51,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:22:51,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:22:51,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:22:51,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:22:51,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:22:51,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:22:51,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:22:51,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:22:51,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:22:51,335 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:22:51,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:22:51,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:22:51,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:22:51,336 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-30 00:22:51,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:22:51,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:22:51,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:22:51,346 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:22:51,346 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:22:51,346 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:22:51,346 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:22:51,347 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:22:51,347 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:22:51,347 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:22:51,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:22:51,347 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:22:51,347 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:22:51,347 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:22:51,348 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:22:51,348 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:22:51,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:22:51,348 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:22:51,348 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:22:51,348 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:22:51,348 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:22:51,349 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:22:51,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:22:51,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:22:51,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:22:51,349 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:22:51,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:22:51,350 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:22:51,350 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:22:51,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:22:51,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:22:51,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:22:51,351 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:22:51,351 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:22:51,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:22:51,392 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:22:51,396 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:22:51,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:22:51,397 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:22:51,398 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-30 00:22:51,554 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:22:51,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:22:51,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:22:51,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:22:51,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:22:51,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4034ebab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51, skipping insertion in model container [2018-01-30 00:22:51,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,581 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:22:51,619 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:22:51,739 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:22:51,761 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:22:51,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51 WrapperNode [2018-01-30 00:22:51,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:22:51,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:22:51,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:22:51,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:22:51,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (1/1) ... [2018-01-30 00:22:51,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:22:51,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:22:51,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:22:51,808 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:22:51,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (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-30 00:22:51,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:22:51,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:22:51,860 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 00:22:51,860 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-01-30 00:22:51,860 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-01-30 00:22:51,860 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-01-30 00:22:51,860 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:22:51,860 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:22:51,860 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:22:51,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:22:51,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:22:51,860 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:22:51,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:22:52,342 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:22:52,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:22:52 BoogieIcfgContainer [2018-01-30 00:22:52,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:22:52,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:22:52,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:22:52,348 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:22:52,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:22:51" (1/3) ... [2018-01-30 00:22:52,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe4c7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:22:52, skipping insertion in model container [2018-01-30 00:22:52,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:22:51" (2/3) ... [2018-01-30 00:22:52,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe4c7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:22:52, skipping insertion in model container [2018-01-30 00:22:52,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:22:52" (3/3) ... [2018-01-30 00:22:52,352 INFO L107 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:22:52,361 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:22:52,370 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-30 00:22:52,422 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:22:52,422 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:22:52,422 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:22:52,423 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:22:52,423 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:22:52,423 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:22:52,423 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:22:52,423 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:22:52,424 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:22:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-01-30 00:22:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-30 00:22:52,452 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:52,453 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:22:52,453 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-30 00:22:52,458 INFO L82 PathProgramCache]: Analyzing trace with hash -899082593, now seen corresponding path program 1 times [2018-01-30 00:22:52,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:52,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:52,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:52,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:52,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:52,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:52,613 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-30 00:22:52,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:52,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:22:52,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:22:52,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:22:52,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:22:52,635 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-01-30 00:22:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:52,838 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2018-01-30 00:22:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:22:52,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-30 00:22:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:52,849 INFO L225 Difference]: With dead ends: 263 [2018-01-30 00:22:52,849 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 00:22:52,853 INFO L553 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-30 00:22:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 00:22:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-30 00:22:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-30 00:22:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2018-01-30 00:22:52,894 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 8 [2018-01-30 00:22:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:52,894 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2018-01-30 00:22:52,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:22:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2018-01-30 00:22:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-30 00:22:52,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:52,895 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:22:52,895 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-30 00:22:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash -899082592, now seen corresponding path program 1 times [2018-01-30 00:22:52,896 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:52,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:52,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:52,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:52,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:52,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:52,957 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-30 00:22:52,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:52,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:22:52,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:22:52,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:22:52,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:22:52,960 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand 3 states. [2018-01-30 00:22:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:53,100 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-01-30 00:22:53,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:22:53,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-30 00:22:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:53,102 INFO L225 Difference]: With dead ends: 143 [2018-01-30 00:22:53,102 INFO L226 Difference]: Without dead ends: 141 [2018-01-30 00:22:53,103 INFO L553 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-30 00:22:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-30 00:22:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-30 00:22:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-30 00:22:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2018-01-30 00:22:53,117 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 8 [2018-01-30 00:22:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:53,117 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2018-01-30 00:22:53,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:22:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2018-01-30 00:22:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 00:22:53,118 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:53,118 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:22:53,118 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-30 00:22:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash -963325212, now seen corresponding path program 1 times [2018-01-30 00:22:53,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:53,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:53,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:53,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:53,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:53,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:53,197 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-30 00:22:53,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:53,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:22:53,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:22:53,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:22:53,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:22:53,199 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand 6 states. [2018-01-30 00:22:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:53,381 INFO L93 Difference]: Finished difference Result 296 states and 335 transitions. [2018-01-30 00:22:53,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:22:53,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-30 00:22:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:53,387 INFO L225 Difference]: With dead ends: 296 [2018-01-30 00:22:53,387 INFO L226 Difference]: Without dead ends: 187 [2018-01-30 00:22:53,388 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:22:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-30 00:22:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2018-01-30 00:22:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-30 00:22:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2018-01-30 00:22:53,410 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 19 [2018-01-30 00:22:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:53,410 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2018-01-30 00:22:53,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:22:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2018-01-30 00:22:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 00:22:53,411 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:53,411 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:22:53,412 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-30 00:22:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash -501960631, now seen corresponding path program 1 times [2018-01-30 00:22:53,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:53,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:53,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:53,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:53,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:53,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:53,468 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-30 00:22:53,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:53,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:22:53,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:22:53,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:22:53,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:22:53,469 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand 4 states. [2018-01-30 00:22:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:53,616 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2018-01-30 00:22:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:22:53,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-30 00:22:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:53,619 INFO L225 Difference]: With dead ends: 195 [2018-01-30 00:22:53,619 INFO L226 Difference]: Without dead ends: 193 [2018-01-30 00:22:53,620 INFO L553 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-30 00:22:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-30 00:22:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 170. [2018-01-30 00:22:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-30 00:22:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 196 transitions. [2018-01-30 00:22:53,638 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 196 transitions. Word has length 18 [2018-01-30 00:22:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:53,639 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 196 transitions. [2018-01-30 00:22:53,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:22:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 196 transitions. [2018-01-30 00:22:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 00:22:53,640 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:53,640 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:22:53,640 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-30 00:22:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash -501960630, now seen corresponding path program 1 times [2018-01-30 00:22:53,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:53,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:53,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:53,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:53,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:53,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:53,738 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-30 00:22:53,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:53,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:22:53,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:22:53,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:22:53,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:22:53,739 INFO L87 Difference]: Start difference. First operand 170 states and 196 transitions. Second operand 4 states. [2018-01-30 00:22:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:53,972 INFO L93 Difference]: Finished difference Result 196 states and 230 transitions. [2018-01-30 00:22:53,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:22:53,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-30 00:22:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:53,974 INFO L225 Difference]: With dead ends: 196 [2018-01-30 00:22:53,974 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 00:22:53,974 INFO L553 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-30 00:22:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 00:22:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 168. [2018-01-30 00:22:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-30 00:22:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 192 transitions. [2018-01-30 00:22:53,988 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 192 transitions. Word has length 18 [2018-01-30 00:22:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:53,989 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 192 transitions. [2018-01-30 00:22:53,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:22:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 192 transitions. [2018-01-30 00:22:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:22:53,990 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:53,990 INFO L350 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-30 00:22:53,991 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-30 00:22:53,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1347829204, now seen corresponding path program 1 times [2018-01-30 00:22:53,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:53,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:53,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:53,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:53,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:54,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:54,096 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-30 00:22:54,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:54,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:22:54,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:22:54,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:22:54,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:22:54,097 INFO L87 Difference]: Start difference. First operand 168 states and 192 transitions. Second operand 7 states. [2018-01-30 00:22:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:54,334 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2018-01-30 00:22:54,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:22:54,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-30 00:22:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:54,367 INFO L225 Difference]: With dead ends: 204 [2018-01-30 00:22:54,367 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 00:22:54,367 INFO L553 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-30 00:22:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 00:22:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 167. [2018-01-30 00:22:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-30 00:22:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2018-01-30 00:22:54,380 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 20 [2018-01-30 00:22:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:54,380 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2018-01-30 00:22:54,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:22:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-01-30 00:22:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:22:54,381 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:54,381 INFO L350 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-30 00:22:54,381 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-30 00:22:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1347829203, now seen corresponding path program 1 times [2018-01-30 00:22:54,382 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:54,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:54,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:54,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:54,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:54,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:54,519 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-30 00:22:54,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:54,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:22:54,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:22:54,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:22:54,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:22:54,521 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand 6 states. [2018-01-30 00:22:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:54,662 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-01-30 00:22:54,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:22:54,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-30 00:22:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:54,665 INFO L225 Difference]: With dead ends: 167 [2018-01-30 00:22:54,665 INFO L226 Difference]: Without dead ends: 166 [2018-01-30 00:22:54,666 INFO L553 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-30 00:22:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-30 00:22:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-01-30 00:22:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-30 00:22:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 188 transitions. [2018-01-30 00:22:54,679 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 188 transitions. Word has length 20 [2018-01-30 00:22:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:54,679 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 188 transitions. [2018-01-30 00:22:54,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:22:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2018-01-30 00:22:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 00:22:54,680 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:54,680 INFO L350 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-30 00:22:54,680 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-30 00:22:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash -564056031, now seen corresponding path program 1 times [2018-01-30 00:22:54,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:54,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:54,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:54,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:54,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:54,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:54,728 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-30 00:22:54,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:54,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:22:54,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:22:54,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:22:54,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:22:54,729 INFO L87 Difference]: Start difference. First operand 166 states and 188 transitions. Second operand 6 states. [2018-01-30 00:22:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:55,016 INFO L93 Difference]: Finished difference Result 204 states and 233 transitions. [2018-01-30 00:22:55,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:22:55,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-30 00:22:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:55,017 INFO L225 Difference]: With dead ends: 204 [2018-01-30 00:22:55,017 INFO L226 Difference]: Without dead ends: 198 [2018-01-30 00:22:55,017 INFO L553 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-30 00:22:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-30 00:22:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2018-01-30 00:22:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-30 00:22:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2018-01-30 00:22:55,033 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 26 [2018-01-30 00:22:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:55,034 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2018-01-30 00:22:55,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:22:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2018-01-30 00:22:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 00:22:55,035 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:55,035 INFO L350 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-30 00:22:55,035 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-30 00:22:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash -564056030, now seen corresponding path program 1 times [2018-01-30 00:22:55,035 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:55,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:55,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:55,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:55,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:55,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:55,146 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-30 00:22:55,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:55,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:22:55,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:22:55,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:22:55,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:22:55,148 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand 6 states. [2018-01-30 00:22:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:55,425 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2018-01-30 00:22:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:22:55,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-30 00:22:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:55,426 INFO L225 Difference]: With dead ends: 201 [2018-01-30 00:22:55,427 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 00:22:55,427 INFO L553 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-30 00:22:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 00:22:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2018-01-30 00:22:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-30 00:22:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2018-01-30 00:22:55,439 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 26 [2018-01-30 00:22:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:55,439 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2018-01-30 00:22:55,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:22:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2018-01-30 00:22:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:22:55,440 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:55,440 INFO L350 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-30 00:22:55,440 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-30 00:22:55,441 INFO L82 PathProgramCache]: Analyzing trace with hash 460412558, now seen corresponding path program 1 times [2018-01-30 00:22:55,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:55,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:55,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:55,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:55,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:55,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:55,713 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-30 00:22:55,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:55,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:22:55,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:22:55,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:22:55,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:22:55,714 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand 9 states. [2018-01-30 00:22:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:56,050 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2018-01-30 00:22:56,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:22:56,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-30 00:22:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:56,053 INFO L225 Difference]: With dead ends: 293 [2018-01-30 00:22:56,053 INFO L226 Difference]: Without dead ends: 217 [2018-01-30 00:22:56,054 INFO L553 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-30 00:22:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-30 00:22:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2018-01-30 00:22:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-30 00:22:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 234 transitions. [2018-01-30 00:22:56,078 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 234 transitions. Word has length 31 [2018-01-30 00:22:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:56,078 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 234 transitions. [2018-01-30 00:22:56,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:22:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 234 transitions. [2018-01-30 00:22:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:22:56,079 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:56,080 INFO L350 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-30 00:22:56,080 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-30 00:22:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash -181292614, now seen corresponding path program 1 times [2018-01-30 00:22:56,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:56,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:56,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:56,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:56,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:56,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:56,162 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-30 00:22:56,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:22:56,163 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-30 00:22:56,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:56,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:22:56,295 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-30 00:22:56,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:22:56,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 00:22:56,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:22:56,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:22:56,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:22:56,318 INFO L87 Difference]: Start difference. First operand 202 states and 234 transitions. Second operand 6 states. [2018-01-30 00:22:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:56,767 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2018-01-30 00:22:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:22:56,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-30 00:22:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:56,770 INFO L225 Difference]: With dead ends: 223 [2018-01-30 00:22:56,770 INFO L226 Difference]: Without dead ends: 221 [2018-01-30 00:22:56,770 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:22:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-30 00:22:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-01-30 00:22:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-30 00:22:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 253 transitions. [2018-01-30 00:22:56,789 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 253 transitions. Word has length 31 [2018-01-30 00:22:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:56,789 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 253 transitions. [2018-01-30 00:22:56,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:22:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 253 transitions. [2018-01-30 00:22:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:22:56,790 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:56,790 INFO L350 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-30 00:22:56,791 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-30 00:22:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash -181292613, now seen corresponding path program 1 times [2018-01-30 00:22:56,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:56,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:56,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:56,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:56,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:56,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:56,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-30 00:22:56,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:22:56,871 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-30 00:22:56,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:56,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:22:57,046 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-30 00:22:57,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:22:57,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-01-30 00:22:57,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:22:57,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:22:57,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:22:57,081 INFO L87 Difference]: Start difference. First operand 217 states and 253 transitions. Second operand 12 states. [2018-01-30 00:22:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:57,391 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2018-01-30 00:22:57,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:22:57,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-01-30 00:22:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:57,394 INFO L225 Difference]: With dead ends: 220 [2018-01-30 00:22:57,394 INFO L226 Difference]: Without dead ends: 218 [2018-01-30 00:22:57,394 INFO L553 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-30 00:22:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-30 00:22:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-01-30 00:22:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-30 00:22:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2018-01-30 00:22:57,414 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 31 [2018-01-30 00:22:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:57,414 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2018-01-30 00:22:57,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:22:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2018-01-30 00:22:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:22:57,416 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:57,416 INFO L350 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-30 00:22:57,416 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-30 00:22:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash 935312203, now seen corresponding path program 1 times [2018-01-30 00:22:57,416 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:57,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:57,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:57,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:57,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:57,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:57,576 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-30 00:22:57,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:22:57,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:22:57,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:22:57,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:22:57,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:22:57,577 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand 8 states. [2018-01-30 00:22:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:57,787 INFO L93 Difference]: Finished difference Result 290 states and 331 transitions. [2018-01-30 00:22:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:22:57,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-30 00:22:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:57,789 INFO L225 Difference]: With dead ends: 290 [2018-01-30 00:22:57,789 INFO L226 Difference]: Without dead ends: 225 [2018-01-30 00:22:57,790 INFO L553 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-30 00:22:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-30 00:22:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 216. [2018-01-30 00:22:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-30 00:22:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 248 transitions. [2018-01-30 00:22:57,802 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 248 transitions. Word has length 34 [2018-01-30 00:22:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:57,802 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 248 transitions. [2018-01-30 00:22:57,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:22:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 248 transitions. [2018-01-30 00:22:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:22:57,803 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:57,803 INFO L350 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-30 00:22:57,803 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-30 00:22:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1667896459, now seen corresponding path program 1 times [2018-01-30 00:22:57,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:57,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:57,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:57,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:57,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:57,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:57,911 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-30 00:22:57,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:22:57,911 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-30 00:22:57,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:57,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:22:57,985 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-30 00:22:57,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:58,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:58,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:22:58,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:58,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:58,018 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-30 00:22:58,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:58,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:58,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-30 00:22:58,064 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-30 00:22:58,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:22:58,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 00:22:58,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:22:58,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:22:58,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:22:58,098 INFO L87 Difference]: Start difference. First operand 216 states and 248 transitions. Second operand 9 states. [2018-01-30 00:22:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:58,453 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2018-01-30 00:22:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:22:58,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-30 00:22:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:58,455 INFO L225 Difference]: With dead ends: 363 [2018-01-30 00:22:58,455 INFO L226 Difference]: Without dead ends: 242 [2018-01-30 00:22:58,456 INFO L553 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-30 00:22:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-30 00:22:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2018-01-30 00:22:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-30 00:22:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2018-01-30 00:22:58,469 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 38 [2018-01-30 00:22:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:58,469 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2018-01-30 00:22:58,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:22:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2018-01-30 00:22:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 00:22:58,470 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:58,470 INFO L350 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-30 00:22:58,470 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-30 00:22:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash 743369402, now seen corresponding path program 1 times [2018-01-30 00:22:58,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:58,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:58,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:58,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:58,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:58,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:58,847 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-30 00:22:58,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:22:58,848 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-30 00:22:58,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:58,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:22:58,978 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-30 00:22:58,981 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-30 00:22:58,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:58,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:58,989 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-30 00:22:58,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-30 00:22:59,057 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-30 00:22:59,059 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-30 00:22:59,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:59,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:59,061 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-30 00:22:59,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-30 00:22:59,113 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-30 00:22:59,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:22:59,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 25 [2018-01-30 00:22:59,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 00:22:59,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 00:22:59,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-01-30 00:22:59,134 INFO L87 Difference]: Start difference. First operand 215 states and 246 transitions. Second operand 25 states. [2018-01-30 00:23:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:23:00,541 INFO L93 Difference]: Finished difference Result 462 states and 541 transitions. [2018-01-30 00:23:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 00:23:00,541 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-01-30 00:23:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:23:00,543 INFO L225 Difference]: With dead ends: 462 [2018-01-30 00:23:00,543 INFO L226 Difference]: Without dead ends: 345 [2018-01-30 00:23:00,544 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 00:23:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-30 00:23:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 281. [2018-01-30 00:23:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-30 00:23:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 318 transitions. [2018-01-30 00:23:00,571 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 318 transitions. Word has length 39 [2018-01-30 00:23:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:23:00,572 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 318 transitions. [2018-01-30 00:23:00,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 00:23:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 318 transitions. [2018-01-30 00:23:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 00:23:00,573 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:23:00,573 INFO L350 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-30 00:23:00,573 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-30 00:23:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash -632231427, now seen corresponding path program 1 times [2018-01-30 00:23:00,574 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:23:00,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:23:00,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:00,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:00,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:00,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:23:00,653 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-30 00:23:00,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:23:00,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:23:00,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:23:00,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:23:00,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:23:00,655 INFO L87 Difference]: Start difference. First operand 281 states and 318 transitions. Second operand 6 states. [2018-01-30 00:23:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:23:01,793 INFO L93 Difference]: Finished difference Result 326 states and 377 transitions. [2018-01-30 00:23:01,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:23:01,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-30 00:23:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:23:01,798 INFO L225 Difference]: With dead ends: 326 [2018-01-30 00:23:01,798 INFO L226 Difference]: Without dead ends: 325 [2018-01-30 00:23:01,800 INFO L553 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-30 00:23:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-01-30 00:23:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 280. [2018-01-30 00:23:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-30 00:23:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 317 transitions. [2018-01-30 00:23:01,818 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 317 transitions. Word has length 41 [2018-01-30 00:23:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:23:01,818 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 317 transitions. [2018-01-30 00:23:01,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:23:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 317 transitions. [2018-01-30 00:23:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 00:23:01,819 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:23:01,819 INFO L350 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-30 00:23:01,819 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-30 00:23:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash -632231426, now seen corresponding path program 1 times [2018-01-30 00:23:01,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:23:01,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:23:01,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:01,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:01,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:01,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:23:01,860 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-30 00:23:01,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:23:01,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:23:01,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:23:01,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:23:01,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:23:01,861 INFO L87 Difference]: Start difference. First operand 280 states and 317 transitions. Second operand 4 states. [2018-01-30 00:23:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:23:01,887 INFO L93 Difference]: Finished difference Result 406 states and 456 transitions. [2018-01-30 00:23:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:23:01,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-01-30 00:23:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:23:01,889 INFO L225 Difference]: With dead ends: 406 [2018-01-30 00:23:01,889 INFO L226 Difference]: Without dead ends: 282 [2018-01-30 00:23:01,889 INFO L553 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-30 00:23:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-30 00:23:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 276. [2018-01-30 00:23:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-01-30 00:23:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2018-01-30 00:23:01,904 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 41 [2018-01-30 00:23:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:23:01,905 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2018-01-30 00:23:01,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:23:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2018-01-30 00:23:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:23:01,905 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:23:01,905 INFO L350 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-30 00:23:01,905 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-30 00:23:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash 262692435, now seen corresponding path program 1 times [2018-01-30 00:23:01,906 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:23:01,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:23:01,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:01,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:01,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:01,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:23:02,208 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-30 00:23:02,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:23:02,208 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-30 00:23:02,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:02,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:23:02,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:23:02,294 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-30 00:23:02,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:23:02,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:23:02,302 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-30 00:23:02,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-30 00:23:02,512 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-30 00:23:02,521 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-30 00:23:02,522 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-30 00:23:02,529 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-30 00:23:02,543 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-30 00:23:02,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:24 [2018-01-30 00:23:02,613 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-30 00:23:02,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:23:02,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-30 00:23:02,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:23:02,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:23:02,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:23:02,643 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 21 states. [2018-01-30 00:23:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:23:04,085 INFO L93 Difference]: Finished difference Result 484 states and 555 transitions. [2018-01-30 00:23:04,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:23:04,086 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-01-30 00:23:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:23:04,088 INFO L225 Difference]: With dead ends: 484 [2018-01-30 00:23:04,088 INFO L226 Difference]: Without dead ends: 483 [2018-01-30 00:23:04,088 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2018-01-30 00:23:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-01-30 00:23:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 391. [2018-01-30 00:23:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-01-30 00:23:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 454 transitions. [2018-01-30 00:23:04,117 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 454 transitions. Word has length 42 [2018-01-30 00:23:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:23:04,117 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 454 transitions. [2018-01-30 00:23:04,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:23:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 454 transitions. [2018-01-30 00:23:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:23:04,118 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:23:04,118 INFO L350 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-30 00:23:04,118 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-30 00:23:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash 262692436, now seen corresponding path program 1 times [2018-01-30 00:23:04,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:23:04,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:23:04,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:04,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:04,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:04,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:23:04,864 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-30 00:23:04,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:23:04,864 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-30 00:23:04,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:04,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:23:04,985 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-30 00:23:04,987 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-30 00:23:04,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:23:04,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:23:04,997 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-30 00:23:04,998 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-30 00:23:04,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:23:05,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:23:05,006 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-30 00:23:05,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:38 [2018-01-30 00:23:05,142 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-30 00:23:05,144 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-30 00:23:05,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:23:05,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:23:05,151 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-30 00:23:05,153 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-30 00:23:05,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:23:05,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:23:05,160 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-30 00:23:05,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:14 [2018-01-30 00:23:05,183 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-30 00:23:05,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:23:05,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 28 [2018-01-30 00:23:05,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:23:05,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:23:05,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=716, Unknown=4, NotChecked=0, Total=812 [2018-01-30 00:23:05,204 INFO L87 Difference]: Start difference. First operand 391 states and 454 transitions. Second operand 29 states. [2018-01-30 00:23:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:23:09,209 INFO L93 Difference]: Finished difference Result 463 states and 536 transitions. [2018-01-30 00:23:09,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 00:23:09,209 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2018-01-30 00:23:09,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:23:09,211 INFO L225 Difference]: With dead ends: 463 [2018-01-30 00:23:09,211 INFO L226 Difference]: Without dead ends: 462 [2018-01-30 00:23:09,212 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=385, Invalid=2055, Unknown=10, NotChecked=0, Total=2450 [2018-01-30 00:23:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-01-30 00:23:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 410. [2018-01-30 00:23:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-01-30 00:23:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 475 transitions. [2018-01-30 00:23:09,248 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 475 transitions. Word has length 42 [2018-01-30 00:23:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:23:09,248 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 475 transitions. [2018-01-30 00:23:09,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:23:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 475 transitions. [2018-01-30 00:23:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:23:09,249 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:23:09,250 INFO L350 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-30 00:23:09,250 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-30 00:23:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2116034005, now seen corresponding path program 1 times [2018-01-30 00:23:09,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:23:09,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:23:09,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:09,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:09,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:09,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:23:09,313 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-30 00:23:09,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:23:09,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:23:09,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:23:09,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:23:09,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:23:09,315 INFO L87 Difference]: Start difference. First operand 410 states and 475 transitions. Second operand 7 states. [2018-01-30 00:23:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:23:09,589 INFO L93 Difference]: Finished difference Result 450 states and 526 transitions. [2018-01-30 00:23:09,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:23:09,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-01-30 00:23:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:23:09,591 INFO L225 Difference]: With dead ends: 450 [2018-01-30 00:23:09,592 INFO L226 Difference]: Without dead ends: 446 [2018-01-30 00:23:09,592 INFO L553 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-30 00:23:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-01-30 00:23:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 433. [2018-01-30 00:23:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-01-30 00:23:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 509 transitions. [2018-01-30 00:23:09,620 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 509 transitions. Word has length 45 [2018-01-30 00:23:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:23:09,620 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 509 transitions. [2018-01-30 00:23:09,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:23:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 509 transitions. [2018-01-30 00:23:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:23:09,621 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:23:09,621 INFO L350 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-30 00:23:09,621 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-30 00:23:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2116034004, now seen corresponding path program 1 times [2018-01-30 00:23:09,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:23:09,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:23:09,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:09,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:09,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:09,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:23:09,743 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-30 00:23:09,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:23:09,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:23:09,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:23:09,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:23:09,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:23:09,744 INFO L87 Difference]: Start difference. First operand 433 states and 509 transitions. Second operand 7 states. [2018-01-30 00:23:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:23:09,929 INFO L93 Difference]: Finished difference Result 449 states and 518 transitions. [2018-01-30 00:23:09,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:23:09,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-01-30 00:23:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:23:09,931 INFO L225 Difference]: With dead ends: 449 [2018-01-30 00:23:09,931 INFO L226 Difference]: Without dead ends: 445 [2018-01-30 00:23:09,932 INFO L553 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-30 00:23:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-01-30 00:23:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 433. [2018-01-30 00:23:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-01-30 00:23:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 503 transitions. [2018-01-30 00:23:09,955 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 503 transitions. Word has length 45 [2018-01-30 00:23:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:23:09,955 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 503 transitions. [2018-01-30 00:23:09,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:23:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 503 transitions. [2018-01-30 00:23:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:23:09,956 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:23:09,956 INFO L350 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-30 00:23:09,957 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-30 00:23:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash -944709274, now seen corresponding path program 1 times [2018-01-30 00:23:09,957 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:23:09,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:23:09,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:09,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:09,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:23:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:09,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:23:10,373 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-30 00:23:10,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:23:10,373 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-30 00:23:10,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:23:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:23:10,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:23:10,521 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-30 00:23:10,523 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-30 00:23:10,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:23:10,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:23:10,530 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-30 00:23:10,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-01-30 00:23:12,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 20 treesize of output 16 [2018-01-30 00:23:12,743 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-30 00:23:12,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:23:12,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:23:12,753 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-30 00:23:12,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:18 [2018-01-30 00:23:12,801 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-30 00:23:12,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:23:12,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-01-30 00:23:12,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:23:12,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:23:12,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=621, Unknown=1, NotChecked=0, Total=702 [2018-01-30 00:23:12,822 INFO L87 Difference]: Start difference. First operand 433 states and 503 transitions. Second operand 27 states. [2018-01-30 00:24:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:47,844 INFO L93 Difference]: Finished difference Result 586 states and 667 transitions. [2018-01-30 00:24:47,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 00:24:47,844 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-01-30 00:24:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:47,846 INFO L225 Difference]: With dead ends: 586 [2018-01-30 00:24:47,846 INFO L226 Difference]: Without dead ends: 494 [2018-01-30 00:24:47,847 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=374, Invalid=1968, Unknown=10, NotChecked=0, Total=2352 [2018-01-30 00:24:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-01-30 00:24:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 403. [2018-01-30 00:24:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-01-30 00:24:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 465 transitions. [2018-01-30 00:24:47,884 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 465 transitions. Word has length 45 [2018-01-30 00:24:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:47,885 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 465 transitions. [2018-01-30 00:24:47,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:24:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 465 transitions. [2018-01-30 00:24:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-30 00:24:47,886 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:47,886 INFO L350 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-30 00:24:47,886 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-30 00:24:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -306767953, now seen corresponding path program 1 times [2018-01-30 00:24:47,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:47,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:47,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:47,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:47,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:47,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:48,057 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-30 00:24:48,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:48,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:24:48,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:24:48,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:24:48,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:24:48,058 INFO L87 Difference]: Start difference. First operand 403 states and 465 transitions. Second operand 10 states. [2018-01-30 00:24:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:48,439 INFO L93 Difference]: Finished difference Result 503 states and 577 transitions. [2018-01-30 00:24:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:24:48,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-01-30 00:24:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:48,442 INFO L225 Difference]: With dead ends: 503 [2018-01-30 00:24:48,442 INFO L226 Difference]: Without dead ends: 468 [2018-01-30 00:24:48,443 INFO L553 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-30 00:24:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-01-30 00:24:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 435. [2018-01-30 00:24:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-01-30 00:24:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 507 transitions. [2018-01-30 00:24:48,490 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 507 transitions. Word has length 49 [2018-01-30 00:24:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:48,491 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 507 transitions. [2018-01-30 00:24:48,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:24:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 507 transitions. [2018-01-30 00:24:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:24:48,492 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:48,492 INFO L350 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-30 00:24:48,492 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-30 00:24:48,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1348399841, now seen corresponding path program 1 times [2018-01-30 00:24:48,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:48,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:48,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:48,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:48,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:48,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:48,639 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-30 00:24:48,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:48,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:24:48,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:24:48,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:24:48,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:24:48,640 INFO L87 Difference]: Start difference. First operand 435 states and 507 transitions. Second operand 9 states. [2018-01-30 00:24:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:49,013 INFO L93 Difference]: Finished difference Result 561 states and 656 transitions. [2018-01-30 00:24:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:24:49,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-01-30 00:24:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:49,016 INFO L225 Difference]: With dead ends: 561 [2018-01-30 00:24:49,016 INFO L226 Difference]: Without dead ends: 494 [2018-01-30 00:24:49,017 INFO L553 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-30 00:24:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-01-30 00:24:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 473. [2018-01-30 00:24:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-01-30 00:24:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 556 transitions. [2018-01-30 00:24:49,068 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 556 transitions. Word has length 52 [2018-01-30 00:24:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:49,068 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 556 transitions. [2018-01-30 00:24:49,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:24:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 556 transitions. [2018-01-30 00:24:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 00:24:49,069 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:49,069 INFO L350 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-30 00:24:49,070 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-30 00:24:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1955781941, now seen corresponding path program 1 times [2018-01-30 00:24:49,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:49,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:49,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:49,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:49,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:49,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:49,200 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-30 00:24:49,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:24:49,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:24:49,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:24:49,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:24:49,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:24:49,201 INFO L87 Difference]: Start difference. First operand 473 states and 556 transitions. Second operand 7 states. [2018-01-30 00:24:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:49,694 INFO L93 Difference]: Finished difference Result 493 states and 576 transitions. [2018-01-30 00:24:49,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:24:49,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-30 00:24:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:49,696 INFO L225 Difference]: With dead ends: 493 [2018-01-30 00:24:49,697 INFO L226 Difference]: Without dead ends: 487 [2018-01-30 00:24:49,697 INFO L553 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-30 00:24:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-01-30 00:24:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 467. [2018-01-30 00:24:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-01-30 00:24:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions. [2018-01-30 00:24:49,728 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 51 [2018-01-30 00:24:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:49,728 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions. [2018-01-30 00:24:49,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:24:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions. [2018-01-30 00:24:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-30 00:24:49,730 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:49,730 INFO L350 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-30 00:24:49,730 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-30 00:24:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash -488470124, now seen corresponding path program 1 times [2018-01-30 00:24:49,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:49,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:49,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:49,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:49,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:49,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:50,355 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-30 00:24:50,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:24:50,355 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-30 00:24:50,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:50,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:24:50,563 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-30 00:24:50,565 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-30 00:24:50,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:50,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:50,577 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-30 00:24:50,578 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-30 00:24:50,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:50,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:50,588 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-30 00:24:50,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2018-01-30 00:24:50,673 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-30 00:24:50,675 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-30 00:24:50,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:50,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:50,685 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-30 00:24:50,687 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-30 00:24:50,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:50,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:50,703 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-30 00:24:50,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2018-01-30 00:24:50,785 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-30 00:24:50,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:24:50,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-01-30 00:24:50,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:24:50,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:24:50,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:24:50,806 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 33 states. [2018-01-30 00:24:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:24:52,012 INFO L93 Difference]: Finished difference Result 520 states and 626 transitions. [2018-01-30 00:24:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:24:52,013 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 50 [2018-01-30 00:24:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:24:52,016 INFO L225 Difference]: With dead ends: 520 [2018-01-30 00:24:52,016 INFO L226 Difference]: Without dead ends: 519 [2018-01-30 00:24:52,017 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=266, Invalid=1540, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 00:24:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-01-30 00:24:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 467. [2018-01-30 00:24:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-01-30 00:24:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 546 transitions. [2018-01-30 00:24:52,071 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 546 transitions. Word has length 50 [2018-01-30 00:24:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:24:52,071 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 546 transitions. [2018-01-30 00:24:52,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:24:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 546 transitions. [2018-01-30 00:24:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-30 00:24:52,073 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:24:52,073 INFO L350 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-30 00:24:52,073 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-30 00:24:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1660920035, now seen corresponding path program 1 times [2018-01-30 00:24:52,073 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:24:52,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:24:52,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:52,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:52,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:24:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:52,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:24:52,572 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-30 00:24:52,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:24:52,572 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-30 00:24:52,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:24:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:24:52,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:24:52,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:24:52,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 00:24:52,621 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-30 00:24:52,622 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-30 00:24:52,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,631 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-30 00:24:52,632 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-30 00:24:52,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-01-30 00:24:52,645 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-30 00:24:52,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:52,652 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-30 00:24:52,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,666 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-30 00:24:52,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:52,672 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-30 00:24:52,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-01-30 00:24:52,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:52,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:52,758 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-30 00:24:52,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-01-30 00:24:52,833 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-30 00:24:52,836 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-30 00:24:52,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,865 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-30 00:24:52,867 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-30 00:24:52,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-01-30 00:24:52,952 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-30 00:24:52,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:52,958 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-30 00:24:52,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:52,991 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-30 00:24:52,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:52,995 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-30 00:24:52,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:53,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:53,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:53,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:86 [2018-01-30 00:24:53,064 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-30 00:24:53,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:53,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:53,077 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-30 00:24:53,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:53,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:24:53,151 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-30 00:24:53,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:53,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:53,163 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-30 00:24:53,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:53,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:24:53,202 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-30 00:24:53,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:53,206 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:24:53,208 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-30 00:24:53,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:53,226 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:53,271 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-30 00:24:53,272 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:203 [2018-01-30 00:24:54,088 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-30 00:24:54,100 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-30 00:24:54,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:54,326 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-30 00:24:54,326 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:54,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:54,485 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:24:54,487 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-30 00:24:54,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:54,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:54,602 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-30 00:24:54,603 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:54,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-30 00:24:54,888 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-30 00:24:54,893 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-30 00:24:54,894 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:55,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,075 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-30 00:24:55,076 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:55,183 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:24:55,369 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:24:55,373 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-30 00:24:55,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,378 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-30 00:24:55,379 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:55,394 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:55,429 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-30 00:24:55,433 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-30 00:24:55,434 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:55,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,513 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:24:55,524 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-30 00:24:55,525 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:55,582 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:24:55,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,588 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-30 00:24:55,601 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:24:55,619 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-30 00:24:55,621 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-30 00:24:55,656 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:55,846 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-30 00:24:55,851 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-30 00:24:55,851 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:55,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:55,950 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-30 00:24:55,951 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-30 00:24:56,021 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-30 00:24:56,027 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-30 00:24:56,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:56,033 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-30 00:24:56,033 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-30 00:24:56,055 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-30 00:24:56,220 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-30 00:24:56,220 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 10 variables, input treesize:287, output treesize:966 [2018-01-30 00:24:56,924 WARN L146 SmtUtils]: Spent 544ms on a formula simplification. DAG size of input: 187 DAG size of output 156 [2018-01-30 00:24:56,969 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-30 00:24:56,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:56,982 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-30 00:24:56,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:57,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,166 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-30 00:24:57,168 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-30 00:24:57,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,396 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-30 00:24:57,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:24:57,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,652 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-30 00:24:57,652 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-30 00:24:57,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,656 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-30 00:24:57,657 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-30 00:24:57,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,898 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-30 00:24:57,899 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-30 00:24:57,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:57,902 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-30 00:24:57,903 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-30 00:24:58,109 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-30 00:24:58,109 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:58,111 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-30 00:24:58,112 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:58,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:58,304 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:24:58,308 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-30 00:24:58,310 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-30 00:24:58,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:58,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:58,539 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-30 00:24:58,539 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:58,541 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-30 00:24:58,541 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:58,754 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-30 00:24:59,100 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-30 00:24:59,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:59,106 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:24:59,106 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-30 00:24:59,106 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:59,117 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-30 00:24:59,118 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-30 00:24:59,125 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-30 00:24:59,450 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-30 00:24:59,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:59,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-30 00:24:59,453 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:59,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:24:59,460 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-30 00:24:59,460 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-30 00:24:59,463 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:24:59,530 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-30 00:24:59,530 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 21 variables, input treesize:772, output treesize:7 [2018-01-30 00:24:59,582 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-30 00:24:59,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:24:59,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 30 [2018-01-30 00:24:59,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 00:24:59,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 00:24:59,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=752, Unknown=10, NotChecked=0, Total=870 [2018-01-30 00:24:59,604 INFO L87 Difference]: Start difference. First operand 467 states and 546 transitions. Second operand 30 states. [2018-01-30 00:25:01,901 WARN L143 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 109 [2018-01-30 00:25:02,548 WARN L146 SmtUtils]: Spent 545ms on a formula simplification. DAG size of input: 181 DAG size of output 177 [2018-01-30 00:25:02,987 WARN L143 SmtUtils]: Spent 362ms on a formula simplification that was a NOOP. DAG size: 165 [2018-01-30 00:25:03,466 WARN L143 SmtUtils]: Spent 375ms on a formula simplification that was a NOOP. DAG size: 169 [2018-01-30 00:25:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:04,512 INFO L93 Difference]: Finished difference Result 675 states and 775 transitions. [2018-01-30 00:25:04,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 00:25:04,513 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 50 [2018-01-30 00:25:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:04,516 INFO L225 Difference]: With dead ends: 675 [2018-01-30 00:25:04,516 INFO L226 Difference]: Without dead ends: 613 [2018-01-30 00:25:04,517 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=312, Invalid=2019, Unknown=21, NotChecked=0, Total=2352 [2018-01-30 00:25:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-01-30 00:25:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 439. [2018-01-30 00:25:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-01-30 00:25:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 509 transitions. [2018-01-30 00:25:04,570 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 509 transitions. Word has length 50 [2018-01-30 00:25:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:04,571 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 509 transitions. [2018-01-30 00:25:04,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 00:25:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 509 transitions. [2018-01-30 00:25:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:25:04,572 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:04,572 INFO L350 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-30 00:25:04,573 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-30 00:25:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 313515355, now seen corresponding path program 1 times [2018-01-30 00:25:04,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:04,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:04,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:04,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:04,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:04,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:05,035 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-30 00:25:05,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:25:05,035 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-30 00:25:05,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:05,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:25:05,123 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-30 00:25:05,124 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-30 00:25:05,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:05,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:05,135 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-30 00:25:05,136 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-30 00:25:05,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:05,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:05,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:05,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-01-30 00:25:05,179 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-30 00:25:05,182 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-30 00:25:05,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:05,204 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-30 00:25:05,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-30 00:25:05,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:25:05,255 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-30 00:25:05,259 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-30 00:25:05,260 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:05,275 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:05,290 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-30 00:25:05,290 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:54, output treesize:87 [2018-01-30 00:25:06,288 WARN L143 SmtUtils]: Spent 235ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-30 00:25:07,584 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-30 00:25:07,586 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-30 00:25:07,586 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-30 00:25:07,598 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-30 00:25:07,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-30 00:25:07,606 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-30 00:25:07,623 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-30 00:25:07,624 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-30 00:25:07,625 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-30 00:25:07,637 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-30 00:25:07,637 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-30 00:25:07,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:25:07,647 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-30 00:25:07,649 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-30 00:25:07,650 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-30 00:25:07,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:25:07,660 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-30 00:25:07,660 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:07,665 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:07,678 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-30 00:25:07,678 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:110, output treesize:25 [2018-01-30 00:25:07,762 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-30 00:25:07,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:25:07,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 31 [2018-01-30 00:25:07,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 00:25:07,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 00:25:07,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=821, Unknown=4, NotChecked=0, Total=930 [2018-01-30 00:25:07,784 INFO L87 Difference]: Start difference. First operand 439 states and 509 transitions. Second operand 31 states. [2018-01-30 00:25:09,106 WARN L146 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 59 DAG size of output 57 Received shutdown request... [2018-01-30 00:25:09,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:25:09,974 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:25:09,980 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:25:09,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:25:09 BoogieIcfgContainer [2018-01-30 00:25:09,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:25:09,981 INFO L168 Benchmark]: Toolchain (without parser) took 138426.67 ms. Allocated memory was 305.7 MB in the beginning and 537.9 MB in the end (delta: 232.3 MB). Free memory was 265.5 MB in the beginning and 332.3 MB in the end (delta: -66.8 MB). Peak memory consumption was 165.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:09,983 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:25:09,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.35 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 253.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:09,983 INFO L168 Benchmark]: Boogie Preprocessor took 35.61 ms. Allocated memory is still 305.7 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:09,983 INFO L168 Benchmark]: RCFGBuilder took 535.69 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 217.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:09,984 INFO L168 Benchmark]: TraceAbstraction took 137636.18 ms. Allocated memory was 305.7 MB in the beginning and 537.9 MB in the end (delta: 232.3 MB). Free memory was 216.5 MB in the beginning and 332.3 MB in the end (delta: -115.9 MB). Peak memory consumption was 116.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:09,985 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.14 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.35 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 253.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.61 ms. Allocated memory is still 305.7 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 535.69 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 217.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 137636.18 ms. Allocated memory was 305.7 MB in the beginning and 537.9 MB in the end (delta: 232.3 MB). Free memory was 216.5 MB in the beginning and 332.3 MB in the end (delta: -115.9 MB). Peak memory consumption was 116.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 (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 587]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 587). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (439states) and interpolant automaton (currently 26 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (252 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 149 locations, 43 error locations. TIMEOUT Result, 137.5s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 116.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4315 SDtfs, 5047 SDslu, 23410 SDs, 0 SdLazy, 13410 SolverSat, 1867 SolverUnsat, 95 SolverUnknown, 0 SolverNotchecked, 88.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 345 SyntacticMatches, 51 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3760 ImplicationChecksByTransitivity, 36.9s 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.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 861 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1400 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1362 ConstructedInterpolants, 100 QuantifiedInterpolants, 1069581 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1641 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 36/101 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-30_00-25-09-993.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-30_00-25-09-993.csv Completed graceful shutdown