java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:53:33,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:53:33,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:53:33,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:53:33,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:53:33,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:53:33,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:53:33,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:53:33,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:53:33,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:53:33,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:53:33,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:53:33,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:53:33,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:53:33,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:53:33,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:53:33,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:53:33,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:53:33,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:53:33,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:53:33,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:53:33,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:53:33,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:53:33,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:53:33,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:53:33,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:53:33,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:53:33,532 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:53:33,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:53:33,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:53:33,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:53:33,533 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:53:33,542 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:53:33,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:53:33,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:53:33,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:53:33,543 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:53:33,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:53:33,543 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:53:33,543 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:53:33,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:53:33,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:53:33,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:53:33,544 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:53:33,544 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:53:33,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:53:33,544 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:53:33,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:53:33,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:53:33,545 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:53:33,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:53:33,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:53:33,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:53:33,545 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:53:33,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:53:33,545 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:53:33,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:53:33,582 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:53:33,584 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:53:33,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:53:33,586 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:53:33,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i [2018-02-04 12:53:33,720 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:53:33,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:53:33,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:53:33,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:53:33,725 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:53:33,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bada75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33, skipping insertion in model container [2018-02-04 12:53:33,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,739 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:53:33,770 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:53:33,874 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:53:33,900 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:53:33,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33 WrapperNode [2018-02-04 12:53:33,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:53:33,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:53:33,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:53:33,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:53:33,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (1/1) ... [2018-02-04 12:53:33,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:53:33,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:53:33,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:53:33,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:53:33,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:53:33,985 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:53:33,986 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:53:33,986 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:53:33,986 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 12:53:33,987 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:53:33,987 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:53:33,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:53:33,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:53:34,488 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:53:34,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:53:34 BoogieIcfgContainer [2018-02-04 12:53:34,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:53:34,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:53:34,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:53:34,492 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:53:34,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:53:33" (1/3) ... [2018-02-04 12:53:34,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da46cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:53:34, skipping insertion in model container [2018-02-04 12:53:34,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:53:33" (2/3) ... [2018-02-04 12:53:34,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da46cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:53:34, skipping insertion in model container [2018-02-04 12:53:34,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:53:34" (3/3) ... [2018-02-04 12:53:34,495 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0521_true-valid-memsafety.i [2018-02-04 12:53:34,502 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:53:34,512 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-04 12:53:34,535 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:53:34,535 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:53:34,535 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:53:34,535 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:53:34,535 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:53:34,536 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:53:34,536 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:53:34,536 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:53:34,537 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:53:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2018-02-04 12:53:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:53:34,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:34,557 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:34,557 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:34,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2006593009, now seen corresponding path program 1 times [2018-02-04 12:53:34,561 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:34,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:34,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:34,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:34,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:34,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:34,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:34,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:53:34,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 12:53:34,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 12:53:34,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 12:53:34,742 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 2 states. [2018-02-04 12:53:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:34,768 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2018-02-04 12:53:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 12:53:34,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-04 12:53:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:34,778 INFO L225 Difference]: With dead ends: 247 [2018-02-04 12:53:34,779 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 12:53:34,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 12:53:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 12:53:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-02-04 12:53:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 12:53:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 271 transitions. [2018-02-04 12:53:34,810 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 271 transitions. Word has length 10 [2018-02-04 12:53:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:34,810 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 271 transitions. [2018-02-04 12:53:34,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 12:53:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 271 transitions. [2018-02-04 12:53:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 12:53:34,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:34,811 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:34,811 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1287736010, now seen corresponding path program 1 times [2018-02-04 12:53:34,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:34,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:34,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:34,813 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:34,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:34,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:34,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:34,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:53:34,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:53:34,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:53:34,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:53:34,872 INFO L87 Difference]: Start difference. First operand 244 states and 271 transitions. Second operand 4 states. [2018-02-04 12:53:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:35,028 INFO L93 Difference]: Finished difference Result 561 states and 618 transitions. [2018-02-04 12:53:35,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:53:35,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 12:53:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:35,030 INFO L225 Difference]: With dead ends: 561 [2018-02-04 12:53:35,031 INFO L226 Difference]: Without dead ends: 561 [2018-02-04 12:53:35,031 INFO L554 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-02-04 12:53:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-04 12:53:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 256. [2018-02-04 12:53:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 12:53:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 285 transitions. [2018-02-04 12:53:35,040 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 285 transitions. Word has length 12 [2018-02-04 12:53:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:35,041 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 285 transitions. [2018-02-04 12:53:35,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:53:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 285 transitions. [2018-02-04 12:53:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:53:35,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:35,041 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:35,041 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1264312096, now seen corresponding path program 1 times [2018-02-04 12:53:35,042 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:35,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:35,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:35,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:35,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:35,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:35,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:53:35,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:53:35,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:53:35,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:53:35,063 INFO L87 Difference]: Start difference. First operand 256 states and 285 transitions. Second operand 4 states. [2018-02-04 12:53:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:35,332 INFO L93 Difference]: Finished difference Result 416 states and 464 transitions. [2018-02-04 12:53:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:53:35,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:53:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:35,335 INFO L225 Difference]: With dead ends: 416 [2018-02-04 12:53:35,335 INFO L226 Difference]: Without dead ends: 416 [2018-02-04 12:53:35,335 INFO L554 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-02-04 12:53:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-02-04 12:53:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 254. [2018-02-04 12:53:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 12:53:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2018-02-04 12:53:35,347 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 13 [2018-02-04 12:53:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:35,347 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2018-02-04 12:53:35,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:53:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2018-02-04 12:53:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:53:35,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:35,348 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:35,348 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1264312095, now seen corresponding path program 1 times [2018-02-04 12:53:35,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:35,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:35,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:35,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:35,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:35,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:35,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:53:35,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:53:35,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:53:35,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:53:35,413 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand 4 states. [2018-02-04 12:53:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:35,560 INFO L93 Difference]: Finished difference Result 349 states and 392 transitions. [2018-02-04 12:53:35,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:53:35,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:53:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:35,562 INFO L225 Difference]: With dead ends: 349 [2018-02-04 12:53:35,562 INFO L226 Difference]: Without dead ends: 349 [2018-02-04 12:53:35,562 INFO L554 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-02-04 12:53:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-04 12:53:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 252. [2018-02-04 12:53:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-04 12:53:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2018-02-04 12:53:35,570 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 13 [2018-02-04 12:53:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:35,570 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2018-02-04 12:53:35,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:53:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2018-02-04 12:53:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:53:35,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:35,570 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:35,571 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:35,571 INFO L82 PathProgramCache]: Analyzing trace with hash 184691868, now seen corresponding path program 1 times [2018-02-04 12:53:35,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:35,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:35,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,572 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:35,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:35,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:35,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:35,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:53:35,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:53:35,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:53:35,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:53:35,613 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand 5 states. [2018-02-04 12:53:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:35,674 INFO L93 Difference]: Finished difference Result 327 states and 364 transitions. [2018-02-04 12:53:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:53:35,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 12:53:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:35,676 INFO L225 Difference]: With dead ends: 327 [2018-02-04 12:53:35,676 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 12:53:35,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:53:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 12:53:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 292. [2018-02-04 12:53:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 12:53:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2018-02-04 12:53:35,685 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 20 [2018-02-04 12:53:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:35,686 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2018-02-04 12:53:35,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:53:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2018-02-04 12:53:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:53:35,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:35,687 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:35,687 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash 415972895, now seen corresponding path program 1 times [2018-02-04 12:53:35,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:35,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:35,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:35,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:35,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:35,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:35,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:53:35,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:53:35,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:53:35,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:53:35,737 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand 4 states. [2018-02-04 12:53:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:35,945 INFO L93 Difference]: Finished difference Result 454 states and 524 transitions. [2018-02-04 12:53:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:53:35,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 12:53:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:35,946 INFO L225 Difference]: With dead ends: 454 [2018-02-04 12:53:35,946 INFO L226 Difference]: Without dead ends: 454 [2018-02-04 12:53:35,947 INFO L554 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-02-04 12:53:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-04 12:53:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 290. [2018-02-04 12:53:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 12:53:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 342 transitions. [2018-02-04 12:53:35,953 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 342 transitions. Word has length 20 [2018-02-04 12:53:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:35,953 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 342 transitions. [2018-02-04 12:53:35,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:53:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 342 transitions. [2018-02-04 12:53:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:53:35,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:35,954 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:35,954 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash 415972896, now seen corresponding path program 1 times [2018-02-04 12:53:35,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:35,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:35,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,955 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:35,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:35,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:35,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:35,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:53:35,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:53:35,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:53:35,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:53:36,000 INFO L87 Difference]: Start difference. First operand 290 states and 342 transitions. Second operand 4 states. [2018-02-04 12:53:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:36,137 INFO L93 Difference]: Finished difference Result 387 states and 452 transitions. [2018-02-04 12:53:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:53:36,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 12:53:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:36,139 INFO L225 Difference]: With dead ends: 387 [2018-02-04 12:53:36,139 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 12:53:36,139 INFO L554 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-02-04 12:53:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 12:53:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 288. [2018-02-04 12:53:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 12:53:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 340 transitions. [2018-02-04 12:53:36,145 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 340 transitions. Word has length 20 [2018-02-04 12:53:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:36,146 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 340 transitions. [2018-02-04 12:53:36,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:53:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 340 transitions. [2018-02-04 12:53:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:53:36,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:36,147 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:36,147 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash 308407885, now seen corresponding path program 1 times [2018-02-04 12:53:36,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:36,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:36,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:36,148 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:36,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:36,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:36,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:36,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:53:36,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:53:36,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:53:36,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:53:36,181 INFO L87 Difference]: Start difference. First operand 288 states and 340 transitions. Second operand 5 states. [2018-02-04 12:53:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:36,303 INFO L93 Difference]: Finished difference Result 319 states and 351 transitions. [2018-02-04 12:53:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:53:36,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 12:53:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:36,304 INFO L225 Difference]: With dead ends: 319 [2018-02-04 12:53:36,305 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 12:53:36,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:53:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 12:53:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2018-02-04 12:53:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-04 12:53:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 307 transitions. [2018-02-04 12:53:36,308 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 307 transitions. Word has length 23 [2018-02-04 12:53:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:36,309 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 307 transitions. [2018-02-04 12:53:36,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:53:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 307 transitions. [2018-02-04 12:53:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:53:36,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:36,310 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:36,310 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1728935830, now seen corresponding path program 1 times [2018-02-04 12:53:36,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:36,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:36,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:36,311 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:36,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:36,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:36,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:36,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:53:36,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:53:36,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:53:36,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:53:36,348 INFO L87 Difference]: Start difference. First operand 275 states and 307 transitions. Second operand 5 states. [2018-02-04 12:53:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:36,621 INFO L93 Difference]: Finished difference Result 457 states and 509 transitions. [2018-02-04 12:53:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:53:36,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 12:53:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:36,640 INFO L225 Difference]: With dead ends: 457 [2018-02-04 12:53:36,641 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 12:53:36,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:53:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 12:53:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 276. [2018-02-04 12:53:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 12:53:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 310 transitions. [2018-02-04 12:53:36,644 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 310 transitions. Word has length 28 [2018-02-04 12:53:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:36,645 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 310 transitions. [2018-02-04 12:53:36,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:53:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 310 transitions. [2018-02-04 12:53:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:53:36,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:36,645 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:36,645 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:36,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1728935829, now seen corresponding path program 1 times [2018-02-04 12:53:36,646 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:36,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:36,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:36,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:36,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:36,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:36,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:36,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:53:36,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:53:36,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:53:36,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:53:36,717 INFO L87 Difference]: Start difference. First operand 276 states and 310 transitions. Second operand 6 states. [2018-02-04 12:53:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:37,008 INFO L93 Difference]: Finished difference Result 387 states and 437 transitions. [2018-02-04 12:53:37,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:53:37,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 12:53:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:37,010 INFO L225 Difference]: With dead ends: 387 [2018-02-04 12:53:37,010 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 12:53:37,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:53:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 12:53:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 275. [2018-02-04 12:53:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-04 12:53:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 309 transitions. [2018-02-04 12:53:37,013 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 309 transitions. Word has length 28 [2018-02-04 12:53:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:37,014 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 309 transitions. [2018-02-04 12:53:37,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:53:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 309 transitions. [2018-02-04 12:53:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:53:37,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:37,014 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:37,014 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash -887445228, now seen corresponding path program 1 times [2018-02-04 12:53:37,015 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:37,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:37,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:37,015 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:37,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:37,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:37,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:37,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:53:37,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:53:37,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:53:37,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:37,038 INFO L87 Difference]: Start difference. First operand 275 states and 309 transitions. Second operand 3 states. [2018-02-04 12:53:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:37,131 INFO L93 Difference]: Finished difference Result 278 states and 311 transitions. [2018-02-04 12:53:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:53:37,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-04 12:53:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:37,133 INFO L225 Difference]: With dead ends: 278 [2018-02-04 12:53:37,133 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 12:53:37,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 12:53:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2018-02-04 12:53:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 12:53:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2018-02-04 12:53:37,138 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 30 [2018-02-04 12:53:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:37,138 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2018-02-04 12:53:37,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:53:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2018-02-04 12:53:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:53:37,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:37,139 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:37,140 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1380917583, now seen corresponding path program 1 times [2018-02-04 12:53:37,140 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:37,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:37,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:37,141 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:37,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:37,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:37,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:37,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:53:37,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:53:37,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:53:37,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:53:37,296 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand 12 states. [2018-02-04 12:53:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:38,491 INFO L93 Difference]: Finished difference Result 1030 states and 1162 transitions. [2018-02-04 12:53:38,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:53:38,492 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 12:53:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:38,494 INFO L225 Difference]: With dead ends: 1030 [2018-02-04 12:53:38,494 INFO L226 Difference]: Without dead ends: 1030 [2018-02-04 12:53:38,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:53:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-02-04 12:53:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 253. [2018-02-04 12:53:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-04 12:53:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2018-02-04 12:53:38,502 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 32 [2018-02-04 12:53:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:38,502 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2018-02-04 12:53:38,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:53:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2018-02-04 12:53:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:53:38,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:38,503 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:38,503 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1380917584, now seen corresponding path program 1 times [2018-02-04 12:53:38,503 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:38,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:38,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:38,504 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:38,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:38,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:38,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:38,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:53:38,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:53:38,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:53:38,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:53:38,628 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand 11 states. [2018-02-04 12:53:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:39,781 INFO L93 Difference]: Finished difference Result 1175 states and 1331 transitions. [2018-02-04 12:53:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:53:39,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-04 12:53:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:39,784 INFO L225 Difference]: With dead ends: 1175 [2018-02-04 12:53:39,784 INFO L226 Difference]: Without dead ends: 1175 [2018-02-04 12:53:39,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:53:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-02-04 12:53:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 252. [2018-02-04 12:53:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-04 12:53:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-02-04 12:53:39,794 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 32 [2018-02-04 12:53:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:39,794 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-02-04 12:53:39,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:53:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-02-04 12:53:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:53:39,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:39,795 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:39,795 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:39,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989974, now seen corresponding path program 1 times [2018-02-04 12:53:39,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:39,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:39,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:39,796 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:39,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:39,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:53:39,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:39,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:53:39,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:53:39,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:53:39,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:53:39,833 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 4 states. [2018-02-04 12:53:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:40,062 INFO L93 Difference]: Finished difference Result 775 states and 871 transitions. [2018-02-04 12:53:40,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:53:40,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 12:53:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:40,064 INFO L225 Difference]: With dead ends: 775 [2018-02-04 12:53:40,065 INFO L226 Difference]: Without dead ends: 775 [2018-02-04 12:53:40,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:53:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-02-04 12:53:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 250. [2018-02-04 12:53:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-04 12:53:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 281 transitions. [2018-02-04 12:53:40,074 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 281 transitions. Word has length 35 [2018-02-04 12:53:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:40,074 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 281 transitions. [2018-02-04 12:53:40,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:53:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 281 transitions. [2018-02-04 12:53:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:53:40,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:40,075 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:40,076 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989975, now seen corresponding path program 1 times [2018-02-04 12:53:40,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:40,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:40,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:40,077 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:40,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:40,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:40,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:40,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:53:40,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:53:40,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:53:40,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:53:40,168 INFO L87 Difference]: Start difference. First operand 250 states and 281 transitions. Second operand 6 states. [2018-02-04 12:53:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:40,411 INFO L93 Difference]: Finished difference Result 474 states and 541 transitions. [2018-02-04 12:53:40,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:53:40,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 12:53:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:40,413 INFO L225 Difference]: With dead ends: 474 [2018-02-04 12:53:40,413 INFO L226 Difference]: Without dead ends: 474 [2018-02-04 12:53:40,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:53:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-02-04 12:53:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 256. [2018-02-04 12:53:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 12:53:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 292 transitions. [2018-02-04 12:53:40,418 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 292 transitions. Word has length 35 [2018-02-04 12:53:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:40,418 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 292 transitions. [2018-02-04 12:53:40,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:53:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 292 transitions. [2018-02-04 12:53:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 12:53:40,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:40,419 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:40,419 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash 320441296, now seen corresponding path program 1 times [2018-02-04 12:53:40,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:40,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:40,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:40,420 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:40,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:40,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:40,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:40,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:53:40,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:53:40,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:53:40,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:53:40,464 INFO L87 Difference]: Start difference. First operand 256 states and 292 transitions. Second operand 6 states. [2018-02-04 12:53:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:40,550 INFO L93 Difference]: Finished difference Result 453 states and 505 transitions. [2018-02-04 12:53:40,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:53:40,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-04 12:53:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:40,552 INFO L225 Difference]: With dead ends: 453 [2018-02-04 12:53:40,552 INFO L226 Difference]: Without dead ends: 453 [2018-02-04 12:53:40,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:53:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-04 12:53:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 254. [2018-02-04 12:53:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 12:53:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 287 transitions. [2018-02-04 12:53:40,557 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 287 transitions. Word has length 36 [2018-02-04 12:53:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:40,557 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 287 transitions. [2018-02-04 12:53:40,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:53:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 287 transitions. [2018-02-04 12:53:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:53:40,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:40,558 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:40,558 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1534000121, now seen corresponding path program 1 times [2018-02-04 12:53:40,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:40,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:40,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:40,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:40,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:40,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:40,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:40,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 12:53:40,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:53:40,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:53:40,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:53:40,869 INFO L87 Difference]: Start difference. First operand 254 states and 287 transitions. Second operand 16 states. [2018-02-04 12:53:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:42,472 INFO L93 Difference]: Finished difference Result 685 states and 769 transitions. [2018-02-04 12:53:42,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 12:53:42,473 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-04 12:53:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:42,474 INFO L225 Difference]: With dead ends: 685 [2018-02-04 12:53:42,474 INFO L226 Difference]: Without dead ends: 685 [2018-02-04 12:53:42,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 12:53:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-02-04 12:53:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 247. [2018-02-04 12:53:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 12:53:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 275 transitions. [2018-02-04 12:53:42,477 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 275 transitions. Word has length 38 [2018-02-04 12:53:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:42,478 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 275 transitions. [2018-02-04 12:53:42,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:53:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 275 transitions. [2018-02-04 12:53:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:53:42,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:42,478 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:42,478 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1535290008, now seen corresponding path program 1 times [2018-02-04 12:53:42,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:42,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:42,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:42,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:42,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:42,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:42,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:53:42,666 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:53:42,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:42,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:53:42,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:53:42,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:53:42,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:53:42,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:53:42,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-04 12:53:42,847 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 15 treesize of output 11 [2018-02-04 12:53:42,850 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 11 treesize of output 3 [2018-02-04 12:53:42,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,855 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 15 treesize of output 11 [2018-02-04 12:53:42,858 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 11 treesize of output 3 [2018-02-04 12:53:42,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:42,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-04 12:53:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:42,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:53:42,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2018-02-04 12:53:42,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:53:42,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:53:42,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:53:42,907 INFO L87 Difference]: Start difference. First operand 247 states and 275 transitions. Second operand 16 states. [2018-02-04 12:53:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:43,443 INFO L93 Difference]: Finished difference Result 570 states and 637 transitions. [2018-02-04 12:53:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:53:43,444 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-04 12:53:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:43,446 INFO L225 Difference]: With dead ends: 570 [2018-02-04 12:53:43,446 INFO L226 Difference]: Without dead ends: 570 [2018-02-04 12:53:43,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:53:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-02-04 12:53:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 275. [2018-02-04 12:53:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-04 12:53:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 304 transitions. [2018-02-04 12:53:43,452 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 304 transitions. Word has length 38 [2018-02-04 12:53:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:43,452 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 304 transitions. [2018-02-04 12:53:43,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:53:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 304 transitions. [2018-02-04 12:53:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 12:53:43,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:43,453 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:43,453 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:43,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1834854922, now seen corresponding path program 1 times [2018-02-04 12:53:43,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:43,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:43,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:43,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:43,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:43,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:53:43,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:43,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:53:43,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:53:43,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:53:43,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:53:43,492 INFO L87 Difference]: Start difference. First operand 275 states and 304 transitions. Second operand 5 states. [2018-02-04 12:53:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:43,756 INFO L93 Difference]: Finished difference Result 450 states and 499 transitions. [2018-02-04 12:53:43,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:53:43,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-04 12:53:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:43,758 INFO L225 Difference]: With dead ends: 450 [2018-02-04 12:53:43,758 INFO L226 Difference]: Without dead ends: 450 [2018-02-04 12:53:43,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:53:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-04 12:53:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 318. [2018-02-04 12:53:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-04 12:53:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 376 transitions. [2018-02-04 12:53:43,764 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 376 transitions. Word has length 45 [2018-02-04 12:53:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:43,764 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 376 transitions. [2018-02-04 12:53:43,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:53:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 376 transitions. [2018-02-04 12:53:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 12:53:43,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:43,765 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:43,765 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1834854923, now seen corresponding path program 1 times [2018-02-04 12:53:43,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:43,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:43,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:43,766 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:43,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:43,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:43,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:43,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:53:43,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:53:43,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:53:43,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:53:43,848 INFO L87 Difference]: Start difference. First operand 318 states and 376 transitions. Second operand 6 states. [2018-02-04 12:53:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:44,187 INFO L93 Difference]: Finished difference Result 565 states and 680 transitions. [2018-02-04 12:53:44,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:53:44,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-04 12:53:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:44,216 INFO L225 Difference]: With dead ends: 565 [2018-02-04 12:53:44,216 INFO L226 Difference]: Without dead ends: 565 [2018-02-04 12:53:44,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:53:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-02-04 12:53:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 376. [2018-02-04 12:53:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 12:53:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 467 transitions. [2018-02-04 12:53:44,222 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 467 transitions. Word has length 45 [2018-02-04 12:53:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:44,222 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 467 transitions. [2018-02-04 12:53:44,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:53:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 467 transitions. [2018-02-04 12:53:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:53:44,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:44,223 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:44,223 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:44,223 INFO L82 PathProgramCache]: Analyzing trace with hash 120279583, now seen corresponding path program 1 times [2018-02-04 12:53:44,223 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:44,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:44,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:44,224 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:44,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:44,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:44,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:44,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:53:44,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:53:44,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:53:44,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:53:44,278 INFO L87 Difference]: Start difference. First operand 376 states and 467 transitions. Second operand 7 states. [2018-02-04 12:53:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:44,379 INFO L93 Difference]: Finished difference Result 505 states and 583 transitions. [2018-02-04 12:53:44,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:53:44,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 12:53:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:44,380 INFO L225 Difference]: With dead ends: 505 [2018-02-04 12:53:44,380 INFO L226 Difference]: Without dead ends: 505 [2018-02-04 12:53:44,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:53:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-04 12:53:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 375. [2018-02-04 12:53:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 12:53:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 463 transitions. [2018-02-04 12:53:44,386 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 463 transitions. Word has length 48 [2018-02-04 12:53:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:44,386 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 463 transitions. [2018-02-04 12:53:44,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:53:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 463 transitions. [2018-02-04 12:53:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 12:53:44,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:44,387 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:44,387 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1809870756, now seen corresponding path program 1 times [2018-02-04 12:53:44,387 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:44,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:44,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:44,388 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:44,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:44,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:53:44,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:44,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:53:44,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:53:44,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:53:44,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:53:44,420 INFO L87 Difference]: Start difference. First operand 375 states and 463 transitions. Second operand 6 states. [2018-02-04 12:53:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:44,694 INFO L93 Difference]: Finished difference Result 534 states and 619 transitions. [2018-02-04 12:53:44,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:53:44,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-02-04 12:53:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:44,697 INFO L225 Difference]: With dead ends: 534 [2018-02-04 12:53:44,697 INFO L226 Difference]: Without dead ends: 534 [2018-02-04 12:53:44,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:53:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-04 12:53:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 375. [2018-02-04 12:53:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 12:53:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 461 transitions. [2018-02-04 12:53:44,701 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 461 transitions. Word has length 50 [2018-02-04 12:53:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:44,701 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 461 transitions. [2018-02-04 12:53:44,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:53:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 461 transitions. [2018-02-04 12:53:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 12:53:44,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:44,702 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:53:44,702 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1809870755, now seen corresponding path program 1 times [2018-02-04 12:53:44,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:44,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:44,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:44,703 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:44,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:44,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:44,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:44,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:53:44,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:53:44,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:53:44,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:53:44,780 INFO L87 Difference]: Start difference. First operand 375 states and 461 transitions. Second operand 7 states. [2018-02-04 12:53:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:45,076 INFO L93 Difference]: Finished difference Result 559 states and 670 transitions. [2018-02-04 12:53:45,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:53:45,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-02-04 12:53:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:45,077 INFO L225 Difference]: With dead ends: 559 [2018-02-04 12:53:45,077 INFO L226 Difference]: Without dead ends: 559 [2018-02-04 12:53:45,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:53:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-02-04 12:53:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 375. [2018-02-04 12:53:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 12:53:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 460 transitions. [2018-02-04 12:53:45,081 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 460 transitions. Word has length 50 [2018-02-04 12:53:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:45,081 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 460 transitions. [2018-02-04 12:53:45,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:53:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 460 transitions. [2018-02-04 12:53:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:53:45,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:45,082 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 12:53:45,082 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1600702209, now seen corresponding path program 1 times [2018-02-04 12:53:45,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:45,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:45,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:45,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:45,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:45,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:53:45,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:45,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:53:45,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:53:45,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:53:45,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:53:45,158 INFO L87 Difference]: Start difference. First operand 375 states and 460 transitions. Second operand 12 states. [2018-02-04 12:53:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:45,619 INFO L93 Difference]: Finished difference Result 475 states and 557 transitions. [2018-02-04 12:53:45,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:53:45,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-02-04 12:53:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:45,620 INFO L225 Difference]: With dead ends: 475 [2018-02-04 12:53:45,621 INFO L226 Difference]: Without dead ends: 475 [2018-02-04 12:53:45,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:53:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-04 12:53:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 375. [2018-02-04 12:53:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 12:53:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 459 transitions. [2018-02-04 12:53:45,625 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 459 transitions. Word has length 54 [2018-02-04 12:53:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:45,625 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 459 transitions. [2018-02-04 12:53:45,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:53:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 459 transitions. [2018-02-04 12:53:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:53:45,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:45,626 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 12:53:45,626 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:45,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1600702210, now seen corresponding path program 1 times [2018-02-04 12:53:45,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:45,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:45,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:45,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:45,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:45,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:53:45,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:45,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 12:53:45,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:53:45,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:53:45,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:53:45,761 INFO L87 Difference]: Start difference. First operand 375 states and 459 transitions. Second operand 14 states. [2018-02-04 12:53:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:46,553 INFO L93 Difference]: Finished difference Result 619 states and 736 transitions. [2018-02-04 12:53:46,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:53:46,553 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-02-04 12:53:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:46,555 INFO L225 Difference]: With dead ends: 619 [2018-02-04 12:53:46,555 INFO L226 Difference]: Without dead ends: 619 [2018-02-04 12:53:46,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:53:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-04 12:53:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2018-02-04 12:53:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-04 12:53:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 482 transitions. [2018-02-04 12:53:46,558 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 482 transitions. Word has length 54 [2018-02-04 12:53:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:46,558 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 482 transitions. [2018-02-04 12:53:46,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:53:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 482 transitions. [2018-02-04 12:53:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:53:46,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:46,559 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 12:53:46,559 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash -497243786, now seen corresponding path program 1 times [2018-02-04 12:53:46,559 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:46,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:46,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:46,560 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:46,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:46,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:53:46,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:46,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:53:46,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:53:46,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:53:46,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:46,583 INFO L87 Difference]: Start difference. First operand 393 states and 482 transitions. Second operand 3 states. [2018-02-04 12:53:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:46,655 INFO L93 Difference]: Finished difference Result 392 states and 481 transitions. [2018-02-04 12:53:46,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:53:46,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-02-04 12:53:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:46,657 INFO L225 Difference]: With dead ends: 392 [2018-02-04 12:53:46,657 INFO L226 Difference]: Without dead ends: 392 [2018-02-04 12:53:46,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-04 12:53:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2018-02-04 12:53:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-02-04 12:53:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 481 transitions. [2018-02-04 12:53:46,662 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 481 transitions. Word has length 54 [2018-02-04 12:53:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:46,662 INFO L432 AbstractCegarLoop]: Abstraction has 392 states and 481 transitions. [2018-02-04 12:53:46,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:53:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 481 transitions. [2018-02-04 12:53:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:53:46,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:46,663 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-04 12:53:46,663 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash -497243785, now seen corresponding path program 1 times [2018-02-04 12:53:46,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:46,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:46,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:46,664 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:46,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:46,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:46,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:46,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:53:46,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:53:46,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:53:46,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:53:46,768 INFO L87 Difference]: Start difference. First operand 392 states and 481 transitions. Second operand 11 states. [2018-02-04 12:53:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:47,140 INFO L93 Difference]: Finished difference Result 438 states and 517 transitions. [2018-02-04 12:53:47,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:53:47,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-04 12:53:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:47,142 INFO L225 Difference]: With dead ends: 438 [2018-02-04 12:53:47,142 INFO L226 Difference]: Without dead ends: 438 [2018-02-04 12:53:47,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:53:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-04 12:53:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 378. [2018-02-04 12:53:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 12:53:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 462 transitions. [2018-02-04 12:53:47,146 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 462 transitions. Word has length 54 [2018-02-04 12:53:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:47,146 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 462 transitions. [2018-02-04 12:53:47,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:53:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 462 transitions. [2018-02-04 12:53:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:53:47,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:47,147 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:47,147 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash 750527692, now seen corresponding path program 2 times [2018-02-04 12:53:47,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:47,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:47,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:47,148 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:47,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:47,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:47,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:53:47,538 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:53:47,543 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:53:47,565 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:53:47,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:53:47,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:53:47,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:47,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:47,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:53:47,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:47,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:47,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 12:53:47,626 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 17 treesize of output 20 [2018-02-04 12:53:47,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:47,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:47,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2018-02-04 12:53:47,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:53:47,705 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-02-04 12:53:47,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:47,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:47,716 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-02-04 12:53:47,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:35 [2018-02-04 12:53:47,807 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 25 treesize of output 19 [2018-02-04 12:53:47,809 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 12:53:47,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:47,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:47,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:47,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2018-02-04 12:53:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:47,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:53:47,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [19] total 28 [2018-02-04 12:53:47,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 12:53:47,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 12:53:47,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:53:47,889 INFO L87 Difference]: Start difference. First operand 378 states and 462 transitions. Second operand 29 states. [2018-02-04 12:53:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:49,847 INFO L93 Difference]: Finished difference Result 1033 states and 1241 transitions. [2018-02-04 12:53:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 12:53:49,847 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-02-04 12:53:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:49,849 INFO L225 Difference]: With dead ends: 1033 [2018-02-04 12:53:49,849 INFO L226 Difference]: Without dead ends: 1033 [2018-02-04 12:53:49,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=594, Invalid=2162, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 12:53:49,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2018-02-04 12:53:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 377. [2018-02-04 12:53:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-04 12:53:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 461 transitions. [2018-02-04 12:53:49,855 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 461 transitions. Word has length 54 [2018-02-04 12:53:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:49,856 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 461 transitions. [2018-02-04 12:53:49,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 12:53:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 461 transitions. [2018-02-04 12:53:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:53:49,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:49,856 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:49,857 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:49,857 INFO L82 PathProgramCache]: Analyzing trace with hash 750527693, now seen corresponding path program 1 times [2018-02-04 12:53:49,857 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:49,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:49,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:49,858 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:53:49,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:49,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:50,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:53:50,204 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:53:50,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:50,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:53:50,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:53:50,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:53:50,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:50,314 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 12 treesize of output 15 [2018-02-04 12:53:50,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:50,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:50,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:53:50,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:53:50,365 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 17 treesize of output 20 [2018-02-04 12:53:50,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:50,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-02-04 12:53:50,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:53:50,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:53:50,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:53:50,445 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-02-04 12:53:50,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:50,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:47 [2018-02-04 12:53:50,576 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 31 treesize of output 25 [2018-02-04 12:53:50,577 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 12:53:50,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,598 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 19 treesize of output 15 [2018-02-04 12:53:50,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 12:53:50,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:50,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:50,605 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:23 [2018-02-04 12:53:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:50,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:53:50,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-02-04 12:53:50,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:53:50,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:53:50,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:53:50,676 INFO L87 Difference]: Start difference. First operand 377 states and 461 transitions. Second operand 30 states. [2018-02-04 12:53:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:52,620 INFO L93 Difference]: Finished difference Result 1179 states and 1447 transitions. [2018-02-04 12:53:52,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 12:53:52,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2018-02-04 12:53:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:52,622 INFO L225 Difference]: With dead ends: 1179 [2018-02-04 12:53:52,622 INFO L226 Difference]: Without dead ends: 1179 [2018-02-04 12:53:52,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:53:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-02-04 12:53:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 383. [2018-02-04 12:53:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 12:53:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2018-02-04 12:53:52,628 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 54 [2018-02-04 12:53:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:52,628 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2018-02-04 12:53:52,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 12:53:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2018-02-04 12:53:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 12:53:52,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:52,629 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-02-04 12:53:52,629 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1483410129, now seen corresponding path program 1 times [2018-02-04 12:53:52,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:52,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:52,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:52,630 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:52,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:52,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:53:52,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:52,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 12:53:52,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:53:52,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:53:52,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:53:52,827 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 17 states. [2018-02-04 12:53:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:53,598 INFO L93 Difference]: Finished difference Result 541 states and 629 transitions. [2018-02-04 12:53:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:53:53,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-04 12:53:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:53,600 INFO L225 Difference]: With dead ends: 541 [2018-02-04 12:53:53,600 INFO L226 Difference]: Without dead ends: 541 [2018-02-04 12:53:53,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:53:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-04 12:53:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2018-02-04 12:53:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 12:53:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 471 transitions. [2018-02-04 12:53:53,603 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 471 transitions. Word has length 57 [2018-02-04 12:53:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:53,603 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 471 transitions. [2018-02-04 12:53:53,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:53:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 471 transitions. [2018-02-04 12:53:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 12:53:53,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:53,604 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-02-04 12:53:53,604 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash 713611172, now seen corresponding path program 1 times [2018-02-04 12:53:53,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:53,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:53,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:53,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:53,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:53,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:53:53,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:53,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:53:53,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:53:53,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:53:53,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:53,642 INFO L87 Difference]: Start difference. First operand 383 states and 471 transitions. Second operand 3 states. [2018-02-04 12:53:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:53,709 INFO L93 Difference]: Finished difference Result 382 states and 470 transitions. [2018-02-04 12:53:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:53:53,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-02-04 12:53:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:53,711 INFO L225 Difference]: With dead ends: 382 [2018-02-04 12:53:53,711 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 12:53:53,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 12:53:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-02-04 12:53:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 12:53:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 470 transitions. [2018-02-04 12:53:53,715 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 470 transitions. Word has length 57 [2018-02-04 12:53:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:53,716 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 470 transitions. [2018-02-04 12:53:53,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:53:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 470 transitions. [2018-02-04 12:53:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 12:53:53,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:53,716 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-02-04 12:53:53,717 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1414427259, now seen corresponding path program 1 times [2018-02-04 12:53:53,717 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:53,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:53,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:53,718 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:53,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:53,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:53:53,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:53,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:53:53,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:53:53,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:53:53,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:53:53,851 INFO L87 Difference]: Start difference. First operand 382 states and 470 transitions. Second operand 10 states. [2018-02-04 12:53:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:54,425 INFO L93 Difference]: Finished difference Result 752 states and 884 transitions. [2018-02-04 12:53:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:53:54,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-02-04 12:53:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:54,427 INFO L225 Difference]: With dead ends: 752 [2018-02-04 12:53:54,427 INFO L226 Difference]: Without dead ends: 752 [2018-02-04 12:53:54,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:53:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-02-04 12:53:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 424. [2018-02-04 12:53:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-04 12:53:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 546 transitions. [2018-02-04 12:53:54,430 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 546 transitions. Word has length 59 [2018-02-04 12:53:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:54,431 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 546 transitions. [2018-02-04 12:53:54,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:53:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 546 transitions. [2018-02-04 12:53:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:53:54,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:54,431 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:54,431 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:54,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389134, now seen corresponding path program 1 times [2018-02-04 12:53:54,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:54,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:54,432 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:54,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:54,432 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:54,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:53:54,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:54,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:53:54,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:53:54,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:53:54,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:53:54,463 INFO L87 Difference]: Start difference. First operand 424 states and 546 transitions. Second operand 4 states. [2018-02-04 12:53:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:54,573 INFO L93 Difference]: Finished difference Result 600 states and 770 transitions. [2018-02-04 12:53:54,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:53:54,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-02-04 12:53:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:54,574 INFO L225 Difference]: With dead ends: 600 [2018-02-04 12:53:54,574 INFO L226 Difference]: Without dead ends: 600 [2018-02-04 12:53:54,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:53:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-04 12:53:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 422. [2018-02-04 12:53:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 12:53:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 540 transitions. [2018-02-04 12:53:54,578 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 540 transitions. Word has length 60 [2018-02-04 12:53:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:54,578 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 540 transitions. [2018-02-04 12:53:54,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:53:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 540 transitions. [2018-02-04 12:53:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:53:54,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:54,578 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:54,579 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389133, now seen corresponding path program 1 times [2018-02-04 12:53:54,579 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:54,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:54,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:54,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:54,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:54,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:53:54,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:54,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:53:54,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:53:54,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:53:54,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:53:54,632 INFO L87 Difference]: Start difference. First operand 422 states and 540 transitions. Second operand 7 states. [2018-02-04 12:53:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:54,905 INFO L93 Difference]: Finished difference Result 662 states and 817 transitions. [2018-02-04 12:53:54,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:53:54,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-04 12:53:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:54,906 INFO L225 Difference]: With dead ends: 662 [2018-02-04 12:53:54,906 INFO L226 Difference]: Without dead ends: 662 [2018-02-04 12:53:54,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:53:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-02-04 12:53:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 429. [2018-02-04 12:53:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-04 12:53:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 551 transitions. [2018-02-04 12:53:54,910 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 551 transitions. Word has length 60 [2018-02-04 12:53:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:54,910 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 551 transitions. [2018-02-04 12:53:54,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:53:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 551 transitions. [2018-02-04 12:53:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:53:54,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:54,910 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:54,910 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash -897571947, now seen corresponding path program 1 times [2018-02-04 12:53:54,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:54,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:54,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:54,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:54,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:54,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:53:54,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:54,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:53:54,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:53:54,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:53:54,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:54,939 INFO L87 Difference]: Start difference. First operand 429 states and 551 transitions. Second operand 3 states. [2018-02-04 12:53:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:54,993 INFO L93 Difference]: Finished difference Result 426 states and 545 transitions. [2018-02-04 12:53:54,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:53:54,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-02-04 12:53:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:54,994 INFO L225 Difference]: With dead ends: 426 [2018-02-04 12:53:54,994 INFO L226 Difference]: Without dead ends: 426 [2018-02-04 12:53:54,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-04 12:53:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-02-04 12:53:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-02-04 12:53:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 545 transitions. [2018-02-04 12:53:54,997 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 545 transitions. Word has length 60 [2018-02-04 12:53:54,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:54,997 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 545 transitions. [2018-02-04 12:53:54,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:53:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 545 transitions. [2018-02-04 12:53:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:53:54,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:54,997 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:54,997 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:54,997 INFO L82 PathProgramCache]: Analyzing trace with hash -897571946, now seen corresponding path program 1 times [2018-02-04 12:53:54,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:54,998 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:54,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:54,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:54,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:55,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:53:55,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:53:55,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:53:55,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:53:55,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:53:55,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:55,030 INFO L87 Difference]: Start difference. First operand 426 states and 545 transitions. Second operand 3 states. [2018-02-04 12:53:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:53:55,078 INFO L93 Difference]: Finished difference Result 423 states and 539 transitions. [2018-02-04 12:53:55,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:53:55,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-02-04 12:53:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:53:55,079 INFO L225 Difference]: With dead ends: 423 [2018-02-04 12:53:55,079 INFO L226 Difference]: Without dead ends: 423 [2018-02-04 12:53:55,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:53:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-04 12:53:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-02-04 12:53:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 12:53:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 539 transitions. [2018-02-04 12:53:55,082 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 539 transitions. Word has length 60 [2018-02-04 12:53:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:53:55,082 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 539 transitions. [2018-02-04 12:53:55,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:53:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 539 transitions. [2018-02-04 12:53:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:53:55,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:53:55,083 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:53:55,083 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:53:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1820997833, now seen corresponding path program 1 times [2018-02-04 12:53:55,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:53:55,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:53:55,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:55,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:55,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:53:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:55,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:53:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:55,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:53:55,728 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:53:55,741 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:53:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:53:55,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:53:55,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 12:53:55,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 12:53:55,844 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-02-04 12:53:55,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:53:55,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 12:53:55,856 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 28 treesize of output 23 [2018-02-04 12:53:55,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:55,861 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 18 treesize of output 25 [2018-02-04 12:53:55,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-02-04 12:53:55,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:55,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:55,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:55,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-02-04 12:53:55,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-04 12:53:55,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-04 12:53:55,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:53:55,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-02-04 12:53:55,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-02-04 12:53:55,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:55,976 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 20 treesize of output 16 [2018-02-04 12:53:55,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:55,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:55,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2018-02-04 12:53:56,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-02-04 12:53:56,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:56,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:56,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:52 [2018-02-04 12:53:56,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:56,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 74 [2018-02-04 12:53:56,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 59 [2018-02-04 12:53:56,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:53:56,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-02-04 12:53:56,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:56,260 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:53:56,261 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 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 12:53:56,261 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:56,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 12:53:56,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-04 12:53:56,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:254 [2018-02-04 12:53:56,488 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 68 treesize of output 65 [2018-02-04 12:53:56,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:53:56,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:56,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:56,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-02-04 12:53:56,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:53:56,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:56,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:56,518 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 94 treesize of output 91 [2018-02-04 12:53:56,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:53:56,519 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:56,535 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:56,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:56,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:56,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:56,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 118 [2018-02-04 12:53:56,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:56,618 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 101 treesize of output 146 [2018-02-04 12:53:56,623 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-02-04 12:53:56,818 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:56,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:56,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 100 [2018-02-04 12:53:56,956 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:57,079 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-02-04 12:53:57,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-02-04 12:53:57,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:57,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-02-04 12:53:57,278 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:57,287 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:57,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:57,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:57,502 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:57,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 63 treesize of output 79 [2018-02-04 12:53:57,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:57,516 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-02-04 12:53:57,517 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:53:57,537 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:57,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 12:53:57,591 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:230, output treesize:230 [2018-02-04 12:53:58,260 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 119 treesize of output 115 [2018-02-04 12:53:58,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 12:53:58,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,314 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 86 treesize of output 82 [2018-02-04 12:53:58,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 12:53:58,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,366 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 78 treesize of output 74 [2018-02-04 12:53:58,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 12:53:58,368 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,376 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-02-04 12:53:58,408 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:284, output treesize:239 [2018-02-04 12:53:58,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:58,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:58,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2018-02-04 12:53:58,603 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 40 [2018-02-04 12:53:58,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-04 12:53:58,628 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 1 case distinctions, treesize of input 40 treesize of output 37 [2018-02-04 12:53:58,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:53:58,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:58,630 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 38 treesize of output 31 [2018-02-04 12:53:58,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,631 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-02-04 12:53:58,632 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 12:53:58,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:58,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:53:58,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 97 [2018-02-04 12:53:58,711 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2018-02-04 12:53:58,712 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:53:58,743 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-02-04 12:53:58,743 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,764 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 70 treesize of output 63 [2018-02-04 12:53:58,764 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2018-02-04 12:53:58,786 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:53:58,818 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 67 [2018-02-04 12:53:58,819 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 12:53:58,877 INFO L267 ElimStorePlain]: Start of recursive call 7: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-04 12:53:58,955 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2018-02-04 12:53:58,956 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:53:58,956 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 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-04 12:53:58,957 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 12:53:58,963 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 12:53:58,967 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:53:59,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 17 dim-0 vars, and 8 xjuncts. [2018-02-04 12:53:59,040 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:242, output treesize:224 [2018-02-04 12:53:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:53:59,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:53:59,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [25] total 47 [2018-02-04 12:53:59,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 12:53:59,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 12:53:59,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2069, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 12:53:59,243 INFO L87 Difference]: Start difference. First operand 423 states and 539 transitions. Second operand 48 states. [2018-02-04 12:54:00,551 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 107 DAG size of output 86 [2018-02-04 12:54:00,775 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 135 DAG size of output 109 [2018-02-04 12:54:01,216 WARN L146 SmtUtils]: Spent 366ms on a formula simplification. DAG size of input: 180 DAG size of output 154 [2018-02-04 12:54:01,497 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 140 DAG size of output 114 [2018-02-04 12:54:01,839 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 143 DAG size of output 118 [2018-02-04 12:54:02,416 WARN L146 SmtUtils]: Spent 483ms on a formula simplification. DAG size of input: 221 DAG size of output 157 [2018-02-04 12:54:02,981 WARN L146 SmtUtils]: Spent 464ms on a formula simplification. DAG size of input: 221 DAG size of output 158 [2018-02-04 12:54:03,156 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 116 DAG size of output 92 [2018-02-04 12:54:03,660 WARN L146 SmtUtils]: Spent 401ms on a formula simplification. DAG size of input: 227 DAG size of output 159 [2018-02-04 12:54:04,160 WARN L146 SmtUtils]: Spent 379ms on a formula simplification. DAG size of input: 221 DAG size of output 157 [2018-02-04 12:54:04,891 WARN L146 SmtUtils]: Spent 610ms on a formula simplification. DAG size of input: 274 DAG size of output 210 [2018-02-04 12:54:05,538 WARN L146 SmtUtils]: Spent 570ms on a formula simplification. DAG size of input: 252 DAG size of output 226 [2018-02-04 12:54:05,981 WARN L146 SmtUtils]: Spent 338ms on a formula simplification. DAG size of input: 213 DAG size of output 187 [2018-02-04 12:54:06,461 WARN L146 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 226 DAG size of output 190 [2018-02-04 12:54:06,901 WARN L146 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 226 DAG size of output 190 [2018-02-04 12:54:07,523 WARN L146 SmtUtils]: Spent 356ms on a formula simplification. DAG size of input: 233 DAG size of output 193 [2018-02-04 12:54:08,001 WARN L146 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 225 DAG size of output 190 [2018-02-04 12:54:08,504 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 150 DAG size of output 112 [2018-02-04 12:54:09,078 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 146 DAG size of output 143 [2018-02-04 12:54:09,464 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 159 DAG size of output 146 [2018-02-04 12:54:10,409 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 158 DAG size of output 146 [2018-02-04 12:54:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:18,671 INFO L93 Difference]: Finished difference Result 1401 states and 1758 transitions. [2018-02-04 12:54:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 12:54:18,671 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 60 [2018-02-04 12:54:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:18,674 INFO L225 Difference]: With dead ends: 1401 [2018-02-04 12:54:18,674 INFO L226 Difference]: Without dead ends: 1401 [2018-02-04 12:54:18,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1104, Invalid=5702, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 12:54:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-02-04 12:54:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 425. [2018-02-04 12:54:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 12:54:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 543 transitions. [2018-02-04 12:54:18,679 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 543 transitions. Word has length 60 [2018-02-04 12:54:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:18,679 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 543 transitions. [2018-02-04 12:54:18,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 12:54:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 543 transitions. [2018-02-04 12:54:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:54:18,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:18,680 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:54:18,680 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:54:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1820997832, now seen corresponding path program 1 times [2018-02-04 12:54:18,680 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:18,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:18,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:18,681 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:18,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:18,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:54:19,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:54:19,543 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:54:19,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:19,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:54:19,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:54:19,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:54:19,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,624 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 19 treesize of output 22 [2018-02-04 12:54:19,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:54:19,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-02-04 12:54:19,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:54:19,706 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 8 treesize of output 7 [2018-02-04 12:54:19,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:54:19,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:54:19,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:58 [2018-02-04 12:54:19,770 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 46 treesize of output 37 [2018-02-04 12:54:19,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 48 [2018-02-04 12:54:19,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,793 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 38 treesize of output 31 [2018-02-04 12:54:19,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,796 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 31 treesize of output 40 [2018-02-04 12:54:19,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:58 [2018-02-04 12:54:19,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-02-04 12:54:19,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:54:19,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:64 [2018-02-04 12:54:19,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-04 12:54:19,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:54:19,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-04 12:54:19,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:54:19,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:82 [2018-02-04 12:54:20,075 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 42 treesize of output 41 [2018-02-04 12:54:20,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,079 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 20 treesize of output 16 [2018-02-04 12:54:20,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,111 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 41 treesize of output 40 [2018-02-04 12:54:20,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,114 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 20 treesize of output 16 [2018-02-04 12:54:20,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:112, output treesize:82 [2018-02-04 12:54:20,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 45 [2018-02-04 12:54:20,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,172 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 16 treesize of output 13 [2018-02-04 12:54:20,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:88 [2018-02-04 12:54:20,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-02-04 12:54:20,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:54:20,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-02-04 12:54:20,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:54:20,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:119 [2018-02-04 12:54:20,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 77 [2018-02-04 12:54:20,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,516 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 41 treesize of output 50 [2018-02-04 12:54:20,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2018-02-04 12:54:20,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:20,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 75 [2018-02-04 12:54:20,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:20,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:145, output treesize:203 [2018-02-04 12:54:21,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 172 [2018-02-04 12:54:21,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2018-02-04 12:54:21,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:54:21,256 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 11 treesize of output 1 [2018-02-04 12:54:21,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:21,272 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 10 [2018-02-04 12:54:21,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:21,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:54:21,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-02-04 12:54:21,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:21,304 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2018-02-04 12:54:21,304 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:54:21,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 12:54:21,317 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:21,322 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 18 treesize of output 9 [2018-02-04 12:54:21,323 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:21,326 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:21,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:54:21,337 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:241, output treesize:45 [2018-02-04 12:54:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:54:21,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:54:21,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2018-02-04 12:54:21,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 12:54:21,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 12:54:21,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2115, Unknown=10, NotChecked=0, Total=2256 [2018-02-04 12:54:21,525 INFO L87 Difference]: Start difference. First operand 425 states and 543 transitions. Second operand 48 states. [2018-02-04 12:54:38,577 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 134 DAG size of output 82 [2018-02-04 12:54:42,847 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 129 DAG size of output 76 [2018-02-04 12:54:56,149 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 145 DAG size of output 97 [2018-02-04 12:54:58,448 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 174 DAG size of output 117 [2018-02-04 12:54:58,918 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 203 DAG size of output 139 [2018-02-04 12:54:59,538 WARN L146 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 270 DAG size of output 190 [2018-02-04 12:55:04,053 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 208 DAG size of output 143 [2018-02-04 12:55:04,387 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 191 DAG size of output 129 [2018-02-04 12:55:05,053 WARN L146 SmtUtils]: Spent 448ms on a formula simplification. DAG size of input: 302 DAG size of output 193 [2018-02-04 12:55:05,750 WARN L146 SmtUtils]: Spent 452ms on a formula simplification. DAG size of input: 302 DAG size of output 193 [2018-02-04 12:55:08,095 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 164 DAG size of output 108 [2018-02-04 12:55:12,957 WARN L146 SmtUtils]: Spent 520ms on a formula simplification. DAG size of input: 314 DAG size of output 230 [2018-02-04 12:55:13,456 WARN L146 SmtUtils]: Spent 399ms on a formula simplification. DAG size of input: 309 DAG size of output 239 [2018-02-04 12:55:13,952 WARN L146 SmtUtils]: Spent 318ms on a formula simplification. DAG size of input: 260 DAG size of output 191 [2018-02-04 12:55:14,483 WARN L146 SmtUtils]: Spent 366ms on a formula simplification. DAG size of input: 284 DAG size of output 196 [2018-02-04 12:55:15,005 WARN L146 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 285 DAG size of output 196 [2018-02-04 12:55:20,082 WARN L146 SmtUtils]: Spent 429ms on a formula simplification. DAG size of input: 297 DAG size of output 201 [2018-02-04 12:55:20,707 WARN L146 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 284 DAG size of output 196 [2018-02-04 12:55:21,617 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 230 DAG size of output 144 [2018-02-04 12:55:22,346 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 160 DAG size of output 133 [2018-02-04 12:55:22,778 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 185 DAG size of output 137 [2018-02-04 12:55:29,992 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 184 DAG size of output 138 [2018-02-04 12:55:32,568 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 70 DAG size of output 58 [2018-02-04 12:55:40,295 WARN L146 SmtUtils]: Spent 463ms on a formula simplification. DAG size of input: 67 DAG size of output 56 [2018-02-04 12:55:43,279 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 141 DAG size of output 120 [2018-02-04 12:55:48,188 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 166 DAG size of output 125 [2018-02-04 12:55:49,115 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 165 DAG size of output 125 [2018-02-04 12:55:50,844 WARN L146 SmtUtils]: Spent 316ms on a formula simplification. DAG size of input: 66 DAG size of output 54 [2018-02-04 12:55:51,465 WARN L146 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-02-04 12:55:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:55:51,582 INFO L93 Difference]: Finished difference Result 1728 states and 2139 transitions. [2018-02-04 12:55:51,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 12:55:51,582 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 60 [2018-02-04 12:55:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:55:51,585 INFO L225 Difference]: With dead ends: 1728 [2018-02-04 12:55:51,585 INFO L226 Difference]: Without dead ends: 1728 [2018-02-04 12:55:51,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=1627, Invalid=7483, Unknown=10, NotChecked=0, Total=9120 [2018-02-04 12:55:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2018-02-04 12:55:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 425. [2018-02-04 12:55:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 12:55:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 542 transitions. [2018-02-04 12:55:51,591 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 542 transitions. Word has length 60 [2018-02-04 12:55:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:55:51,591 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 542 transitions. [2018-02-04 12:55:51,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 12:55:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 542 transitions. [2018-02-04 12:55:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 12:55:51,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:55:51,591 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:55:51,591 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:55:51,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2109123243, now seen corresponding path program 1 times [2018-02-04 12:55:51,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:55:51,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:55:51,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:51,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:51,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:51,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:55:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:55:51,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:55:51,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:55:51,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:55:51,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:55:51,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:55:51,651 INFO L87 Difference]: Start difference. First operand 425 states and 542 transitions. Second operand 7 states. [2018-02-04 12:55:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:55:51,825 INFO L93 Difference]: Finished difference Result 558 states and 710 transitions. [2018-02-04 12:55:51,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:55:51,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-02-04 12:55:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:55:51,826 INFO L225 Difference]: With dead ends: 558 [2018-02-04 12:55:51,826 INFO L226 Difference]: Without dead ends: 558 [2018-02-04 12:55:51,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:55:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-02-04 12:55:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 426. [2018-02-04 12:55:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-02-04 12:55:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 542 transitions. [2018-02-04 12:55:51,829 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 542 transitions. Word has length 62 [2018-02-04 12:55:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:55:51,829 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 542 transitions. [2018-02-04 12:55:51,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:55:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 542 transitions. [2018-02-04 12:55:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 12:55:51,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:55:51,830 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:55:51,830 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:55:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2062516920, now seen corresponding path program 1 times [2018-02-04 12:55:51,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:55:51,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:55:51,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:51,830 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:51,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:51,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:55:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:55:52,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:55:52,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 12:55:52,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:55:52,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:55:52,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:55:52,211 INFO L87 Difference]: Start difference. First operand 426 states and 542 transitions. Second operand 21 states. [2018-02-04 12:55:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:55:53,243 INFO L93 Difference]: Finished difference Result 641 states and 762 transitions. [2018-02-04 12:55:53,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 12:55:53,243 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-02-04 12:55:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:55:53,244 INFO L225 Difference]: With dead ends: 641 [2018-02-04 12:55:53,244 INFO L226 Difference]: Without dead ends: 641 [2018-02-04 12:55:53,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=398, Invalid=1672, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 12:55:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-02-04 12:55:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 419. [2018-02-04 12:55:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-02-04 12:55:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 529 transitions. [2018-02-04 12:55:53,247 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 529 transitions. Word has length 63 [2018-02-04 12:55:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:55:53,247 INFO L432 AbstractCegarLoop]: Abstraction has 419 states and 529 transitions. [2018-02-04 12:55:53,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:55:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 529 transitions. [2018-02-04 12:55:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 12:55:53,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:55:53,248 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:55:53,248 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:55:53,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2063806807, now seen corresponding path program 1 times [2018-02-04 12:55:53,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:55:53,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:55:53,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:53,249 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:53,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:53,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:55:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:55:53,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:55:53,453 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:55:53,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:53,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:55:53,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:55:53,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:55:53,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:55:53,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:55:53,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-04 12:55:53,564 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 15 treesize of output 11 [2018-02-04 12:55:53,567 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 11 treesize of output 3 [2018-02-04 12:55:53,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,573 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 15 treesize of output 11 [2018-02-04 12:55:53,573 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 11 treesize of output 3 [2018-02-04 12:55:53,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:53,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-04 12:55:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:55:53,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:55:53,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-02-04 12:55:53,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:55:53,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:55:53,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:55:53,615 INFO L87 Difference]: Start difference. First operand 419 states and 529 transitions. Second operand 17 states. [2018-02-04 12:55:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:55:54,109 INFO L93 Difference]: Finished difference Result 616 states and 754 transitions. [2018-02-04 12:55:54,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:55:54,110 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-02-04 12:55:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:55:54,111 INFO L225 Difference]: With dead ends: 616 [2018-02-04 12:55:54,111 INFO L226 Difference]: Without dead ends: 616 [2018-02-04 12:55:54,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:55:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-02-04 12:55:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 444. [2018-02-04 12:55:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-02-04 12:55:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 558 transitions. [2018-02-04 12:55:54,114 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 558 transitions. Word has length 63 [2018-02-04 12:55:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:55:54,114 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 558 transitions. [2018-02-04 12:55:54,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:55:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 558 transitions. [2018-02-04 12:55:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 12:55:54,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:55:54,115 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:55:54,115 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:55:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 900666760, now seen corresponding path program 1 times [2018-02-04 12:55:54,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:55:54,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:55:54,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:54,115 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:54,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:54,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:55:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:55:54,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:55:54,321 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:55:54,326 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:54,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:55:54,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:55:54,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:55:54,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:55:54,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:55:54,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-04 12:55:54,394 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 19 treesize of output 15 [2018-02-04 12:55:54,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 12:55:54,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,400 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 19 treesize of output 15 [2018-02-04 12:55:54,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 12:55:54,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:54,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:10 [2018-02-04 12:55:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:55:54,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:55:54,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2018-02-04 12:55:54,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:55:54,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:55:54,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:55:54,443 INFO L87 Difference]: Start difference. First operand 444 states and 558 transitions. Second operand 17 states. [2018-02-04 12:55:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:55:54,818 INFO L93 Difference]: Finished difference Result 507 states and 626 transitions. [2018-02-04 12:55:54,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:55:54,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-02-04 12:55:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:55:54,820 INFO L225 Difference]: With dead ends: 507 [2018-02-04 12:55:54,820 INFO L226 Difference]: Without dead ends: 507 [2018-02-04 12:55:54,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:55:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-04 12:55:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 444. [2018-02-04 12:55:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-02-04 12:55:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 557 transitions. [2018-02-04 12:55:54,823 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 557 transitions. Word has length 63 [2018-02-04 12:55:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:55:54,823 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 557 transitions. [2018-02-04 12:55:54,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:55:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 557 transitions. [2018-02-04 12:55:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 12:55:54,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:55:54,823 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:55:54,823 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:55:54,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1049147157, now seen corresponding path program 1 times [2018-02-04 12:55:54,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:55:54,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:55:54,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:54,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:54,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:54,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:55:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:55:54,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:55:54,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:55:54,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:55:54,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:55:54,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:55:54,912 INFO L87 Difference]: Start difference. First operand 444 states and 557 transitions. Second operand 7 states. [2018-02-04 12:55:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:55:55,015 INFO L93 Difference]: Finished difference Result 511 states and 589 transitions. [2018-02-04 12:55:55,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:55:55,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2018-02-04 12:55:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:55:55,016 INFO L225 Difference]: With dead ends: 511 [2018-02-04 12:55:55,016 INFO L226 Difference]: Without dead ends: 511 [2018-02-04 12:55:55,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:55:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-02-04 12:55:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 442. [2018-02-04 12:55:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 12:55:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 551 transitions. [2018-02-04 12:55:55,019 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 551 transitions. Word has length 65 [2018-02-04 12:55:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:55:55,019 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 551 transitions. [2018-02-04 12:55:55,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:55:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 551 transitions. [2018-02-04 12:55:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 12:55:55,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:55:55,020 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:55:55,020 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 12:55:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1100884161, now seen corresponding path program 1 times [2018-02-04 12:55:55,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:55:55,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:55:55,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:55,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:55,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:55,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:55:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:55:56,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:55:56,233 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:55:56,237 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:56,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:55:56,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:55:56,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:55:56,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:55:56,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:55:56,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,325 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-04 12:55:56,357 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 25 treesize of output 20 [2018-02-04 12:55:56,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,360 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 20 treesize of output 16 [2018-02-04 12:55:56,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,373 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 25 treesize of output 20 [2018-02-04 12:55:56,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,376 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 20 treesize of output 16 [2018-02-04 12:55:56,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 [2018-02-04 12:55:56,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:55:56,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2018-02-04 12:55:56,517 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 19 treesize of output 20 [2018-02-04 12:55:56,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:55:56,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,543 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 19 treesize of output 20 [2018-02-04 12:55:56,545 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 8 treesize of output 7 [2018-02-04 12:55:56,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:58 [2018-02-04 12:55:56,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-02-04 12:55:56,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2018-02-04 12:55:56,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,666 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 32 treesize of output 35 [2018-02-04 12:55:56,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:55:56,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,687 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:58 [2018-02-04 12:55:56,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,736 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 20 treesize of output 21 [2018-02-04 12:55:56,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:59 [2018-02-04 12:55:56,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-02-04 12:55:56,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:55:56,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 49 [2018-02-04 12:55:56,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:55:56,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:77 [2018-02-04 12:55:56,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2018-02-04 12:55:56,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,936 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 20 treesize of output 16 [2018-02-04 12:55:56,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 58 [2018-02-04 12:55:56,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:56,966 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 20 treesize of output 16 [2018-02-04 12:55:56,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:56,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2018-02-04 12:55:57,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:57,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 59 treesize of output 109 [2018-02-04 12:55:57,179 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 12:55:57,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-02-04 12:55:57,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,472 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:57,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-02-04 12:55:57,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:55:57,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, 8 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 12:55:57,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:57,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:57,684 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:57,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2018-02-04 12:55:57,689 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:57,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-02-04 12:55:57,690 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,709 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:57,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 137 [2018-02-04 12:55:57,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:57,737 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:57,737 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 100 treesize of output 112 [2018-02-04 12:55:57,737 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,853 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 83 treesize of output 82 [2018-02-04 12:55:57,853 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,882 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,885 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:57,890 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 88 treesize of output 92 [2018-02-04 12:55:57,891 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:57,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-02-04 12:55:57,892 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,904 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,909 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:57,911 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 69 treesize of output 81 [2018-02-04 12:55:57,912 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:57,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-02-04 12:55:57,913 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,924 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:57,989 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 4 xjuncts. [2018-02-04 12:55:57,989 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:108, output treesize:428 [2018-02-04 12:55:58,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 113 [2018-02-04 12:55:58,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 66 [2018-02-04 12:55:58,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:58,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:58,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 106 [2018-02-04 12:55:58,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,246 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:58,246 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 51 treesize of output 71 [2018-02-04 12:55:58,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:58,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:58,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 187 [2018-02-04 12:55:58,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,349 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:58,349 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 173 treesize of output 193 [2018-02-04 12:55:58,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:58,463 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:55:58,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 186 [2018-02-04 12:55:58,556 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 12:55:58,557 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:58,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,814 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:58,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 133 [2018-02-04 12:55:58,816 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:58,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:58,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 150 [2018-02-04 12:55:58,960 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:59,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:59,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:59,082 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:59,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:59,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 151 [2018-02-04 12:55:59,084 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:59,221 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:55:59,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 12:55:59,303 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:266, output treesize:654 [2018-02-04 12:56:00,542 WARN L143 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 91 [2018-02-04 12:56:00,988 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 89 DAG size of output 67 [2018-02-04 12:56:03,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:03,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 282 treesize of output 247 [2018-02-04 12:56:03,592 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 236 treesize of output 221 [2018-02-04 12:56:03,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:03,727 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:03,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 200 [2018-02-04 12:56:03,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:03,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:03,835 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:03,835 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 184 [2018-02-04 12:56:03,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:56:03,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:03,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:03,959 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:03,959 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:03,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 191 treesize of output 159 [2018-02-04 12:56:03,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,064 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,064 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,064 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 165 [2018-02-04 12:56:04,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,158 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 137 treesize of output 133 [2018-02-04 12:56:04,158 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 115 [2018-02-04 12:56:04,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,356 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,357 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,357 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,368 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 106 [2018-02-04 12:56:04,369 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:56:04,446 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 34 treesize of output 32 [2018-02-04 12:56:04,446 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2018-02-04 12:56:04,478 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:56:04,498 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 54 treesize of output 47 [2018-02-04 12:56:04,498 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,522 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-02-04 12:56:04,522 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-02-04 12:56:04,617 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,644 INFO L267 ElimStorePlain]: Start of recursive call 9: 12 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:56:04,722 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 171 [2018-02-04 12:56:04,732 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,733 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 64 [2018-02-04 12:56:04,733 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:56:04,761 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 12:56:04,762 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,777 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:56:04,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 79 [2018-02-04 12:56:04,841 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 12:56:04,842 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,860 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 38 treesize of output 20 [2018-02-04 12:56:04,860 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,869 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 176 [2018-02-04 12:56:04,924 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 19 treesize of output 3 [2018-02-04 12:56:04,925 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,950 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:04,951 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,951 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:04,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85 [2018-02-04 12:56:04,952 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 12:56:04,977 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:04,987 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:56:05,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:05,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:56:05,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2018-02-04 12:56:05,031 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:56:05,041 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 55 [2018-02-04 12:56:05,042 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:56:05,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 12:56:05,059 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:05,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:56:05,065 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 12:56:05,070 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:56:05,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 12:56:05,106 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 13 variables, input treesize:710, output treesize:67 [2018-02-04 12:56:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:56:05,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:56:05,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 35] total 59 [2018-02-04 12:56:05,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 12:56:05,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 12:56:05,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=3238, Unknown=22, NotChecked=0, Total=3422 [2018-02-04 12:56:05,578 INFO L87 Difference]: Start difference. First operand 442 states and 551 transitions. Second operand 59 states. Received shutdown request... [2018-02-04 12:57:00,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:57:00,624 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:57:00,632 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:57:00,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:57:00 BoogieIcfgContainer [2018-02-04 12:57:00,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:57:00,634 INFO L168 Benchmark]: Toolchain (without parser) took 206912.89 ms. Allocated memory was 400.0 MB in the beginning and 758.6 MB in the end (delta: 358.6 MB). Free memory was 356.9 MB in the beginning and 398.1 MB in the end (delta: -41.2 MB). Peak memory consumption was 317.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:57:00,634 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:57:00,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.92 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 344.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-02-04 12:57:00,635 INFO L168 Benchmark]: Boogie Preprocessor took 34.51 ms. Allocated memory is still 400.0 MB. Free memory was 344.8 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:57:00,635 INFO L168 Benchmark]: RCFGBuilder took 544.06 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 279.9 MB in the end (delta: 62.3 MB). Peak memory consumption was 62.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:57:00,635 INFO L168 Benchmark]: TraceAbstraction took 206143.61 ms. Allocated memory was 400.0 MB in the beginning and 758.6 MB in the end (delta: 358.6 MB). Free memory was 279.9 MB in the beginning and 398.1 MB in the end (delta: -118.2 MB). Peak memory consumption was 240.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:57:00,636 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.10 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 187.92 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 344.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.51 ms. Allocated memory is still 400.0 MB. Free memory was 344.8 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 544.06 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 279.9 MB in the end (delta: 62.3 MB). Peak memory consumption was 62.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 206143.61 ms. Allocated memory was 400.0 MB in the beginning and 758.6 MB in the end (delta: 358.6 MB). Free memory was 279.9 MB in the beginning and 398.1 MB in the end (delta: -118.2 MB). Peak memory consumption was 240.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 713). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 741). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 733). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 693). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 771). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 757). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 712). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 702). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 721). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 773). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 721). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 760). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 696). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 760). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 771). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 773). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 702). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 774). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 745). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 770). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 696). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 714). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 741). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 757). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 693). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 770). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 733). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 714). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 774). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 712). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 745). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 8 states, 59 states before enhancement), while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 247 locations, 91 error locations. TIMEOUT Result, 206.1s OverallTime, 44 OverallIterations, 3 TraceHistogramMax, 182.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10655 SDtfs, 44969 SDslu, 60596 SDs, 0 SdLazy, 40084 SolverSat, 1600 SolverUnsat, 73 SolverUnknown, 0 SolverNotchecked, 146.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1311 GetRequests, 413 SyntacticMatches, 72 SemanticMatches, 826 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6997 ImplicationChecksByTransitivity, 41.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=444occurred in iteration=41, 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.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 11041 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 2398 NumberOfCodeBlocks, 2398 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2346 ConstructedInterpolants, 118 QuantifiedInterpolants, 2830443 SizeOfPredicates, 200 NumberOfNonLiveVariables, 1889 ConjunctsInSsa, 458 ConjunctsInUnsatCore, 52 InterpolantComputations, 38 PerfectInterpolantSequences, 240/359 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-57-00-649.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-57-00-649.csv Completed graceful shutdown