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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:40:42,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:40:42,759 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:40:42,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:40:42,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:40:42,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:40:42,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:40:42,773 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:40:42,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:40:42,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:40:42,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:40:42,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:40:42,776 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:40:42,777 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:40:42,778 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:40:42,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:40:42,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:40:42,782 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:40:42,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:40:42,784 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:40:42,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:40:42,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:40:42,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:40:42,787 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:40:42,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:40:42,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:40:42,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:40:42,789 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:40:42,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:40:42,789 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:40:42,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:40:42,790 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 19:40:42,799 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:40:42,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:40:42,801 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:40:42,801 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:40:42,801 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:40:42,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:40:42,801 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:40:42,801 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:40:42,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:40:42,802 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:40:42,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:40:42,802 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:40:42,802 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:40:42,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:40:42,802 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:40:42,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:40:42,803 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:40:42,803 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:40:42,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:40:42,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:40:42,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:40:42,804 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:40:42,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:40:42,804 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:40:42,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:40:42,841 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:40:42,848 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:40:42,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:40:42,850 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:40:42,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-02-04 19:40:42,992 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:40:42,993 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:40:42,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:40:42,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:40:42,999 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:40:42,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:40:42" (1/1) ... [2018-02-04 19:40:43,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43, skipping insertion in model container [2018-02-04 19:40:43,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:40:42" (1/1) ... [2018-02-04 19:40:43,015 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:40:43,044 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:40:43,126 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:40:43,138 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:40:43,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43 WrapperNode [2018-02-04 19:40:43,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:40:43,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:40:43,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:40:43,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:40:43,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (1/1) ... [2018-02-04 19:40:43,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (1/1) ... [2018-02-04 19:40:43,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (1/1) ... [2018-02-04 19:40:43,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (1/1) ... [2018-02-04 19:40:43,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (1/1) ... [2018-02-04 19:40:43,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (1/1) ... [2018-02-04 19:40:43,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (1/1) ... [2018-02-04 19:40:43,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:40:43,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:40:43,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:40:43,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:40:43,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (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 19:40:43,203 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:40:43,204 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:40:43,204 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:40:43,204 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:40:43,205 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 19:40:43,205 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:40:43,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:40:43,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:40:43,461 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:40:43,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:40:43 BoogieIcfgContainer [2018-02-04 19:40:43,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:40:43,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:40:43,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:40:43,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:40:43,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:40:42" (1/3) ... [2018-02-04 19:40:43,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a209a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:40:43, skipping insertion in model container [2018-02-04 19:40:43,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:40:43" (2/3) ... [2018-02-04 19:40:43,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a209a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:40:43, skipping insertion in model container [2018-02-04 19:40:43,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:40:43" (3/3) ... [2018-02-04 19:40:43,468 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-02-04 19:40:43,475 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:40:43,481 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 19:40:43,507 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:40:43,508 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:40:43,508 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:40:43,508 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:40:43,508 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:40:43,508 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:40:43,508 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:40:43,509 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:40:43,509 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:40:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-02-04 19:40:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 19:40:43,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:43,531 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:43,531 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 805618339, now seen corresponding path program 1 times [2018-02-04 19:40:43,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:43,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:43,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:43,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:43,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:43,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:43,672 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 19:40:43,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:43,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:40:43,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:40:43,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:40:43,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:40:43,688 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2018-02-04 19:40:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:43,912 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-02-04 19:40:43,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:40:43,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 19:40:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:43,920 INFO L225 Difference]: With dead ends: 152 [2018-02-04 19:40:43,920 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 19:40:43,921 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 19:40:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 19:40:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2018-02-04 19:40:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 19:40:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-02-04 19:40:43,954 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 8 [2018-02-04 19:40:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:43,954 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-02-04 19:40:43,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:40:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-02-04 19:40:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 19:40:43,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:43,955 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:43,955 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash 805618340, now seen corresponding path program 1 times [2018-02-04 19:40:43,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:43,955 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:43,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:43,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:43,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:43,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:44,015 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 19:40:44,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:44,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:40:44,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:40:44,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:40:44,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:40:44,018 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 4 states. [2018-02-04 19:40:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:44,144 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-04 19:40:44,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:40:44,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 19:40:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:44,145 INFO L225 Difference]: With dead ends: 129 [2018-02-04 19:40:44,146 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 19:40:44,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:40:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 19:40:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2018-02-04 19:40:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 19:40:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-02-04 19:40:44,153 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 8 [2018-02-04 19:40:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:44,153 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-02-04 19:40:44,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:40:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-02-04 19:40:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 19:40:44,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:44,154 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:44,154 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash -86961810, now seen corresponding path program 1 times [2018-02-04 19:40:44,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:44,154 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:44,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:44,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:44,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:44,177 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:44,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:44,177 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:44,178 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:44,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:44,232 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 19:40:44,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:44,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:44,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:40:44,250 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 19:40:44,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:44,254 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 19:40:44,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:40:44,267 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 19:40:44,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:44,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:40:44,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:40:44,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:40:44,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:40:44,268 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 5 states. [2018-02-04 19:40:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:44,406 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-02-04 19:40:44,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:40:44,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 19:40:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:44,410 INFO L225 Difference]: With dead ends: 103 [2018-02-04 19:40:44,410 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 19:40:44,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 1 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 19:40:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 19:40:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-02-04 19:40:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 19:40:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-02-04 19:40:44,415 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 15 [2018-02-04 19:40:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:44,416 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-02-04 19:40:44,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:40:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-02-04 19:40:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 19:40:44,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:44,416 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:44,416 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash -86961809, now seen corresponding path program 1 times [2018-02-04 19:40:44,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:44,417 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:44,417 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,418 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:44,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:44,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:44,432 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:44,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:44,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:44,433 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:44,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:44,458 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 19:40:44,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:44,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:44,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:40:44,509 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 19:40:44,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:44,515 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 19:40:44,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-02-04 19:40:44,521 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 19:40:44,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:44,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:40:44,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:40:44,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:40:44,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:40:44,522 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 6 states. [2018-02-04 19:40:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:44,690 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2018-02-04 19:40:44,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:40:44,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 19:40:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:44,691 INFO L225 Difference]: With dead ends: 160 [2018-02-04 19:40:44,691 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 19:40:44,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:40:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 19:40:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2018-02-04 19:40:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 19:40:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2018-02-04 19:40:44,698 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 15 [2018-02-04 19:40:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:44,698 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2018-02-04 19:40:44,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:40:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2018-02-04 19:40:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 19:40:44,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:44,699 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:44,699 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash -854983682, now seen corresponding path program 1 times [2018-02-04 19:40:44,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:44,700 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:44,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:44,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:44,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:44,733 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 19:40:44,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:44,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:40:44,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:40:44,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:40:44,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:40:44,734 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 4 states. [2018-02-04 19:40:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:44,816 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2018-02-04 19:40:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:40:44,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 19:40:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:44,819 INFO L225 Difference]: With dead ends: 151 [2018-02-04 19:40:44,819 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 19:40:44,820 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 19:40:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 19:40:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2018-02-04 19:40:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 19:40:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2018-02-04 19:40:44,826 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 18 [2018-02-04 19:40:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:44,826 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2018-02-04 19:40:44,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:40:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2018-02-04 19:40:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 19:40:44,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:44,827 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:44,827 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash -854983681, now seen corresponding path program 1 times [2018-02-04 19:40:44,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:44,827 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:44,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:44,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:44,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:44,888 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 19:40:44,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:44,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:40:44,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:40:44,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:40:44,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:40:44,889 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 4 states. [2018-02-04 19:40:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:44,966 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2018-02-04 19:40:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:40:44,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 19:40:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:44,967 INFO L225 Difference]: With dead ends: 152 [2018-02-04 19:40:44,967 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 19:40:44,967 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 19:40:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 19:40:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2018-02-04 19:40:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 19:40:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2018-02-04 19:40:44,972 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 18 [2018-02-04 19:40:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:44,973 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2018-02-04 19:40:44,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:40:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2018-02-04 19:40:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 19:40:44,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:44,974 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:44,974 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash -814008083, now seen corresponding path program 1 times [2018-02-04 19:40:44,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:44,974 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:44,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:44,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:44,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:45,007 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 19:40:45,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:45,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:40:45,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:40:45,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:40:45,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:40:45,008 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand 6 states. [2018-02-04 19:40:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:45,198 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2018-02-04 19:40:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:40:45,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 19:40:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:45,201 INFO L225 Difference]: With dead ends: 228 [2018-02-04 19:40:45,201 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 19:40:45,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:40:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 19:40:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 132. [2018-02-04 19:40:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 19:40:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2018-02-04 19:40:45,206 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 18 [2018-02-04 19:40:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:45,206 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2018-02-04 19:40:45,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:40:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2018-02-04 19:40:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 19:40:45,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:45,207 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:45,207 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash -814008082, now seen corresponding path program 1 times [2018-02-04 19:40:45,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:45,208 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:45,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:45,208 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:45,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:45,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:45,261 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 19:40:45,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:45,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:40:45,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:40:45,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:40:45,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:40:45,262 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand 6 states. [2018-02-04 19:40:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:45,469 INFO L93 Difference]: Finished difference Result 232 states and 278 transitions. [2018-02-04 19:40:45,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:40:45,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 19:40:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:45,470 INFO L225 Difference]: With dead ends: 232 [2018-02-04 19:40:45,470 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 19:40:45,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:40:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 19:40:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 122. [2018-02-04 19:40:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 19:40:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2018-02-04 19:40:45,474 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 18 [2018-02-04 19:40:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:45,474 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2018-02-04 19:40:45,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:40:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2018-02-04 19:40:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:40:45,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:45,474 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:45,474 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1060549093, now seen corresponding path program 1 times [2018-02-04 19:40:45,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:45,475 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:45,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:45,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:45,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:45,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:45,482 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:45,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:45,482 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:45,483 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:45,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:45,517 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 19:40:45,518 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 19:40:45,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,525 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 19:40:45,527 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 19:40:45,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-04 19:40:45,554 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 27 treesize of output 22 [2018-02-04 19:40:45,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:45,571 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 22 treesize of output 14 [2018-02-04 19:40:45,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,582 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 27 treesize of output 22 [2018-02-04 19:40:45,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:45,587 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 22 treesize of output 14 [2018-02-04 19:40:45,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:21 [2018-02-04 19:40:45,610 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 19:40:45,612 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:45,612 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 11 treesize of output 7 [2018-02-04 19:40:45,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,624 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 19:40:45,626 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:45,627 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 11 treesize of output 7 [2018-02-04 19:40:45,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:45,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:7 [2018-02-04 19:40:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:45,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:45,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:40:45,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:40:45,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:40:45,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:40:45,645 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 7 states. [2018-02-04 19:40:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:45,776 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2018-02-04 19:40:45,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:40:45,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 19:40:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:45,777 INFO L225 Difference]: With dead ends: 149 [2018-02-04 19:40:45,777 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 19:40:45,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:40:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 19:40:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2018-02-04 19:40:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 19:40:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-02-04 19:40:45,780 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 23 [2018-02-04 19:40:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:45,780 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-02-04 19:40:45,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:40:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-02-04 19:40:45,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:40:45,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:45,780 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 19:40:45,781 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:45,781 INFO L82 PathProgramCache]: Analyzing trace with hash -212541728, now seen corresponding path program 1 times [2018-02-04 19:40:45,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:45,781 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:45,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:45,781 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:45,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:45,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:45,833 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 19:40:45,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:45,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:40:45,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:40:45,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:40:45,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:40:45,834 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 5 states. [2018-02-04 19:40:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:45,951 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2018-02-04 19:40:45,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:40:45,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 19:40:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:45,952 INFO L225 Difference]: With dead ends: 162 [2018-02-04 19:40:45,952 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 19:40:45,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 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 19:40:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 19:40:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2018-02-04 19:40:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 19:40:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-02-04 19:40:45,955 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 23 [2018-02-04 19:40:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:45,956 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-02-04 19:40:45,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:40:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-02-04 19:40:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:40:45,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:45,957 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:45,957 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1439904849, now seen corresponding path program 1 times [2018-02-04 19:40:45,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:45,957 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:45,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:45,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:45,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:45,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:45,973 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:45,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:45,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:45,974 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:46,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:46,043 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 19:40:46,044 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 19:40:46,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-02-04 19:40:46,061 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 19:40:46,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:46,065 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 19:40:46,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-02-04 19:40:46,094 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 19:40:46,096 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 19:40:46,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,099 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 19:40:46,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-02-04 19:40:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:46,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:46,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:40:46,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:40:46,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:40:46,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:40:46,107 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 9 states. [2018-02-04 19:40:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:46,319 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2018-02-04 19:40:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:40:46,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 19:40:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:46,320 INFO L225 Difference]: With dead ends: 149 [2018-02-04 19:40:46,320 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 19:40:46,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:40:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 19:40:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 112. [2018-02-04 19:40:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 19:40:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-02-04 19:40:46,323 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 28 [2018-02-04 19:40:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:46,323 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-02-04 19:40:46,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:40:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-02-04 19:40:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 19:40:46,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:46,324 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] [2018-02-04 19:40:46,324 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1636816270, now seen corresponding path program 1 times [2018-02-04 19:40:46,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:46,324 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:46,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:46,325 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:46,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:46,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:46,335 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:46,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:46,335 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:46,335 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:46,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:46,370 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 19:40:46,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 19:40:46,397 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 19:40:46,399 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 19:40:46,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,408 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 19:40:46,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 19:40:46,450 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 17 treesize of output 13 [2018-02-04 19:40:46,452 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:46,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:40:46,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:46,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2018-02-04 19:40:46,484 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 19:40:46,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:46,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:40:46,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:40:46,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:40:46,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:40:46,485 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 10 states. [2018-02-04 19:40:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:46,903 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2018-02-04 19:40:46,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:40:46,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-02-04 19:40:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:46,904 INFO L225 Difference]: With dead ends: 140 [2018-02-04 19:40:46,904 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 19:40:46,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:40:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 19:40:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2018-02-04 19:40:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 19:40:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-02-04 19:40:46,907 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 29 [2018-02-04 19:40:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:46,907 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-02-04 19:40:46,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:40:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-02-04 19:40:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 19:40:46,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:46,908 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] [2018-02-04 19:40:46,908 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1636816271, now seen corresponding path program 1 times [2018-02-04 19:40:46,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:46,908 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:46,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:46,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:46,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:46,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:46,921 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:46,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:46,921 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:46,922 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:46,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:46,949 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 19:40:46,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,954 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 19:40:46,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:40:46,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:46,980 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 19:40:46,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:46,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:46,988 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 19:40:46,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:46,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-02-04 19:40:47,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 19:40:47,028 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 19:40:47,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,044 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 19:40:47,046 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 19:40:47,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,060 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 19:40:47,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:43 [2018-02-04 19:40:47,120 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 19:40:47,125 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:47,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-02-04 19:40:47,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-04 19:40:47,145 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:47,145 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 16 treesize of output 10 [2018-02-04 19:40:47,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:47,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:21 [2018-02-04 19:40:47,215 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 19:40:47,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:47,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:40:47,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:40:47,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:40:47,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:40:47,217 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 12 states. [2018-02-04 19:40:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:47,736 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2018-02-04 19:40:47,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:40:47,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-04 19:40:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:47,737 INFO L225 Difference]: With dead ends: 147 [2018-02-04 19:40:47,737 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 19:40:47,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:40:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 19:40:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 119. [2018-02-04 19:40:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 19:40:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2018-02-04 19:40:47,740 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 29 [2018-02-04 19:40:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:47,741 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2018-02-04 19:40:47,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:40:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2018-02-04 19:40:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:40:47,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:47,742 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:47,742 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:47,742 INFO L82 PathProgramCache]: Analyzing trace with hash -63950084, now seen corresponding path program 1 times [2018-02-04 19:40:47,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:47,742 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:47,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:47,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:47,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:47,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:47,755 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:47,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:47,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:47,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:47,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:47,796 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 19:40:47,798 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 19:40:47,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 19:40:47,814 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 19:40:47,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:47,821 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 19:40:47,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-02-04 19:40:47,834 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 19:40:47,835 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 19:40:47,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:47,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 19:40:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:47,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:47,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:40:47,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:40:47,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:40:47,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:40:47,844 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand 7 states. [2018-02-04 19:40:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:47,979 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2018-02-04 19:40:47,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:40:47,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 19:40:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:47,980 INFO L225 Difference]: With dead ends: 160 [2018-02-04 19:40:47,980 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 19:40:47,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:40:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 19:40:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2018-02-04 19:40:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 19:40:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-02-04 19:40:47,981 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 32 [2018-02-04 19:40:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:47,981 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-02-04 19:40:47,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:40:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-02-04 19:40:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:40:47,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:47,982 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] [2018-02-04 19:40:47,982 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1431534921, now seen corresponding path program 1 times [2018-02-04 19:40:47,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:47,982 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:47,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:47,983 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:47,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:47,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:47,994 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:47,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:47,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:47,995 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:48,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:48,044 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 19:40:48,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-04 19:40:48,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:40:48,070 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 19:40:48,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,085 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 19:40:48,088 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 19:40:48,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,102 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 19:40:48,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-02-04 19:40:48,115 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 19:40:48,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 19:40:48,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,123 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 19:40:48,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 19:40:48,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-02-04 19:40:48,156 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 30 treesize of output 14 [2018-02-04 19:40:48,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,201 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 22 [2018-02-04 19:40:48,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:40:48,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:40:48,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:40:48,224 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:48 [2018-02-04 19:40:48,268 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:40:48,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,280 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 19:40:48,282 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 19:40:48,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 19:40:48,320 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:48,336 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 19:40:48,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:48,351 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 18 treesize of output 17 [2018-02-04 19:40:48,351 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:40:48,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:40:48,373 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:92, output treesize:75 [2018-02-04 19:40:48,479 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 52 treesize of output 48 [2018-02-04 19:40:48,481 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:48,481 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 11 treesize of output 7 [2018-02-04 19:40:48,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2018-02-04 19:40:48,513 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 56 treesize of output 51 [2018-02-04 19:40:48,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,537 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 51 treesize of output 46 [2018-02-04 19:40:48,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,559 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:48,559 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 52 treesize of output 48 [2018-02-04 19:40:48,560 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:48,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-02-04 19:40:48,618 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:109, output treesize:127 [2018-02-04 19:40:48,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-02-04 19:40:48,721 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:48,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:40:48,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,726 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 19:40:48,726 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:48,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:46, output treesize:5 [2018-02-04 19:40:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:48,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:40:48,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 19:40:48,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 19:40:48,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 19:40:48,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:40:48,751 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 16 states. [2018-02-04 19:40:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:50,032 INFO L93 Difference]: Finished difference Result 197 states and 216 transitions. [2018-02-04 19:40:50,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:40:50,033 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-02-04 19:40:50,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:50,033 INFO L225 Difference]: With dead ends: 197 [2018-02-04 19:40:50,033 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 19:40:50,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 19:40:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 19:40:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 142. [2018-02-04 19:40:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 19:40:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-02-04 19:40:50,037 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 32 [2018-02-04 19:40:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:50,037 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-02-04 19:40:50,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 19:40:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-02-04 19:40:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:40:50,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:50,038 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] [2018-02-04 19:40:50,038 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1431534920, now seen corresponding path program 1 times [2018-02-04 19:40:50,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:50,038 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:50,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:50,039 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:50,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:50,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:50,052 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:50,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:50,052 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:50,052 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:50,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:50,081 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 19:40:50,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:40:50,105 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 19:40:50,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:50,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:50,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 19:40:50,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 19:40:50,136 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 19:40:50,137 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 19:40:50,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,150 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 19:40:50,160 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 19:40:50,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,174 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 19:40:50,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-02-04 19:40:50,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:50,232 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 44 treesize of output 45 [2018-02-04 19:40:50,240 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 16 treesize of output 1 [2018-02-04 19:40:50,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:50,267 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 34 treesize of output 39 [2018-02-04 19:40:50,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:40:50,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:50,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:48 [2018-02-04 19:40:50,299 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 34 treesize of output 35 [2018-02-04 19:40:50,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:40:50,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-02-04 19:40:50,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:40:50,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:50,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:66 [2018-02-04 19:40:50,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-02-04 19:40:50,399 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:50,400 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 28 treesize of output 20 [2018-02-04 19:40:50,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,406 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 19:40:50,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-02-04 19:40:50,426 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 19:40:50,426 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,431 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:50,431 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 16 treesize of output 10 [2018-02-04 19:40:50,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:50,443 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:83, output treesize:12 [2018-02-04 19:40:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:50,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:40:50,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 19:40:50,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:40:50,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:40:50,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=153, Unknown=2, NotChecked=0, Total=182 [2018-02-04 19:40:50,471 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 14 states. [2018-02-04 19:40:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:51,283 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2018-02-04 19:40:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:40:51,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-02-04 19:40:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:51,284 INFO L225 Difference]: With dead ends: 205 [2018-02-04 19:40:51,284 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 19:40:51,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=553, Unknown=7, NotChecked=0, Total=702 [2018-02-04 19:40:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 19:40:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 150. [2018-02-04 19:40:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 19:40:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-02-04 19:40:51,286 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 32 [2018-02-04 19:40:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:51,287 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-02-04 19:40:51,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:40:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-02-04 19:40:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 19:40:51,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:51,287 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:51,287 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:51,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2033013693, now seen corresponding path program 1 times [2018-02-04 19:40:51,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:51,287 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:51,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:51,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:51,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:51,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:51,402 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 19:40:51,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:51,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:40:51,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:40:51,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:40:51,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:40:51,403 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 11 states. [2018-02-04 19:40:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:51,635 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2018-02-04 19:40:51,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:40:51,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-04 19:40:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:51,636 INFO L225 Difference]: With dead ends: 188 [2018-02-04 19:40:51,636 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 19:40:51,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:40:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 19:40:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 164. [2018-02-04 19:40:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 19:40:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2018-02-04 19:40:51,638 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 33 [2018-02-04 19:40:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:51,638 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2018-02-04 19:40:51,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:40:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2018-02-04 19:40:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 19:40:51,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:51,638 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:51,638 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1037875369, now seen corresponding path program 1 times [2018-02-04 19:40:51,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:51,639 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:51,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:51,639 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:51,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:51,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:51,679 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 19:40:51,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:51,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:40:51,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:40:51,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:40:51,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:40:51,680 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand 8 states. [2018-02-04 19:40:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:51,855 INFO L93 Difference]: Finished difference Result 199 states and 217 transitions. [2018-02-04 19:40:51,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:40:51,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 19:40:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:51,856 INFO L225 Difference]: With dead ends: 199 [2018-02-04 19:40:51,856 INFO L226 Difference]: Without dead ends: 199 [2018-02-04 19:40:51,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:40:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-04 19:40:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 173. [2018-02-04 19:40:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 19:40:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 195 transitions. [2018-02-04 19:40:51,860 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 195 transitions. Word has length 33 [2018-02-04 19:40:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:51,860 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 195 transitions. [2018-02-04 19:40:51,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:40:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2018-02-04 19:40:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:40:51,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:51,861 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 19:40:51,861 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:51,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2022615628, now seen corresponding path program 1 times [2018-02-04 19:40:51,862 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:51,862 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:51,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:51,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:51,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:51,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:51,871 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:51,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:51,871 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:51,872 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:51,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:51,912 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 19:40:51,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:40:51,940 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 19:40:51,942 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 19:40:51,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,952 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 19:40:51,953 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 19:40:51,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-04 19:40:51,970 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 27 treesize of output 22 [2018-02-04 19:40:51,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:51,974 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 22 treesize of output 14 [2018-02-04 19:40:51,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:51,990 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 27 treesize of output 22 [2018-02-04 19:40:51,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:51,998 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 22 treesize of output 14 [2018-02-04 19:40:51,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2018-02-04 19:40:52,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:52,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:52,011 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 19:40:52,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-02-04 19:40:52,042 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 27 treesize of output 28 [2018-02-04 19:40:52,044 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 16 treesize of output 1 [2018-02-04 19:40:52,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,057 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 27 treesize of output 28 [2018-02-04 19:40:52,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-02-04 19:40:52,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:28 [2018-02-04 19:40:52,077 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 19:40:52,078 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 19:40:52,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,093 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 24 [2018-02-04 19:40:52,095 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 19:40:52,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,107 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 19:40:52,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:59 [2018-02-04 19:40:52,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:52,233 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:52,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-02-04 19:40:52,236 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:52,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2018-02-04 19:40:52,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:52,248 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:52,248 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 19:40:52,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:52,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-02-04 19:40:52,267 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:52,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-02-04 19:40:52,268 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:52,274 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 19:40:52,274 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,277 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:52,282 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:95, output treesize:7 [2018-02-04 19:40:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:52,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:40:52,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 19:40:52,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:40:52,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:40:52,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=145, Unknown=10, NotChecked=0, Total=182 [2018-02-04 19:40:52,315 INFO L87 Difference]: Start difference. First operand 173 states and 195 transitions. Second operand 14 states. [2018-02-04 19:40:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:53,051 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2018-02-04 19:40:53,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:40:53,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-02-04 19:40:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:53,052 INFO L225 Difference]: With dead ends: 216 [2018-02-04 19:40:53,052 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 19:40:53,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=691, Unknown=33, NotChecked=0, Total=870 [2018-02-04 19:40:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 19:40:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2018-02-04 19:40:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 19:40:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 214 transitions. [2018-02-04 19:40:53,055 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 214 transitions. Word has length 35 [2018-02-04 19:40:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:53,055 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 214 transitions. [2018-02-04 19:40:53,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:40:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 214 transitions. [2018-02-04 19:40:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:40:53,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:53,055 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:53,055 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash -258700639, now seen corresponding path program 2 times [2018-02-04 19:40:53,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:53,056 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:53,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:53,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:53,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:53,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:53,067 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:53,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:53,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:53,067 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:40:53,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:40:53,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:40:53,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:53,111 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 19:40:53,112 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 19:40:53,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-02-04 19:40:53,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-02-04 19:40:53,148 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 28 treesize of output 12 [2018-02-04 19:40:53,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 17 [2018-02-04 19:40:53,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:40:53,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:53,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2018-02-04 19:40:53,193 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 35 treesize of output 19 [2018-02-04 19:40:53,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 23 [2018-02-04 19:40:53,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:40:53,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:53,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:53,223 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:63, output treesize:38 [2018-02-04 19:40:53,239 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:40:53,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-02-04 19:40:53,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-02-04 19:40:53,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,272 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:53,273 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 29 treesize of output 22 [2018-02-04 19:40:53,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:53,291 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:53,292 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 33 treesize of output 31 [2018-02-04 19:40:53,293 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:53,293 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 24 treesize of output 14 [2018-02-04 19:40:53,293 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2018-02-04 19:40:53,308 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:53,308 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 41 treesize of output 36 [2018-02-04 19:40:53,308 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,323 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 38 treesize of output 37 [2018-02-04 19:40:53,323 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,332 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:40:53,352 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:93, output treesize:62 [2018-02-04 19:40:53,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:53,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:53,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2018-02-04 19:40:53,495 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 41 [2018-02-04 19:40:53,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 19:40:53,509 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:53,510 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 41 treesize of output 48 [2018-02-04 19:40:53,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,511 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:53,516 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 [2018-02-04 19:40:53,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:40:53,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:40:53,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-02-04 19:40:53,552 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:53,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 19:40:53,553 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,560 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 27 treesize of output 14 [2018-02-04 19:40:53,560 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2018-02-04 19:40: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 23 treesize of output 12 [2018-02-04 19:40:53,568 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,572 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:53,573 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 11 treesize of output 10 [2018-02-04 19:40:53,573 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,576 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:53,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:53,584 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:78, output treesize:15 [2018-02-04 19:40:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:53,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:40:53,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 19:40:53,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:40:53,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:40:53,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=224, Unknown=4, NotChecked=0, Total=272 [2018-02-04 19:40:53,600 INFO L87 Difference]: Start difference. First operand 192 states and 214 transitions. Second operand 17 states. [2018-02-04 19:40:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:54,428 INFO L93 Difference]: Finished difference Result 216 states and 232 transitions. [2018-02-04 19:40:54,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:40:54,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-02-04 19:40:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:54,429 INFO L225 Difference]: With dead ends: 216 [2018-02-04 19:40:54,429 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 19:40:54,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=779, Unknown=17, NotChecked=0, Total=992 [2018-02-04 19:40:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 19:40:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 191. [2018-02-04 19:40:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 19:40:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-02-04 19:40:54,431 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 38 [2018-02-04 19:40:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:54,432 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-02-04 19:40:54,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:40:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-02-04 19:40:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:40:54,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:54,432 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:54,432 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:54,432 INFO L82 PathProgramCache]: Analyzing trace with hash -535982827, now seen corresponding path program 1 times [2018-02-04 19:40:54,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:54,432 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:54,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:54,433 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:40:54,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:54,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:40:54,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:40:54,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:40:54,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:40:54,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:40:54,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:40:54,469 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 5 states. [2018-02-04 19:40:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:54,541 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2018-02-04 19:40:54,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:40:54,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 19:40:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:54,542 INFO L225 Difference]: With dead ends: 214 [2018-02-04 19:40:54,542 INFO L226 Difference]: Without dead ends: 214 [2018-02-04 19:40:54,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 19:40:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-04 19:40:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2018-02-04 19:40:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 19:40:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-02-04 19:40:54,544 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 39 [2018-02-04 19:40:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:54,544 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-02-04 19:40:54,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:40:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-02-04 19:40:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:40:54,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:54,545 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] [2018-02-04 19:40:54,545 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:54,545 INFO L82 PathProgramCache]: Analyzing trace with hash 183551078, now seen corresponding path program 1 times [2018-02-04 19:40:54,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:54,545 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:54,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:54,546 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:54,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:54,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:54,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:54,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:54,606 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:54,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:54,683 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 19:40:54,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:40:54,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,696 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 19:40:54,701 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 19:40:54,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2018-02-04 19:40:54,730 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 19:40:54,731 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 19:40:54,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,736 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 19:40:54,737 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 19:40:54,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:54,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-04 19:40:54,797 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 19:40:54,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:40:54,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:40:54,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:54,810 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 19:40:54,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:40:54,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:40:54,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:54,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:40:54,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:18 [2018-02-04 19:40:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:54,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:40:54,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 21 [2018-02-04 19:40:54,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:40:54,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:40:54,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:40:54,852 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand 21 states. [2018-02-04 19:40:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:55,275 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-02-04 19:40:55,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:40:55,275 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-02-04 19:40:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:55,276 INFO L225 Difference]: With dead ends: 205 [2018-02-04 19:40:55,276 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 19:40:55,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2018-02-04 19:40:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 19:40:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2018-02-04 19:40:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 19:40:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2018-02-04 19:40:55,278 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 41 [2018-02-04 19:40:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:55,278 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2018-02-04 19:40:55,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:40:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2018-02-04 19:40:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:40:55,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:55,278 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 19:40:55,279 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:55,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1660911141, now seen corresponding path program 3 times [2018-02-04 19:40:55,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:55,279 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:55,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:55,279 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:40:55,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:55,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:55,287 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:55,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:55,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:55,288 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:40:55,308 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 19:40:55,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:40:55,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:55,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,350 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 17 treesize of output 24 [2018-02-04 19:40:55,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-02-04 19:40:55,364 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 19:40:55,365 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 19:40:55,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,372 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 19:40:55,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-02-04 19:40:55,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,410 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 44 treesize of output 45 [2018-02-04 19:40:55,416 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 16 treesize of output 1 [2018-02-04 19:40:55,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:29 [2018-02-04 19:40:55,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,434 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 36 treesize of output 37 [2018-02-04 19:40:55,436 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 19:40:55,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2018-02-04 19:40:55,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,461 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 46 [2018-02-04 19:40:55,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:53 [2018-02-04 19:40:55,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-02-04 19:40:55,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-02-04 19:40:55,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,506 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 19:40:55,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:58 [2018-02-04 19:40:55,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:55,557 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 89 treesize of output 89 [2018-02-04 19:40:55,558 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 16 treesize of output 1 [2018-02-04 19:40:55,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,571 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 19:40:55,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:78 [2018-02-04 19:40:55,589 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 0 case distinctions, treesize of input 86 treesize of output 69 [2018-02-04 19:40:55,592 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 16 treesize of output 15 [2018-02-04 19:40:55,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,607 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 19:40:55,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:82 [2018-02-04 19:40:55,668 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 81 treesize of output 55 [2018-02-04 19:40:55,669 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:55,670 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 27 treesize of output 19 [2018-02-04 19:40:55,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-02-04 19:40:55,676 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 19:40:55,680 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 19:40:55,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:55,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:55,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:55,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:92, output treesize:28 [2018-02-04 19:40:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:55,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:40:55,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 19:40:55,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:40:55,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:40:55,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:40:55,752 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand 20 states. [2018-02-04 19:40:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:57,402 INFO L93 Difference]: Finished difference Result 299 states and 323 transitions. [2018-02-04 19:40:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 19:40:57,402 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-02-04 19:40:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:57,403 INFO L225 Difference]: With dead ends: 299 [2018-02-04 19:40:57,403 INFO L226 Difference]: Without dead ends: 299 [2018-02-04 19:40:57,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=1458, Unknown=4, NotChecked=0, Total=1806 [2018-02-04 19:40:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-04 19:40:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 212. [2018-02-04 19:40:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 19:40:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 233 transitions. [2018-02-04 19:40:57,407 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 233 transitions. Word has length 41 [2018-02-04 19:40:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:57,408 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 233 transitions. [2018-02-04 19:40:57,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:40:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 233 transitions. [2018-02-04 19:40:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:40:57,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:57,408 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 19:40:57,408 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1660911142, now seen corresponding path program 2 times [2018-02-04 19:40:57,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:57,409 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:57,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:57,409 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:40:57,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:40:57,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:40:57,422 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:40:57,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:40:57,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:40:57,423 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:40:57,445 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:40:57,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:40:57,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:40:57,456 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 19:40:57,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:40:57,479 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 19:40:57,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,487 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 19:40:57,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 19:40:57,513 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 19:40:57,515 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 19:40:57,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,530 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 19:40:57,532 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 19:40:57,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,546 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 19:40:57,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-02-04 19:40:57,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,589 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 27 treesize of output 32 [2018-02-04 19:40:57,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:40:57,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,610 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 44 treesize of output 45 [2018-02-04 19:40:57,611 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 16 treesize of output 1 [2018-02-04 19:40:57,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:57,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:47 [2018-02-04 19:40:57,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-04 19:40:57,648 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 19:40:57,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,668 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 24 [2018-02-04 19:40:57,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:40:57,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:57,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:65 [2018-02-04 19:40:57,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,705 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 19:40:57,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,762 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-02-04 19:40:57,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:57,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:87 [2018-02-04 19:40:57,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-02-04 19:40:57,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-02-04 19:40:57,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,846 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 30 treesize of output 36 [2018-02-04 19:40:57,848 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 18 treesize of output 11 [2018-02-04 19:40:57,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:57,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:81 [2018-02-04 19:40:57,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,953 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 111 treesize of output 107 [2018-02-04 19:40:57,955 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 16 treesize of output 1 [2018-02-04 19:40:57,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:40:57,988 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 27 treesize of output 36 [2018-02-04 19:40:57,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-04 19:40:57,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:57,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:58,008 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:105 [2018-02-04 19:40:58,035 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 0 case distinctions, treesize of input 135 treesize of output 106 [2018-02-04 19:40:58,038 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 16 treesize of output 15 [2018-02-04 19:40:58,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,069 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 35 treesize of output 36 [2018-02-04 19:40:58,070 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 16 treesize of output 15 [2018-02-04 19:40:58,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:58,087 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:156, output treesize:132 [2018-02-04 19:40:58,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-02-04 19:40:58,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:58,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:135, output treesize:108 [2018-02-04 19:40:58,170 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 96 treesize of output 64 [2018-02-04 19:40:58,172 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 19:40:58,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,180 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 31 treesize of output 23 [2018-02-04 19:40:58,181 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 19:40:58,187 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:58,188 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 25 treesize of output 17 [2018-02-04 19:40:58,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:58,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 19:40:58,205 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:40:58,205 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 11 treesize of output 7 [2018-02-04 19:40:58,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,209 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 19:40:58,209 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:40:58,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:40:58,217 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:122, output treesize:18 [2018-02-04 19:40:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:40:58,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:40:58,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 19:40:58,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:40:58,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:40:58,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=316, Unknown=7, NotChecked=0, Total=380 [2018-02-04 19:40:58,271 INFO L87 Difference]: Start difference. First operand 212 states and 233 transitions. Second operand 20 states. [2018-02-04 19:40:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:40:59,730 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-02-04 19:40:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:40:59,730 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-02-04 19:40:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:40:59,731 INFO L225 Difference]: With dead ends: 280 [2018-02-04 19:40:59,731 INFO L226 Difference]: Without dead ends: 280 [2018-02-04 19:40:59,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1239, Unknown=14, NotChecked=0, Total=1482 [2018-02-04 19:40:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-04 19:40:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 214. [2018-02-04 19:40:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 19:40:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 236 transitions. [2018-02-04 19:40:59,733 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 236 transitions. Word has length 41 [2018-02-04 19:40:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:40:59,733 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 236 transitions. [2018-02-04 19:40:59,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:40:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2018-02-04 19:40:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 19:40:59,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:40:59,734 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:40:59,734 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:40:59,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1395114663, now seen corresponding path program 1 times [2018-02-04 19:40:59,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:40:59,734 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:40:59,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:59,735 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:40:59,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:40:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:40:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:40:59,785 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:40:59,799 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 19:40:59,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:40:59 BoogieIcfgContainer [2018-02-04 19:40:59,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:40:59,813 INFO L168 Benchmark]: Toolchain (without parser) took 16820.90 ms. Allocated memory was 408.9 MB in the beginning and 827.9 MB in the end (delta: 418.9 MB). Free memory was 363.0 MB in the beginning and 786.7 MB in the end (delta: -423.8 MB). Peak memory consumption was 328.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:40:59,814 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 408.9 MB. Free memory is still 369.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:40:59,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.19 ms. Allocated memory is still 408.9 MB. Free memory was 363.0 MB in the beginning and 351.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 19:40:59,814 INFO L168 Benchmark]: Boogie Preprocessor took 26.75 ms. Allocated memory is still 408.9 MB. Free memory was 351.1 MB in the beginning and 349.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-04 19:40:59,815 INFO L168 Benchmark]: RCFGBuilder took 291.81 ms. Allocated memory is still 408.9 MB. Free memory was 349.7 MB in the beginning and 316.5 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:40:59,815 INFO L168 Benchmark]: TraceAbstraction took 16350.48 ms. Allocated memory was 408.9 MB in the beginning and 827.9 MB in the end (delta: 418.9 MB). Free memory was 316.5 MB in the beginning and 786.7 MB in the end (delta: -470.3 MB). Peak memory consumption was 281.8 MB. Max. memory is 5.3 GB. [2018-02-04 19:40:59,816 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.15 ms. Allocated memory is still 408.9 MB. Free memory is still 369.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.19 ms. Allocated memory is still 408.9 MB. Free memory was 363.0 MB in the beginning and 351.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.75 ms. Allocated memory is still 408.9 MB. Free memory was 351.1 MB in the beginning and 349.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 291.81 ms. Allocated memory is still 408.9 MB. Free memory was 349.7 MB in the beginning and 316.5 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 16350.48 ms. Allocated memory was 408.9 MB in the beginning and 827.9 MB in the end (delta: 418.9 MB). Free memory was 316.5 MB in the beginning and 786.7 MB in the end (delta: -470.3 MB). Peak memory consumption was 281.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L988] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={17:0}] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L989] FCALL head->next = ((void*)0) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L990] FCALL head->data = 0 VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L992] SLL* x = head; VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}] [L1015] FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) [L1022] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->next={0:0}] [L1022] SLL* y = x->next; [L1023] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1023] FCALL x->next = malloc(sizeof(SLL)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1024] FCALL x->data = 1 VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1025] FCALL x->next = y VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1029] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1032] EXPR, FCALL x->data VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) [L1050] head = x VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1051] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next [L1052] FCALL free(head) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1048] COND FALSE !(x != ((void*)0)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 43 error locations. UNSAFE Result, 16.3s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1737 SDtfs, 5024 SDslu, 6302 SDs, 0 SdLazy, 9342 SolverSat, 903 SolverUnsat, 116 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 672 GetRequests, 287 SyntacticMatches, 11 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 950 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 663 ConstructedInterpolants, 110 QuantifiedInterpolants, 388348 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1945 ConjunctsInSsa, 442 ConjunctsInUnsatCore, 25 InterpolantComputations, 17 PerfectInterpolantSequences, 20/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-40-59-821.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-40-59-821.csv Received shutdown request...