java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:47:46,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:47:46,494 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:47:46,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:47:46,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:47:46,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:47:46,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:47:46,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:47:46,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:47:46,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:47:46,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:47:46,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:47:46,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:47:46,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:47:46,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:47:46,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:47:46,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:47:46,518 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:47:46,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:47:46,520 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:47:46,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:47:46,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:47:46,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:47:46,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:47:46,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:47:46,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:47:46,524 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:47:46,525 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:47:46,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:47:46,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:47:46,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:47:46,526 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:47:46,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:47:46,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:47:46,536 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:47:46,536 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:47:46,536 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:47:46,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:47:46,537 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:47:46,537 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:47:46,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:47:46,537 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:47:46,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:47:46,538 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:47:46,538 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:47:46,538 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:47:46,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:47:46,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:47:46,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:47:46,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:47:46,539 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:47:46,539 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:47:46,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:47:46,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:47:46,539 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:47:46,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:47:46,540 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:47:46,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:47:46,581 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:47:46,584 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:47:46,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:47:46,585 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:47:46,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-02-02 19:47:46,729 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:47:46,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:47:46,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:47:46,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:47:46,737 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:47:46,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec563bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46, skipping insertion in model container [2018-02-02 19:47:46,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,755 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:47:46,783 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:47:46,874 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:47:46,891 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:47:46,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46 WrapperNode [2018-02-02 19:47:46,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:47:46,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:47:46,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:47:46,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:47:46,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (1/1) ... [2018-02-02 19:47:46,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:47:46,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:47:46,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:47:46,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:47:46,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:47:46,959 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:47:46,959 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:47:46,959 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:47:46,959 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:47:46,959 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:47:46,960 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:47:47,271 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:47:47,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:47:47 BoogieIcfgContainer [2018-02-02 19:47:47,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:47:47,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:47:47,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:47:47,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:47:47,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:47:46" (1/3) ... [2018-02-02 19:47:47,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c96a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:47:47, skipping insertion in model container [2018-02-02 19:47:47,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:47:46" (2/3) ... [2018-02-02 19:47:47,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c96a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:47:47, skipping insertion in model container [2018-02-02 19:47:47,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:47:47" (3/3) ... [2018-02-02 19:47:47,277 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-02-02 19:47:47,284 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:47:47,290 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-02-02 19:47:47,323 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:47:47,323 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:47:47,323 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:47:47,323 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:47:47,323 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:47:47,324 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:47:47,324 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:47:47,324 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:47:47,324 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:47:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-02-02 19:47:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 19:47:47,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:47,346 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:47,346 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash -610536619, now seen corresponding path program 1 times [2018-02-02 19:47:47,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:47,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:47,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:47,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:47,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:47,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:47,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:47,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:47:47,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:47:47,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:47:47,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:47:47,512 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 4 states. [2018-02-02 19:47:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:47,766 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-02-02 19:47:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:47:47,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 19:47:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:47,773 INFO L225 Difference]: With dead ends: 131 [2018-02-02 19:47:47,773 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 19:47:47,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:47:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 19:47:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2018-02-02 19:47:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 19:47:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-02 19:47:47,804 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 8 [2018-02-02 19:47:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:47,804 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-02 19:47:47,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:47:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-02 19:47:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 19:47:47,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:47,805 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:47,805 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash -610536618, now seen corresponding path program 1 times [2018-02-02 19:47:47,805 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:47,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:47,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:47,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:47,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:47,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:47,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:47,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:47:47,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:47:47,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:47:47,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:47:47,862 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 4 states. [2018-02-02 19:47:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:47,944 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-02 19:47:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:47:47,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 19:47:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:47,945 INFO L225 Difference]: With dead ends: 125 [2018-02-02 19:47:47,945 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 19:47:47,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:47:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 19:47:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2018-02-02 19:47:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 19:47:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-02 19:47:47,953 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 8 [2018-02-02 19:47:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:47,954 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-02 19:47:47,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:47:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-02 19:47:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:47:47,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:47,954 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:47,955 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash -631958404, now seen corresponding path program 1 times [2018-02-02 19:47:47,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:47,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:47,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:47,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:47,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:47,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:48,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:48,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:47:48,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:47:48,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:47:48,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:47:48,031 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 4 states. [2018-02-02 19:47:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:48,143 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-02-02 19:47:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:47:48,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 19:47:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:48,144 INFO L225 Difference]: With dead ends: 127 [2018-02-02 19:47:48,144 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 19:47:48,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:47:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 19:47:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-02-02 19:47:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 19:47:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-02-02 19:47:48,148 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 15 [2018-02-02 19:47:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:48,148 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-02-02 19:47:48,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:47:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-02-02 19:47:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:47:48,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:48,149 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:48,149 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:48,149 INFO L82 PathProgramCache]: Analyzing trace with hash -631958403, now seen corresponding path program 1 times [2018-02-02 19:47:48,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:48,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:48,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:48,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:48,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:48,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:48,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:48,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:47:48,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:47:48,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:47:48,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:47:48,229 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 7 states. [2018-02-02 19:47:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:48,420 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-02-02 19:47:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:47:48,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-02 19:47:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:48,421 INFO L225 Difference]: With dead ends: 146 [2018-02-02 19:47:48,422 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 19:47:48,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:47:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 19:47:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 123. [2018-02-02 19:47:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 19:47:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-02-02 19:47:48,428 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 15 [2018-02-02 19:47:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:48,428 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-02-02 19:47:48,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:47:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-02-02 19:47:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 19:47:48,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:48,429 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-02 19:47:48,429 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:48,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1831161057, now seen corresponding path program 1 times [2018-02-02 19:47:48,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:48,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:48,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:48,431 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:48,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:48,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:48,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:48,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:47:48,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:47:48,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:47:48,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:47:48,475 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-02-02 19:47:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:48,697 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2018-02-02 19:47:48,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:47:48,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 19:47:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:48,698 INFO L225 Difference]: With dead ends: 201 [2018-02-02 19:47:48,698 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 19:47:48,698 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-02 19:47:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 19:47:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 122. [2018-02-02 19:47:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 19:47:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-02-02 19:47:48,705 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 18 [2018-02-02 19:47:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:48,705 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-02-02 19:47:48,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:47:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-02-02 19:47:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 19:47:48,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:48,706 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-02 19:47:48,706 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1831161056, now seen corresponding path program 1 times [2018-02-02 19:47:48,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:48,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:48,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:48,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:48,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:48,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:48,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:48,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:47:48,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:47:48,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:47:48,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:47:48,778 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-02-02 19:47:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:48,982 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2018-02-02 19:47:48,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:47:48,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 19:47:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:48,983 INFO L225 Difference]: With dead ends: 203 [2018-02-02 19:47:48,983 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 19:47:48,983 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-02 19:47:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 19:47:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 117. [2018-02-02 19:47:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 19:47:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-02-02 19:47:48,989 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 18 [2018-02-02 19:47:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:48,989 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-02-02 19:47:48,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:47:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-02-02 19:47:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:47:48,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:48,990 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] [2018-02-02 19:47:48,991 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1015590286, now seen corresponding path program 1 times [2018-02-02 19:47:48,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:48,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:48,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:48,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:48,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:49,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:49,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:49,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:47:49,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:47:49,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:47:49,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:47:49,035 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 6 states. [2018-02-02 19:47:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:49,206 INFO L93 Difference]: Finished difference Result 214 states and 234 transitions. [2018-02-02 19:47:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:47:49,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 19:47:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:49,207 INFO L225 Difference]: With dead ends: 214 [2018-02-02 19:47:49,207 INFO L226 Difference]: Without dead ends: 214 [2018-02-02 19:47:49,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:47:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-02 19:47:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 116. [2018-02-02 19:47:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 19:47:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-02-02 19:47:49,211 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 26 [2018-02-02 19:47:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:49,211 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-02-02 19:47:49,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:47:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-02-02 19:47:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:47:49,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:49,212 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] [2018-02-02 19:47:49,212 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1015590287, now seen corresponding path program 1 times [2018-02-02 19:47:49,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:49,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:49,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:49,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:49,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:49,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:49,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:47:49,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:47:49,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:47:49,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:47:49,279 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 6 states. [2018-02-02 19:47:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:49,439 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2018-02-02 19:47:49,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:47:49,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 19:47:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:49,441 INFO L225 Difference]: With dead ends: 205 [2018-02-02 19:47:49,441 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 19:47:49,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:47:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 19:47:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 106. [2018-02-02 19:47:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 19:47:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-02-02 19:47:49,444 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 26 [2018-02-02 19:47:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:49,444 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-02-02 19:47:49,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:47:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-02-02 19:47:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:47:49,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:49,445 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:49,447 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1810127631, now seen corresponding path program 1 times [2018-02-02 19:47:49,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:49,448 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:49,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:49,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:49,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:49,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:49,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:47:49,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:47:49,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:47:49,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:47:49,489 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 5 states. [2018-02-02 19:47:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:49,552 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-02-02 19:47:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:47:49,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-02 19:47:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:49,553 INFO L225 Difference]: With dead ends: 121 [2018-02-02 19:47:49,553 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 19:47:49,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02 19:47:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 19:47:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2018-02-02 19:47:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 19:47:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-02-02 19:47:49,555 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 27 [2018-02-02 19:47:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:49,556 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-02-02 19:47:49,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:47:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-02-02 19:47:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:47:49,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:49,557 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] [2018-02-02 19:47:49,557 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash 292737253, now seen corresponding path program 1 times [2018-02-02 19:47:49,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:49,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:49,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:49,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:49,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:49,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:49,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:47:49,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:47:49,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:47:49,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:47:49,629 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 5 states. [2018-02-02 19:47:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:49,704 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-02 19:47:49,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:47:49,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 19:47:49,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:49,705 INFO L225 Difference]: With dead ends: 114 [2018-02-02 19:47:49,705 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 19:47:49,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:47:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 19:47:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-02-02 19:47:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 19:47:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-02-02 19:47:49,708 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 28 [2018-02-02 19:47:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:49,709 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-02-02 19:47:49,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:47:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-02-02 19:47:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:47:49,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:49,710 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] [2018-02-02 19:47:49,710 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -458774714, now seen corresponding path program 1 times [2018-02-02 19:47:49,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:49,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:49,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:49,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:49,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:49,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:49,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:47:49,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:47:49,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:47:49,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:47:49,796 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 5 states. [2018-02-02 19:47:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:49,906 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-02-02 19:47:49,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:47:49,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 19:47:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:49,915 INFO L225 Difference]: With dead ends: 125 [2018-02-02 19:47:49,915 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 19:47:49,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-02 19:47:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 19:47:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-02-02 19:47:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 19:47:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-02-02 19:47:49,918 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 34 [2018-02-02 19:47:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:49,918 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-02-02 19:47:49,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:47:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-02-02 19:47:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 19:47:49,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:49,919 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:49,919 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash -799027183, now seen corresponding path program 1 times [2018-02-02 19:47:49,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:49,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:49,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,921 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:49,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:49,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:50,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:47:50,058 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:47:50,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:50,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:47:50,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:50,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:50,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:47:50,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-02 19:47:50,208 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-02 19:47:50,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 19:47:50,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,226 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-02 19:47:50,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-02 19:47:50,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:50,290 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-02 19:47:50,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:47:50,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-02 19:47:50,341 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 60 treesize of output 50 [2018-02-02 19:47:50,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:50,348 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 30 treesize of output 18 [2018-02-02 19:47:50,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:47:50,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-02-02 19:47:50,433 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 36 treesize of output 24 [2018-02-02 19:47:50,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 19:47:50,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:47:50,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:50,450 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-02 19:47:50,451 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-02-02 19:47:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:50,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:47:50,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 19:47:50,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:47:50,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:47:50,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:47:50,517 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 22 states. [2018-02-02 19:47:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:51,549 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2018-02-02 19:47:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:47:51,549 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-02-02 19:47:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:51,550 INFO L225 Difference]: With dead ends: 202 [2018-02-02 19:47:51,550 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 19:47:51,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:47:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 19:47:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 140. [2018-02-02 19:47:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 19:47:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-02-02 19:47:51,554 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 45 [2018-02-02 19:47:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:51,554 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-02-02 19:47:51,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:47:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-02-02 19:47:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 19:47:51,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:51,556 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:51,556 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash -799027182, now seen corresponding path program 1 times [2018-02-02 19:47:51,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:51,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:51,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:51,557 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:51,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:51,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:51,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:47:51,771 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:47:51,779 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:51,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:47:51,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:47:51,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:51,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:51,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:47:51,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-02 19:47:51,847 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-02 19:47:51,850 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-02 19:47:51,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,860 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-02 19:47:51,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:47:51,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-02 19:47:51,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:51,944 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-02 19:47:51,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:47:51,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:51,968 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-02 19:47:51,970 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-02 19:47:51,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:51,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-02 19:47:52,019 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 102 treesize of output 92 [2018-02-02 19:47:52,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:52,023 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 30 treesize of output 18 [2018-02-02 19:47:52,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,047 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 50 treesize of output 45 [2018-02-02 19:47:52,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:52,050 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 30 treesize of output 18 [2018-02-02 19:47:52,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,059 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-02 19:47:52,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2018-02-02 19:47:52,145 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 47 treesize of output 33 [2018-02-02 19:47:52,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-02-02 19:47:52,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:47:52,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,173 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 22 treesize of output 20 [2018-02-02 19:47:52,175 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-02 19:47:52,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:47:52,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:52,186 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-02 19:47:52,187 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-02-02 19:47:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:52,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:47:52,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2018-02-02 19:47:52,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:47:52,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:47:52,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:47:52,234 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 18 states. [2018-02-02 19:47:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:52,855 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2018-02-02 19:47:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:47:52,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-02-02 19:47:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:52,856 INFO L225 Difference]: With dead ends: 208 [2018-02-02 19:47:52,856 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 19:47:52,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:47:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 19:47:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 142. [2018-02-02 19:47:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 19:47:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-02-02 19:47:52,860 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 45 [2018-02-02 19:47:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:52,860 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-02-02 19:47:52,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:47:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-02-02 19:47:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 19:47:52,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:52,861 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:52,861 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash -49358637, now seen corresponding path program 1 times [2018-02-02 19:47:52,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:52,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:52,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:52,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:52,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:52,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:53,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:47:53,315 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:47:53,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:53,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:47:53,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:47:53,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:53,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:53,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:47:53,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-02 19:47:53,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-02 19:47:53,398 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-02 19:47:53,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,408 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-02 19:47:53,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:47:53,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-02 19:47:53,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:53,478 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-02 19:47:53,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:47:53,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:53,498 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-02 19:47:53,516 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-02 19:47:53,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-02-02 19:47:53,559 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 21 treesize of output 3 [2018-02-02 19:47:53,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,584 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 114 treesize of output 104 [2018-02-02 19:47:53,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:53,588 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 30 treesize of output 18 [2018-02-02 19:47:53,588 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,608 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 50 treesize of output 45 [2018-02-02 19:47:53,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:53,613 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 30 treesize of output 18 [2018-02-02 19:47:53,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,629 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 21 treesize of output 14 [2018-02-02 19:47:53,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:47:53,630 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,632 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:47:53,640 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2018-02-02 19:47:53,711 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 51 treesize of output 37 [2018-02-02 19:47:53,713 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 32 treesize of output 21 [2018-02-02 19:47:53,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:47:53,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,731 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 22 treesize of output 20 [2018-02-02 19:47:53,733 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-02 19:47:53,733 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:47:53,737 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,740 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:53,745 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-02 19:47:53,745 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-02-02 19:47:53,790 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-02 19:47:53,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 19:47:53,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 19:47:53,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:47:53,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:47:53,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-02-02 19:47:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:53,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:47:53,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2018-02-02 19:47:53,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 19:47:53,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 19:47:53,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=959, Unknown=1, NotChecked=0, Total=1056 [2018-02-02 19:47:53,877 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 33 states. [2018-02-02 19:47:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:55,549 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-02-02 19:47:55,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 19:47:55,549 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-02-02 19:47:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:55,550 INFO L225 Difference]: With dead ends: 206 [2018-02-02 19:47:55,550 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 19:47:55,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=2693, Unknown=2, NotChecked=0, Total=3192 [2018-02-02 19:47:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 19:47:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 139. [2018-02-02 19:47:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 19:47:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2018-02-02 19:47:55,553 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 49 [2018-02-02 19:47:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:55,554 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2018-02-02 19:47:55,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 19:47:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2018-02-02 19:47:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 19:47:55,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:55,555 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:55,555 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash -384702824, now seen corresponding path program 1 times [2018-02-02 19:47:55,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:55,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:55,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:55,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:55,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:55,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:55,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:47:55,749 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:47:55,755 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:55,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:47:55,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:55,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:55,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:47:55,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-02 19:47:55,827 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-02 19:47:55,828 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-02 19:47:55,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,837 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-02 19:47:55,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-02-02 19:47:55,871 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-02 19:47:55,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:47:55,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:24 [2018-02-02 19:47:55,898 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 33 [2018-02-02 19:47:55,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:55,901 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-02 19:47:55,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2018-02-02 19:47:55,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:55,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:55,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:47:55,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-02-02 19:47:55,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-02 19:47:55,943 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 14 treesize of output 7 [2018-02-02 19:47:55,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:55,953 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-02 19:47:55,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-02-02 19:47:56,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:56,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-02-02 19:47:56,037 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 2 case distinctions, treesize of input 48 treesize of output 47 [2018-02-02 19:47:56,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 19:47:56,063 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 49 treesize of output 48 [2018-02-02 19:47:56,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:47:56,089 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 2 xjuncts. [2018-02-02 19:47:56,089 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:81 [2018-02-02 19:47:56,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 76 [2018-02-02 19:47:56,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:56,145 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 83 treesize of output 67 [2018-02-02 19:47:56,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:56,171 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 3 case distinctions, treesize of input 50 treesize of output 70 [2018-02-02 19:47:56,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 19:47:56,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:47:56,205 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 60 treesize of output 50 [2018-02-02 19:47:56,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:56,207 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 30 treesize of output 18 [2018-02-02 19:47:56,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 19:47:56,223 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:149, output treesize:106 [2018-02-02 19:47:56,305 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-02-02 19:47:56,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-02-02 19:47:56,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,321 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 24 treesize of output 19 [2018-02-02 19:47:56,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,329 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 30 treesize of output 21 [2018-02-02 19:47:56,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 19:47:56,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,349 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 36 treesize of output 24 [2018-02-02 19:47:56,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 19:47:56,351 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:47:56,355 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,357 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:56,361 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-02-02 19:47:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:56,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:47:56,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 23 [2018-02-02 19:47:56,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:47:56,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:47:56,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=479, Unknown=1, NotChecked=0, Total=552 [2018-02-02 19:47:56,393 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 24 states. [2018-02-02 19:47:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:57,182 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2018-02-02 19:47:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:47:57,183 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-02-02 19:47:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:57,183 INFO L225 Difference]: With dead ends: 237 [2018-02-02 19:47:57,183 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 19:47:57,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=1521, Unknown=3, NotChecked=0, Total=1806 [2018-02-02 19:47:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 19:47:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 170. [2018-02-02 19:47:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 19:47:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-02-02 19:47:57,187 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 51 [2018-02-02 19:47:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:57,187 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-02-02 19:47:57,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:47:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-02-02 19:47:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 19:47:57,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:57,188 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:57,188 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash -384702823, now seen corresponding path program 1 times [2018-02-02 19:47:57,188 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:57,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:57,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:57,189 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:57,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:57,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:57,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:47:57,452 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:47:57,457 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:57,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:47:57,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:47:57,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:47:57,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-02 19:47:57,515 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-02 19:47:57,516 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-02 19:47:57,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,526 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-02 19:47:57,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-02 19:47:57,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-02-02 19:47:57,592 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-02 19:47:57,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:47:57,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,613 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-02 19:47:57,615 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-02 19:47:57,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2018-02-02 19:47:57,655 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 45 treesize of output 44 [2018-02-02 19:47:57,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,679 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-02 19:47:57,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-02-02 19:47:57,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,722 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 26 treesize of output 37 [2018-02-02 19:47:57,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2018-02-02 19:47:57,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 19 [2018-02-02 19:47:57,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 19:47:57,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-02-02 19:47:57,839 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 46 treesize of output 45 [2018-02-02 19:47:57,843 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-02 19:47:57,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,874 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-02 19:47:57,878 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-02 19:47:57,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:57,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:53 [2018-02-02 19:47:57,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:57,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:58,003 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 81 treesize of output 81 [2018-02-02 19:47:58,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:47:58,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,040 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 19 treesize of output 28 [2018-02-02 19:47:58,042 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-02 19:47:58,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,061 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-02 19:47:58,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:83 [2018-02-02 19:47:58,128 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 175 treesize of output 128 [2018-02-02 19:47:58,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:58,133 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 38 treesize of output 22 [2018-02-02 19:47:58,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,169 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 66 treesize of output 57 [2018-02-02 19:47:58,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:47:58,173 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 38 treesize of output 22 [2018-02-02 19:47:58,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,190 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-02 19:47:58,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:96 [2018-02-02 19:47:58,285 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 59 [2018-02-02 19:47:58,288 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-02-02 19:47:58,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,299 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 29 treesize of output 21 [2018-02-02 19:47:58,300 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-02 19:47:58,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:47:58,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,318 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-02 19:47:58,326 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-02 19:47:58,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:47:58,328 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,333 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-02 19:47:58,333 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,334 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:47:58,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:47:58,339 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:110, output treesize:18 [2018-02-02 19:47:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:47:58,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:47:58,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2018-02-02 19:47:58,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:47:58,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:47:58,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:47:58,425 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 30 states. [2018-02-02 19:47:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:59,768 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2018-02-02 19:47:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:47:59,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 51 [2018-02-02 19:47:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:59,770 INFO L225 Difference]: With dead ends: 291 [2018-02-02 19:47:59,770 INFO L226 Difference]: Without dead ends: 291 [2018-02-02 19:47:59,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=1790, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 19:47:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-02 19:47:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 172. [2018-02-02 19:47:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 19:47:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2018-02-02 19:47:59,776 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 51 [2018-02-02 19:47:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:59,776 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2018-02-02 19:47:59,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:47:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2018-02-02 19:47:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 19:47:59,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:59,777 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:59,777 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash 770888557, now seen corresponding path program 1 times [2018-02-02 19:47:59,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:59,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:59,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:59,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:59,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:59,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:47:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:47:59,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:47:59,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:47:59,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:47:59,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:47:59,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:47:59,831 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand 6 states. [2018-02-02 19:47:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:47:59,942 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-02-02 19:47:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:47:59,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-02-02 19:47:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:47:59,943 INFO L225 Difference]: With dead ends: 142 [2018-02-02 19:47:59,943 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 19:47:59,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:47:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 19:47:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-02-02 19:47:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 19:47:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-02-02 19:47:59,946 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 52 [2018-02-02 19:47:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:47:59,946 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-02-02 19:47:59,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:47:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-02-02 19:47:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 19:47:59,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:47:59,947 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:47:59,947 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:47:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash 619545780, now seen corresponding path program 2 times [2018-02-02 19:47:59,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:47:59,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:47:59,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:59,948 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:47:59,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:47:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:47:59,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:48:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:00,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:48:00,122 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:48:00,127 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:48:00,143 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:48:00,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:48:00,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:48:00,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:00,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:00,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:48:00,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-02-02 19:48:00,201 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-02 19:48:00,202 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-02 19:48:00,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,210 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-02 19:48:00,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:00,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-02-02 19:48:00,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:00,266 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 26 treesize of output 31 [2018-02-02 19:48:00,267 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 15 [2018-02-02 19:48:00,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:00,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-02-02 19:48:00,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 11 [2018-02-02 19:48:00,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:59 [2018-02-02 19:48:00,320 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 116 treesize of output 111 [2018-02-02 19:48:00,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:00,323 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 42 treesize of output 30 [2018-02-02 19:48:00,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,338 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 78 treesize of output 68 [2018-02-02 19:48:00,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:00,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-02-02 19:48:00,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2018-02-02 19:48:00,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:00,474 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:48:00,475 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-02 19:48:00,477 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:48:00,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02 19:48:00,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:48:00,482 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:48:00,483 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 26 [2018-02-02 19:48:00,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,487 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-02 19:48:00,495 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-02 19:48:00,496 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:48:00,497 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 25 treesize of output 17 [2018-02-02 19:48:00,497 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,502 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 7 [2018-02-02 19:48:00,503 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,505 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:00,509 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2018-02-02 19:48:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:00,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:48:00,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2018-02-02 19:48:00,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:48:00,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:48:00,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=776, Unknown=5, NotChecked=0, Total=870 [2018-02-02 19:48:00,579 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 30 states. [2018-02-02 19:48:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:48:01,203 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-02-02 19:48:01,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:48:01,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2018-02-02 19:48:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:48:01,204 INFO L225 Difference]: With dead ends: 151 [2018-02-02 19:48:01,204 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 19:48:01,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=1538, Unknown=5, NotChecked=0, Total=1806 [2018-02-02 19:48:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 19:48:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-02-02 19:48:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 19:48:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-02 19:48:01,207 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-02-02 19:48:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:48:01,207 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-02 19:48:01,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:48:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-02 19:48:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 19:48:01,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:48:01,208 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:48:01,208 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:48:01,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1439411238, now seen corresponding path program 1 times [2018-02-02 19:48:01,208 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:48:01,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:48:01,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:01,209 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:48:01,210 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:48:01,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:48:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:01,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:48:01,418 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:48:01,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:48:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:48:01,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:48:01,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:48:01,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-02-02 19:48:01,470 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-02 19:48:01,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:01,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,480 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-02 19:48:01,481 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-02 19:48:01,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-02-02 19:48:01,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,575 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 26 treesize of output 31 [2018-02-02 19:48:01,576 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 15 [2018-02-02 19:48:01,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-02 19:48:01,595 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 11 [2018-02-02 19:48:01,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-02-02 19:48:01,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,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 70 treesize of output 69 [2018-02-02 19:48:01,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,645 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 26 treesize of output 22 [2018-02-02 19:48:01,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2018-02-02 19:48:01,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,668 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 30 treesize of output 45 [2018-02-02 19:48:01,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,681 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-02-02 19:48:01,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,685 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-02 19:48:01,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-02-02 19:48:01,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,730 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 70 treesize of output 69 [2018-02-02 19:48:01,732 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 18 treesize of output 26 [2018-02-02 19:48:01,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,759 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 52 treesize of output 58 [2018-02-02 19:48:01,761 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 22 treesize of output 30 [2018-02-02 19:48:01,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-02-02 19:48:01,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,857 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 97 treesize of output 97 [2018-02-02 19:48:01,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:01,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,880 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 87 treesize of output 88 [2018-02-02 19:48:01,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:01,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:112 [2018-02-02 19:48:01,936 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 219 treesize of output 164 [2018-02-02 19:48:01,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,939 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 46 treesize of output 26 [2018-02-02 19:48:01,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 128 [2018-02-02 19:48:01,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:01,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 46 treesize of output 26 [2018-02-02 19:48:01,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:01,997 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-02 19:48:01,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:231, output treesize:121 [2018-02-02 19:48:02,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-02-02 19:48:02,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:48:02,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:02,134 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 75 treesize of output 60 [2018-02-02 19:48:02,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:02,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:02,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:48:02,192 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-02-02 19:48:02,278 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-02-02 19:48:02,279 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 22 treesize of output 16 [2018-02-02 19:48:02,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:48:02,287 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-02 19:48:02,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:02,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:48:02,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:02,296 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-02 19:48:02,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:48:02,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-02-02 19:48:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:02,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:48:02,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-02-02 19:48:02,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 19:48:02,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 19:48:02,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 19:48:02,423 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 36 states. [2018-02-02 19:48:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:48:04,303 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-02-02 19:48:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:48:04,303 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 55 [2018-02-02 19:48:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:48:04,304 INFO L225 Difference]: With dead ends: 161 [2018-02-02 19:48:04,304 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 19:48:04,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=2025, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:48:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 19:48:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-02-02 19:48:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 19:48:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-02 19:48:04,313 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-02-02 19:48:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:48:04,313 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-02 19:48:04,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 19:48:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-02 19:48:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 19:48:04,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:48:04,314 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:48:04,314 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:48:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1439411237, now seen corresponding path program 1 times [2018-02-02 19:48:04,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:48:04,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:48:04,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:04,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:48:04,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:48:04,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:48:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:04,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:48:04,602 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:48:04,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:48:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:48:04,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:48:04,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:48:04,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-02-02 19:48:04,656 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-02 19:48:04,657 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-02 19:48:04,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 19:48:04,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:04,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-02-02 19:48:04,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,740 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-02 19:48:04,741 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 11 [2018-02-02 19:48:04,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-02-02 19:48:04,758 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 15 [2018-02-02 19:48:04,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-02-02 19:48:04,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,800 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 70 treesize of output 69 [2018-02-02 19:48:04,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,803 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 26 treesize of output 22 [2018-02-02 19:48:04,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2018-02-02 19:48:04,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,824 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 30 treesize of output 45 [2018-02-02 19:48:04,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-02-02 19:48:04,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:48:04,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-02 19:48:04,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:76 [2018-02-02 19:48:04,891 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:48:04,893 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 52 treesize of output 67 [2018-02-02 19:48:04,895 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 27 treesize of output 30 [2018-02-02 19:48:04,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,912 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 61 treesize of output 60 [2018-02-02 19:48:04,914 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 18 treesize of output 26 [2018-02-02 19:48:04,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:04,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:86 [2018-02-02 19:48:04,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:04,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:05,004 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 102 treesize of output 119 [2018-02-02 19:48:05,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:05,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:05,031 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 91 treesize of output 87 [2018-02-02 19:48:05,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:05,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:101 [2018-02-02 19:48:05,084 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 224 treesize of output 206 [2018-02-02 19:48:05,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:05,089 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 46 treesize of output 26 [2018-02-02 19:48:05,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,120 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 170 treesize of output 127 [2018-02-02 19:48:05,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:05,123 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 46 treesize of output 26 [2018-02-02 19:48:05,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,139 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-02 19:48:05,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:232, output treesize:122 [2018-02-02 19:48:05,316 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-02-02 19:48:05,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-02-02 19:48:05,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:48:05,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,337 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 39 treesize of output 31 [2018-02-02 19:48:05,338 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:48:05,344 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-02 19:48:05,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-02-02 19:48:05,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:48:05,355 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,360 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 11 [2018-02-02 19:48:05,360 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,363 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-02 19:48:05,363 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,364 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:05,368 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-02 19:48:05,368 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:152, output treesize:9 [2018-02-02 19:48:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:05,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:48:05,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-02-02 19:48:05,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 19:48:05,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 19:48:05,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:48:05,409 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 33 states. [2018-02-02 19:48:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:48:06,284 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-02-02 19:48:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:48:06,284 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-02-02 19:48:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:48:06,285 INFO L225 Difference]: With dead ends: 159 [2018-02-02 19:48:06,285 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 19:48:06,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1922, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 19:48:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 19:48:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-02-02 19:48:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 19:48:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-02-02 19:48:06,287 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-02-02 19:48:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:48:06,287 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-02-02 19:48:06,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 19:48:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-02-02 19:48:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 19:48:06,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:48:06,287 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:48:06,287 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:48:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1117992346, now seen corresponding path program 3 times [2018-02-02 19:48:06,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:48:06,288 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:48:06,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:06,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:48:06,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:48:06,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:48:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:06,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:48:06,467 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:48:06,472 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:48:06,504 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 19:48:06,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:48:06,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:48:06,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:48:06,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 19:48:06,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:48:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-02 19:48:06,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 19:48:06,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 19:48:06,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,598 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-02 19:48:06,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-02-02 19:48:06,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,648 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-02 19:48:06,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:06,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-02 19:48:06,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-02-02 19:48:06,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,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 22 treesize of output 14 [2018-02-02 19:48:06,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2018-02-02 19:48:06,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:48:06,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-02-02 19:48:06,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,745 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 34 treesize of output 33 [2018-02-02 19:48:06,747 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 14 treesize of output 7 [2018-02-02 19:48:06,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,757 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-02 19:48:06,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-02-02 19:48:06,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-02-02 19:48:06,844 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 61 treesize of output 60 [2018-02-02 19:48:06,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,875 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 38 treesize of output 43 [2018-02-02 19:48:06,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 19:48:06,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:48:06,907 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 2 xjuncts. [2018-02-02 19:48:06,908 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:87 [2018-02-02 19:48:06,969 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 63 treesize of output 53 [2018-02-02 19:48:06,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:06,981 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 30 treesize of output 18 [2018-02-02 19:48:06,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:06,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:07,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2018-02-02 19:48:07,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:07,057 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 3 case distinctions, treesize of input 61 treesize of output 73 [2018-02-02 19:48:07,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 19:48:07,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:07,096 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 70 treesize of output 54 [2018-02-02 19:48:07,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:07,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:48:07,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 19:48:07,131 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:155, output treesize:115 [2018-02-02 19:48:17,215 WARN L146 SmtUtils]: Spent 10055ms on a formula simplification. DAG size of input: 38 DAG size of output 31 [2018-02-02 19:48:17,302 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 42 treesize of output 30 [2018-02-02 19:48:17,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 19:48:17,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:48:17,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,325 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2018-02-02 19:48:17,328 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 42 treesize of output 38 [2018-02-02 19:48:17,328 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,343 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 30 treesize of output 21 [2018-02-02 19:48:17,343 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,358 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 36 treesize of output 27 [2018-02-02 19:48:17,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,373 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 21 treesize of output 16 [2018-02-02 19:48:17,373 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:17,391 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-02-02 19:48:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:17,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:48:17,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2018-02-02 19:48:17,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 19:48:17,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 19:48:17,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:48:17,421 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 32 states. [2018-02-02 19:48:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:48:18,660 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-02-02 19:48:18,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:48:18,660 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-02-02 19:48:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:48:18,661 INFO L225 Difference]: With dead ends: 194 [2018-02-02 19:48:18,661 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 19:48:18,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=414, Invalid=2342, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 19:48:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 19:48:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-02-02 19:48:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 19:48:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-02-02 19:48:18,663 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-02-02 19:48:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:48:18,663 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-02-02 19:48:18,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 19:48:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-02-02 19:48:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 19:48:18,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:48:18,664 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:48:18,664 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:48:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1117992345, now seen corresponding path program 2 times [2018-02-02 19:48:18,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:48:18,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:48:18,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:18,665 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:48:18,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:48:18,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:48:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:18,884 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:48:18,884 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:48:18,889 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:48:18,907 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:48:18,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:48:18,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:48:18,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:48:18,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:18,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:18,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:48:18,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:18,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:18,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:48:18,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:18,960 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 6 treesize of output 5 [2018-02-02 19:48:18,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:18,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:18,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-02 19:48:19,013 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-02 19:48:19,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:19,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,031 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-02 19:48:19,033 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-02 19:48:19,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-02-02 19:48:19,129 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-02 19:48:19,131 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-02 19:48:19,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-02 19:48:19,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:19,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,193 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2018-02-02 19:48:19,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 48 [2018-02-02 19:48:19,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,231 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 26 treesize of output 37 [2018-02-02 19:48:19,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,250 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 45 treesize of output 44 [2018-02-02 19:48:19,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,253 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-02 19:48:19,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2018-02-02 19:48:19,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 19 [2018-02-02 19:48:19,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 19:48:19,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-02-02 19:48:19,334 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 40 [2018-02-02 19:48:19,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-02-02 19:48:19,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,353 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 46 treesize of output 45 [2018-02-02 19:48:19,355 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-02 19:48:19,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:53 [2018-02-02 19:48:19,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,456 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 28 [2018-02-02 19:48:19,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 16 treesize of output 15 [2018-02-02 19:48:19,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,479 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 96 treesize of output 92 [2018-02-02 19:48:19,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:48:19,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,500 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-02 19:48:19,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:91 [2018-02-02 19:48:19,535 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 66 treesize of output 57 [2018-02-02 19:48:19,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,538 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 38 treesize of output 22 [2018-02-02 19:48:19,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,560 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 132 treesize of output 97 [2018-02-02 19:48:19,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:48:19,565 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 38 treesize of output 22 [2018-02-02 19:48:19,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,581 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-02 19:48:19,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:96 [2018-02-02 19:48:19,646 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 59 [2018-02-02 19:48:19,648 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-02 19:48:19,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:48:19,656 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-02 19:48:19,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:48:19,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,668 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-02 19:48:19,676 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-02 19:48:19,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:48:19,677 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,681 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-02 19:48:19,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:48:19,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:48:19,686 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:110, output treesize:18 [2018-02-02 19:48:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:48:19,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:48:19,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2018-02-02 19:48:19,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:48:19,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:48:19,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:48:19,757 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 31 states. [2018-02-02 19:48:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:48:20,884 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-02-02 19:48:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:48:20,891 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-02-02 19:48:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:48:20,892 INFO L225 Difference]: With dead ends: 200 [2018-02-02 19:48:20,892 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 19:48:20,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=2027, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:48:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 19:48:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-02-02 19:48:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 19:48:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-02-02 19:48:20,894 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-02-02 19:48:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:48:20,894 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-02-02 19:48:20,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:48:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-02-02 19:48:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 19:48:20,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:48:20,895 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:48:20,895 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-02 19:48:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -546616445, now seen corresponding path program 1 times [2018-02-02 19:48:20,895 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:48:20,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:48:20,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:20,896 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:48:20,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:48:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:48:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:48:20,936 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 19:48:20,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:48:20 BoogieIcfgContainer [2018-02-02 19:48:20,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:48:20,978 INFO L168 Benchmark]: Toolchain (without parser) took 34248.35 ms. Allocated memory was 388.0 MB in the beginning and 912.3 MB in the end (delta: 524.3 MB). Free memory was 344.7 MB in the beginning and 723.8 MB in the end (delta: -379.1 MB). Peak memory consumption was 145.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:48:20,979 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 388.0 MB. Free memory is still 350.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:48:20,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.76 ms. Allocated memory is still 388.0 MB. Free memory was 344.7 MB in the beginning and 331.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:48:20,979 INFO L168 Benchmark]: Boogie Preprocessor took 26.95 ms. Allocated memory is still 388.0 MB. Free memory is still 331.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:48:20,979 INFO L168 Benchmark]: RCFGBuilder took 347.62 ms. Allocated memory is still 388.0 MB. Free memory was 328.8 MB in the beginning and 295.8 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:48:20,980 INFO L168 Benchmark]: TraceAbstraction took 33704.88 ms. Allocated memory was 388.0 MB in the beginning and 912.3 MB in the end (delta: 524.3 MB). Free memory was 295.8 MB in the beginning and 723.8 MB in the end (delta: -428.0 MB). Peak memory consumption was 96.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:48:20,981 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 388.0 MB. Free memory is still 350.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 165.76 ms. Allocated memory is still 388.0 MB. Free memory was 344.7 MB in the beginning and 331.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.95 ms. Allocated memory is still 388.0 MB. Free memory is still 331.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 347.62 ms. Allocated memory is still 388.0 MB. Free memory was 328.8 MB in the beginning and 295.8 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33704.88 ms. Allocated memory was 388.0 MB in the beginning and 912.3 MB in the end (delta: 524.3 MB). Free memory was 295.8 MB in the beginning and 723.8 MB in the end (delta: -428.0 MB). Peak memory consumption was 96.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={23:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={23:0}, malloc(sizeof(SLL))={23:0}] [L996] FCALL list->next = ((void*)0) VAL [list={23:0}, malloc(sizeof(SLL))={23:0}] [L997] FCALL list->colour = BLACK VAL [list={23:0}, malloc(sizeof(SLL))={23:0}] [L999] SLL* end = list; VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1006] EXPR, FCALL end->next VAL [end={23:0}, end->next={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1006] end = end->next [L1007] FCALL end->next = ((void*)0) VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1017] EXPR, FCALL end->next VAL [end={24:0}, end->next={21:0}, list={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={21:0}, list={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1019] FCALL end->colour = BLACK VAL [end={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}] [L1027] COND FALSE !(0) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}] [L1028] EXPR, FCALL end->colour VAL [end={23:0}, end->colour=1, list={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}] [L1032] EXPR, FCALL end->colour VAL [end={23:0}, end->colour=1, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={23:0}, end->next={24:0}, list={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}] [L1038] COND FALSE !(!(end->next)) [L1038] COND FALSE !(0) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1039] EXPR, FCALL end->next VAL [end={23:0}, end->next={24:0}, list={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}] [L1032] EXPR, FCALL end->colour VAL [end={24:0}, end->colour=0, list={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR, FCALL end->next VAL [end={24:0}, end->next={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1034] end = end->next [L1035] EXPR, FCALL end->next VAL [end={21:0}, end->next={0:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1035] end = end->next [L1038] FCALL end->next VAL [end={0:0}, list={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={23:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 49 error locations. UNSAFE Result, 33.6s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1498 SDtfs, 5948 SDslu, 8586 SDs, 0 SdLazy, 13646 SolverSat, 1024 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 942 GetRequests, 403 SyntacticMatches, 43 SemanticMatches, 496 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4706 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=16, 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, 22 MinimizatonAttempts, 1025 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 1369 NumberOfCodeBlocks, 1369 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1279 ConstructedInterpolants, 236 QuantifiedInterpolants, 1777816 SizeOfPredicates, 167 NumberOfNonLiveVariables, 1990 ConjunctsInSsa, 477 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 19/216 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-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-48-20-986.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-48-20-986.csv Received shutdown request...