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-ccafca9-m [2018-02-04 01:37:30,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:37:30,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:37:30,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:37:30,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:37:30,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:37:30,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:37:30,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:37:30,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:37:30,750 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:37:30,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:37:30,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:37:30,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:37:30,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:37:30,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:37:30,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:37:30,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:37:30,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:37:30,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:37:30,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:37:30,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:37:30,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:37:30,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:37:30,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:37:30,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:37:30,766 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:37:30,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:37:30,767 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:37:30,767 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:37:30,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:37:30,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:37:30,768 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 01:37:30,776 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:37:30,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:37:30,777 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:37:30,777 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:37:30,777 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:37:30,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:37:30,778 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:37:30,778 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:37:30,778 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:37:30,778 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:37:30,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:37:30,779 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:37:30,779 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:37:30,779 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:37:30,779 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:37:30,779 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:37:30,779 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:37:30,779 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:37:30,780 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:37:30,780 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:37:30,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:37:30,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:37:30,780 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 01:37:30,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 01:37:30,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 01:37:30,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:37:30,815 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:37:30,817 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:37:30,818 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:37:30,819 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:37:30,819 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-04 01:37:30,950 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:37:30,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:37:30,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:37:30,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:37:30,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:37:30,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:37:30" (1/1) ... [2018-02-04 01:37:30,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca510de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:30, skipping insertion in model container [2018-02-04 01:37:30,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:37:30" (1/1) ... [2018-02-04 01:37:30,977 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:37:31,020 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:37:31,110 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:37:31,123 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:37:31,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31 WrapperNode [2018-02-04 01:37:31,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:37:31,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:37:31,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:37:31,132 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:37:31,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (1/1) ... [2018-02-04 01:37:31,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (1/1) ... [2018-02-04 01:37:31,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (1/1) ... [2018-02-04 01:37:31,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (1/1) ... [2018-02-04 01:37:31,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (1/1) ... [2018-02-04 01:37:31,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (1/1) ... [2018-02-04 01:37:31,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (1/1) ... [2018-02-04 01:37:31,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:37:31,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:37:31,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:37:31,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:37:31,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:37:31,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:37:31,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:37:31,200 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:37:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:37:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:37:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 01:37:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 01:37:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:37:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:37:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:37:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 01:37:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 01:37:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:37:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 01:37:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:37:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:37:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:37:31,498 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:37:31,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:37:31 BoogieIcfgContainer [2018-02-04 01:37:31,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:37:31,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:37:31,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:37:31,501 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:37:31,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:37:30" (1/3) ... [2018-02-04 01:37:31,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b54c018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:37:31, skipping insertion in model container [2018-02-04 01:37:31,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:31" (2/3) ... [2018-02-04 01:37:31,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b54c018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:37:31, skipping insertion in model container [2018-02-04 01:37:31,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:37:31" (3/3) ... [2018-02-04 01:37:31,503 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-02-04 01:37:31,509 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:37:31,516 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-02-04 01:37:31,545 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:37:31,545 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:37:31,545 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 01:37:31,545 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 01:37:31,545 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:37:31,545 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:37:31,545 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:37:31,546 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:37:31,546 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:37:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-02-04 01:37:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:37:31,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:31,567 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:31,567 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-04 01:37:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash -610536619, now seen corresponding path program 1 times [2018-02-04 01:37:31,572 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:31,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:31,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:31,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:31,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:31,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:31,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:31,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:37:31,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:37:31,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:37:31,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:37:31,698 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 4 states. [2018-02-04 01:37:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:31,933 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-02-04 01:37:31,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:37:31,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 01:37:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:31,944 INFO L225 Difference]: With dead ends: 131 [2018-02-04 01:37:31,944 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 01:37:31,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-04 01:37:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 01:37:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2018-02-04 01:37:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 01:37:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-04 01:37:31,984 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 8 [2018-02-04 01:37:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:31,984 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-04 01:37:31,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:37:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-04 01:37:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:37:31,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:31,985 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:31,985 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-04 01:37:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash -610536618, now seen corresponding path program 1 times [2018-02-04 01:37:31,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:31,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:31,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:31,988 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:31,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:32,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:32,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:32,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:37:32,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:37:32,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:37:32,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:37:32,067 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 4 states. [2018-02-04 01:37:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:32,169 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 01:37:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:37:32,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 01:37:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:32,171 INFO L225 Difference]: With dead ends: 125 [2018-02-04 01:37:32,171 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 01:37:32,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 01:37:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2018-02-04 01:37:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 01:37:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-04 01:37:32,183 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 8 [2018-02-04 01:37:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:32,183 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-04 01:37:32,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:37:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-04 01:37:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 01:37:32,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:32,184 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:32,184 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-04 01:37:32,184 INFO L82 PathProgramCache]: Analyzing trace with hash -631958404, now seen corresponding path program 1 times [2018-02-04 01:37:32,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:32,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:32,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:32,186 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:32,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:32,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:32,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:32,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:37:32,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:37:32,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:37:32,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:37:32,250 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 4 states. [2018-02-04 01:37:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:32,370 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-02-04 01:37:32,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:37:32,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 01:37:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:32,371 INFO L225 Difference]: With dead ends: 127 [2018-02-04 01:37:32,371 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 01:37:32,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 01:37:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-02-04 01:37:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 01:37:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-02-04 01:37:32,377 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 15 [2018-02-04 01:37:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:32,377 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-02-04 01:37:32,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:37:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-02-04 01:37:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 01:37:32,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:32,378 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:32,378 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-04 01:37:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash -631958403, now seen corresponding path program 1 times [2018-02-04 01:37:32,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:32,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:32,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:32,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:32,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:32,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:32,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:32,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:37:32,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:37:32,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:37:32,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:37:32,463 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 7 states. [2018-02-04 01:37:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:32,681 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-02-04 01:37:32,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:32,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 01:37:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:32,683 INFO L225 Difference]: With dead ends: 146 [2018-02-04 01:37:32,683 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 01:37:32,683 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-04 01:37:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 01:37:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 123. [2018-02-04 01:37:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 01:37:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-02-04 01:37:32,690 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 15 [2018-02-04 01:37:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:32,690 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-02-04 01:37:32,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:37:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-02-04 01:37:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:37:32,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:32,691 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:32,691 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-04 01:37:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1831161057, now seen corresponding path program 1 times [2018-02-04 01:37:32,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:32,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:32,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:32,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:32,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:32,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:32,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:32,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:32,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:37:32,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:37:32,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:37:32,751 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-02-04 01:37:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:32,941 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2018-02-04 01:37:32,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:37:32,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 01:37:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:32,943 INFO L225 Difference]: With dead ends: 201 [2018-02-04 01:37:32,943 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 01:37:32,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:37:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 01:37:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 122. [2018-02-04 01:37:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 01:37:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-02-04 01:37:32,950 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 18 [2018-02-04 01:37:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:32,950 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-02-04 01:37:32,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:37:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-02-04 01:37:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:37:32,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:32,951 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:32,951 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-04 01:37:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1831161056, now seen corresponding path program 1 times [2018-02-04 01:37:32,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:32,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:32,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:32,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:32,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:32,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:33,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:33,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:33,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:37:33,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:37:33,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:37:33,093 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-02-04 01:37:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:33,278 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2018-02-04 01:37:33,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:37:33,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 01:37:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:33,279 INFO L225 Difference]: With dead ends: 203 [2018-02-04 01:37:33,280 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 01:37:33,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:37:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 01:37:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 117. [2018-02-04 01:37:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 01:37:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-02-04 01:37:33,283 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 18 [2018-02-04 01:37:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:33,283 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-02-04 01:37:33,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:37:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-02-04 01:37:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:37:33,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:33,284 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-04 01:37:33,285 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-04 01:37:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1015590286, now seen corresponding path program 1 times [2018-02-04 01:37:33,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:33,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:33,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:33,286 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:33,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:33,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:33,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:33,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:33,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:37:33,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:37:33,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:37:33,335 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 6 states. [2018-02-04 01:37:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:33,491 INFO L93 Difference]: Finished difference Result 214 states and 234 transitions. [2018-02-04 01:37:33,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:37:33,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 01:37:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:33,492 INFO L225 Difference]: With dead ends: 214 [2018-02-04 01:37:33,493 INFO L226 Difference]: Without dead ends: 214 [2018-02-04 01:37:33,493 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-04 01:37:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-04 01:37:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 116. [2018-02-04 01:37:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 01:37:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-02-04 01:37:33,497 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 26 [2018-02-04 01:37:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:33,497 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-02-04 01:37:33,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:37:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-02-04 01:37:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:37:33,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:33,497 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-04 01:37:33,497 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-04 01:37:33,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1015590287, now seen corresponding path program 1 times [2018-02-04 01:37:33,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:33,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:33,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:33,499 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:33,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:33,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:33,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:33,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:33,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:37:33,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:37:33,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:37:33,566 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 6 states. [2018-02-04 01:37:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:33,767 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2018-02-04 01:37:33,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:33,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 01:37:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:33,769 INFO L225 Difference]: With dead ends: 205 [2018-02-04 01:37:33,769 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 01:37:33,769 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-04 01:37:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 01:37:33,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 106. [2018-02-04 01:37:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 01:37:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-02-04 01:37:33,774 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 26 [2018-02-04 01:37:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:33,774 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-02-04 01:37:33,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:37:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-02-04 01:37:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:37:33,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:33,775 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-04 01:37:33,779 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-04 01:37:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1810127631, now seen corresponding path program 1 times [2018-02-04 01:37:33,779 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:33,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:33,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:33,781 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:33,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:33,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:33,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:33,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:33,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:33,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:33,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:33,815 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 5 states. [2018-02-04 01:37:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:33,894 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-02-04 01:37:33,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:37:33,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-04 01:37:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:33,895 INFO L225 Difference]: With dead ends: 121 [2018-02-04 01:37:33,895 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 01:37:33,896 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-04 01:37:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 01:37:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2018-02-04 01:37:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 01:37:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-02-04 01:37:33,899 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 27 [2018-02-04 01:37:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:33,899 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-02-04 01:37:33,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-02-04 01:37:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:37:33,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:33,900 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-04 01:37:33,900 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-04 01:37:33,900 INFO L82 PathProgramCache]: Analyzing trace with hash 292737253, now seen corresponding path program 1 times [2018-02-04 01:37:33,900 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:33,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:33,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:33,901 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:33,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:33,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:33,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:33,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:33,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:33,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:33,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:33,974 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 5 states. [2018-02-04 01:37:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:34,066 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-04 01:37:34,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:37:34,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 01:37:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:34,067 INFO L225 Difference]: With dead ends: 114 [2018-02-04 01:37:34,067 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 01:37:34,068 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-04 01:37:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 01:37:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-02-04 01:37:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 01:37:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-02-04 01:37:34,072 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 28 [2018-02-04 01:37:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:34,072 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-02-04 01:37:34,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-02-04 01:37:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 01:37:34,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:34,073 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-04 01:37:34,074 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-04 01:37:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash -458774714, now seen corresponding path program 1 times [2018-02-04 01:37:34,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:34,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:34,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:34,075 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:34,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:34,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:34,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:34,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:34,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:34,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:34,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:34,166 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 5 states. [2018-02-04 01:37:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:34,273 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-02-04 01:37:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:34,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 01:37:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:34,281 INFO L225 Difference]: With dead ends: 125 [2018-02-04 01:37:34,281 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 01:37:34,282 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-04 01:37:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 01:37:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-02-04 01:37:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 01:37:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-02-04 01:37:34,285 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 34 [2018-02-04 01:37:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:34,285 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-02-04 01:37:34,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-02-04 01:37:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 01:37:34,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:34,286 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-04 01:37:34,286 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-04 01:37:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash -799027183, now seen corresponding path program 1 times [2018-02-04 01:37:34,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:34,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:34,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:34,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:34,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:34,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:34,436 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-04 01:37:34,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:34,437 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:37:34,446 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:34,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:34,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:34,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:34,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 01:37:34,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-04 01:37:34,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:34,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:34,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 01:37:34,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:34,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 01:37:34,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:34,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 01:37:34,732 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-04 01:37:34,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:34,738 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-04 01:37:34,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:34,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-02-04 01:37:34,849 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-04 01:37:34,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 01:37:34,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:34,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:34,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:34,868 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-02-04 01:37:34,916 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-04 01:37:34,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:34,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 01:37:34,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 01:37:34,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 01:37:34,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:37:34,938 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 22 states. [2018-02-04 01:37:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:35,714 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2018-02-04 01:37:35,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:37:35,715 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-02-04 01:37:35,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:35,716 INFO L225 Difference]: With dead ends: 202 [2018-02-04 01:37:35,716 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 01:37:35,716 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-04 01:37:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 01:37:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 140. [2018-02-04 01:37:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 01:37:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-02-04 01:37:35,720 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 45 [2018-02-04 01:37:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:35,720 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-02-04 01:37:35,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 01:37:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-02-04 01:37:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 01:37:35,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:35,722 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-04 01:37:35,722 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-04 01:37:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash -799027182, now seen corresponding path program 1 times [2018-02-04 01:37:35,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:35,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:35,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:35,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:35,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:35,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:35,917 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-04 01:37:35,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:35,918 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:37:35,926 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:35,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:35,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:37:35,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:35,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:35,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:35,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:37:35,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:35,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:35,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 01:37:36,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:36,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:36,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:36,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:36,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-04 01:37:36,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:36,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 01:37:36,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:36,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:36,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-02-04 01:37:36,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 01:37:36,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-04 01:37:36,188 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-04 01:37:36,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:36,194 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-04 01:37:36,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,226 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-04 01:37:36,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:36,233 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-04 01:37:36,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:36,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2018-02-04 01:37:36,321 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-04 01:37:36,323 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-04 01:37:36,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:36,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,348 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-04 01:37:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 01:37:36,350 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,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-04 01:37:36,355 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:36,360 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-02-04 01:37:36,379 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-04 01:37:36,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:36,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2018-02-04 01:37:36,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:37:36,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:37:36,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:37:36,400 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 18 states. [2018-02-04 01:37:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:37,116 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2018-02-04 01:37:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:37:37,116 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-02-04 01:37:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:37,117 INFO L225 Difference]: With dead ends: 208 [2018-02-04 01:37:37,117 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 01:37:37,117 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-04 01:37:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 01:37:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 142. [2018-02-04 01:37:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 01:37:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-02-04 01:37:37,121 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 45 [2018-02-04 01:37:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:37,122 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-02-04 01:37:37,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:37:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-02-04 01:37:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 01:37:37,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:37,123 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-04 01:37:37,123 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-04 01:37:37,123 INFO L82 PathProgramCache]: Analyzing trace with hash -49358637, now seen corresponding path program 1 times [2018-02-04 01:37:37,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:37,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:37,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:37,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:37,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:37,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:37,590 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-04 01:37:37,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:37,590 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:37:37,595 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:37,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:37,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:37:37,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:37,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:37,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:37:37,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 01:37:37,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:37,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:37,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:37,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:37,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-04 01:37:37,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:37,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 01:37:37,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:37,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:37,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-02-04 01:37:37,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 01:37:37,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-02-04 01:37:37,849 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-04 01:37:37,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,868 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-04 01:37:37,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:37,872 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-04 01:37:37,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,892 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-04 01:37:37,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:37,896 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-04 01:37:37,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,901 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,912 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-04 01:37:37,914 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-04 01:37:37,914 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,916 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:37,926 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-04 01:37:37,926 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2018-02-04 01:37:38,023 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-04 01:37:38,025 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-04 01:37:38,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:38,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:38,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:38,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:38,045 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-04 01:37:38,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 01:37:38,048 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:38,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:38,052 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:38,053 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:38,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:38,057 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-02-04 01:37:38,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 01:37:38,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04 01:37:38,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:37:38,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:37:38,117 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-04 01:37:38,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-02-04 01:37:38,166 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-04 01:37:38,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:38,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2018-02-04 01:37:38,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 01:37:38,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 01:37:38,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=959, Unknown=1, NotChecked=0, Total=1056 [2018-02-04 01:37:38,185 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 33 states. [2018-02-04 01:37:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:39,914 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-02-04 01:37:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 01:37:39,914 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-02-04 01:37:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:39,915 INFO L225 Difference]: With dead ends: 206 [2018-02-04 01:37:39,915 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 01:37:39,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=497, Invalid=2693, Unknown=2, NotChecked=0, Total=3192 [2018-02-04 01:37:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 01:37:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 139. [2018-02-04 01:37:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 01:37:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2018-02-04 01:37:39,920 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 49 [2018-02-04 01:37:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:39,920 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2018-02-04 01:37:39,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 01:37:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2018-02-04 01:37:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 01:37:39,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:39,921 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-04 01:37:39,921 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-04 01:37:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash -384702824, now seen corresponding path program 1 times [2018-02-04 01:37:39,921 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:39,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:39,922 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:39,922 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:39,922 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:39,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:40,083 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-04 01:37:40,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:40,083 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:37:40,088 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:40,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:40,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:37:40,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 01:37:40,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:40,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:40,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-02-04 01:37:40,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 01:37:40,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:40,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:24 [2018-02-04 01:37:40,185 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-04 01:37:40,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 01:37:40,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2018-02-04 01:37:40,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,202 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-04 01:37:40,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-02-04 01:37:40,220 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-04 01:37:40,227 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-04 01:37:40,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-02-04 01:37:40,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,285 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-04 01:37:40,296 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-04 01:37:40,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:37:40,328 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-04 01:37:40,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:37:40,351 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-04 01:37:40,351 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:81 [2018-02-04 01:37:40,396 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-04 01:37:40,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,401 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-04 01:37:40,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,432 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-04 01:37:40,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 01:37:40,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:37:40,466 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-04 01:37:40,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:40,469 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-04 01:37:40,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,472 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,483 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-04 01:37:40,483 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:149, output treesize:106 [2018-02-04 01:37:40,561 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-04 01:37:40,563 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-04 01:37:40,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-02-04 01:37:40,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,581 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-04 01:37:40,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 01:37:40,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,604 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-04 01:37:40,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 01:37:40,605 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:40,608 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:40,614 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-04 01:37:40,614 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-02-04 01:37:40,622 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-04 01:37:40,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:40,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 23 [2018-02-04 01:37:40,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 01:37:40,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 01:37:40,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=479, Unknown=1, NotChecked=0, Total=552 [2018-02-04 01:37:40,640 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 24 states. [2018-02-04 01:37:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:41,510 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2018-02-04 01:37:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 01:37:41,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-02-04 01:37:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:41,511 INFO L225 Difference]: With dead ends: 237 [2018-02-04 01:37:41,511 INFO L226 Difference]: Without dead ends: 237 [2018-02-04 01:37:41,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1521, Unknown=3, NotChecked=0, Total=1806 [2018-02-04 01:37:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-04 01:37:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 170. [2018-02-04 01:37:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 01:37:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-02-04 01:37:41,514 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 51 [2018-02-04 01:37:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:41,514 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-02-04 01:37:41,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 01:37:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-02-04 01:37:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 01:37:41,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:41,514 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-04 01:37:41,514 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-04 01:37:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash -384702823, now seen corresponding path program 1 times [2018-02-04 01:37:41,515 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:41,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:41,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:41,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:41,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:41,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:41,832 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-04 01:37:41,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:41,832 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:37:41,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:41,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:41,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:37:41,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:41,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:41,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 01:37:41,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 01:37:41,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:41,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:41,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:41,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:41,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-02-04 01:37:41,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 01:37:41,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:41,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:41,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-02-04 01:37:42,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 01:37:42,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2018-02-04 01:37:42,045 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-04 01:37:42,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 01:37:42,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,073 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-04 01:37:42,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,077 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-04 01:37:42,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2018-02-04 01:37:42,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,093 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-04 01:37:42,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 01:37:42,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-02-04 01:37:42,159 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-04 01:37:42,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-02-04 01:37:42,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-02-04 01:37:42,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-02-04 01:37:42,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:53 [2018-02-04 01:37:42,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,325 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-04 01:37:42,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:42,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,369 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-04 01:37:42,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 01:37:42,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:42,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:83 [2018-02-04 01:37:42,434 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-04 01:37:42,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,440 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-04 01:37:42,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,466 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-04 01:37:42,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:42,469 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-04 01:37:42,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:42,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:96 [2018-02-04 01:37:42,595 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-04 01:37:42,597 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-04 01:37:42,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,605 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-04 01:37:42,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:42,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:42,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:42,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 01:37:42,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:42,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 01:37:42,657 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,658 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:42,664 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-04 01:37:42,664 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:110, output treesize:18 [2018-02-04 01:37:42,732 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-04 01:37:42,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:42,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2018-02-04 01:37:42,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 01:37:42,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 01:37:42,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:37:42,750 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 30 states. [2018-02-04 01:37:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:44,261 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2018-02-04 01:37:44,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 01:37:44,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 51 [2018-02-04 01:37:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:44,264 INFO L225 Difference]: With dead ends: 291 [2018-02-04 01:37:44,264 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 01:37:44,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=280, Invalid=1790, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 01:37:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 01:37:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 172. [2018-02-04 01:37:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 01:37:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2018-02-04 01:37:44,269 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 51 [2018-02-04 01:37:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:44,270 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2018-02-04 01:37:44,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 01:37:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2018-02-04 01:37:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 01:37:44,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:44,270 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-04 01:37:44,270 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-04 01:37:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash 770888557, now seen corresponding path program 1 times [2018-02-04 01:37:44,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:44,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:44,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:44,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:44,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:44,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:44,348 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-04 01:37:44,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:44,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:37:44,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:37:44,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:37:44,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:37:44,348 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand 6 states. [2018-02-04 01:37:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:44,445 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-02-04 01:37:44,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:37:44,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-02-04 01:37:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:44,446 INFO L225 Difference]: With dead ends: 142 [2018-02-04 01:37:44,446 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 01:37:44,446 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-04 01:37:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 01:37:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-02-04 01:37:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 01:37:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-02-04 01:37:44,448 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 52 [2018-02-04 01:37:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:44,449 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-02-04 01:37:44,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:37:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-02-04 01:37:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 01:37:44,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:44,449 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-04 01:37:44,449 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-04 01:37:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash 619545780, now seen corresponding path program 2 times [2018-02-04 01:37:44,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:44,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:44,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:44,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:44,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:44,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:44,638 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-04 01:37:44,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:44,638 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:37:44,649 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 01:37:44,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 01:37:44,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 01:37:44,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:44,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:37:44,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:44,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:44,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:37:44,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 01:37:44,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:44,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:44,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:44,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:44,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-02-04 01:37:44,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:44,819 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-04 01:37:44,820 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-04 01:37:44,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:44,843 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-04 01:37:44,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 8 treesize of output 11 [2018-02-04 01:37:44,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:68 [2018-02-04 01:37:44,889 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-04 01:37:44,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:44,892 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-04 01:37:44,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,911 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 87 treesize of output 77 [2018-02-04 01:37:44,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:44,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, 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-04 01:37:44,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:44,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:136, output treesize:58 [2018-02-04 01:37:45,068 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:37:45,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-02-04 01:37:45,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:45,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:45,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:56 [2018-02-04 01:37:45,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-02-04 01:37:45,143 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:37:45,144 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 15 treesize of output 22 [2018-02-04 01:37:45,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:45,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-02-04 01:37:45,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:45,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:45,160 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 33 treesize of output 27 [2018-02-04 01:37:45,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-02-04 01:37:45,161 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:45,165 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:37:45,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 01:37:45,165 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:45,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:45,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:45,172 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:10 [2018-02-04 01:37:45,220 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-04 01:37:45,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:45,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 32 [2018-02-04 01:37:45,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 01:37:45,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 01:37:45,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2018-02-04 01:37:45,244 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 32 states. [2018-02-04 01:37:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:46,105 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-02-04 01:37:46,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:37:46,105 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-02-04 01:37:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:46,105 INFO L225 Difference]: With dead ends: 151 [2018-02-04 01:37:46,105 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 01:37:46,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=1780, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 01:37:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 01:37:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-02-04 01:37:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 01:37:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-04 01:37:46,107 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-02-04 01:37:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:46,107 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-04 01:37:46,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 01:37:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-04 01:37:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 01:37:46,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:46,108 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-04 01:37:46,108 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-04 01:37:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1439411238, now seen corresponding path program 1 times [2018-02-04 01:37:46,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:46,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:46,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:46,109 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 01:37:46,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:46,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:46,313 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-04 01:37:46,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:46,313 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:37:46,318 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:46,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:46,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 01:37:46,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-02-04 01:37:46,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:46,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:46,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:46,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-02-04 01:37:46,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,480 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-04 01:37:46,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 12 treesize of output 15 [2018-02-04 01:37:46,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,496 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-04 01:37:46,498 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-04 01:37:46,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-02-04 01:37:46,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,540 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-04 01:37:46,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,543 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-04 01:37:46,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,562 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-04 01:37:46,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,569 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-04 01:37:46,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-02-04 01:37:46,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-02-04 01:37:46,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-02-04 01:37:46,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,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, 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-04 01:37:46,658 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-04 01:37:46,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,685 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-04 01:37:46,687 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-04 01:37:46,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-02-04 01:37:46,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,795 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-04 01:37:46,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:46,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,829 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-04 01:37:46,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:46,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:112 [2018-02-04 01:37:46,905 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-04 01:37:46,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,910 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-04 01:37:46,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,950 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-04 01:37:46,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:46,954 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-04 01:37:46,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:46,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:46,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:231, output treesize:121 [2018-02-04 01:37:47,112 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-04 01:37:47,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:47,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:47,139 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-04 01:37:47,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:47,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:47,156 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-04 01:37:47,156 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-02-04 01:37:47,236 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-04 01:37:47,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:47,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:47,248 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-04 01:37:47,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:47,257 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-04 01:37:47,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:47,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:47,268 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-04 01:37:47,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-02-04 01:37:47,371 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-04 01:37:47,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:47,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-02-04 01:37:47,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 01:37:47,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 01:37:47,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 01:37:47,389 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 36 states. [2018-02-04 01:37:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:48,902 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-02-04 01:37:48,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 01:37:48,902 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 55 [2018-02-04 01:37:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:48,903 INFO L225 Difference]: With dead ends: 161 [2018-02-04 01:37:48,903 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 01:37:48,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=327, Invalid=2025, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 01:37:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 01:37:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-02-04 01:37:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 01:37:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 01:37:48,905 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-02-04 01:37:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:48,906 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 01:37:48,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 01:37:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 01:37:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 01:37:48,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:48,906 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-04 01:37:48,906 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-04 01:37:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1439411237, now seen corresponding path program 1 times [2018-02-04 01:37:48,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:48,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:48,907 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:48,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:48,907 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:48,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:49,201 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-04 01:37:49,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:49,201 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 01:37:49,207 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:49,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:49,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 01:37:49,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-02-04 01:37:49,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:49,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:49,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:49,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:49,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-02-04 01:37:49,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 01:37:49,347 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-04 01:37:49,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,364 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-04 01:37:49,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 01:37:49,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-02-04 01:37:49,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,408 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-04 01:37:49,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,411 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-04 01:37:49,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,434 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-04 01:37:49,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,438 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-04 01:37:49,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-02-04 01:37:49,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 01:37:49,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:37:49,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:76 [2018-02-04 01:37:49,506 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:37:49,508 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-04 01:37:49,510 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-04 01:37:49,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,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 61 treesize of output 60 [2018-02-04 01:37:49,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, 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-04 01:37:49,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:86 [2018-02-04 01:37:49,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,638 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-04 01:37:49,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:49,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,668 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-04 01:37:49,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:49,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:101 [2018-02-04 01:37:49,738 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-04 01:37:49,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,741 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-04 01:37:49,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,774 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-04 01:37:49,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:49,778 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-04 01:37:49,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:49,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:232, output treesize:122 [2018-02-04 01:37:49,948 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-04 01:37:49,950 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-04 01:37:49,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,959 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-04 01:37:49,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:49,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:49,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:49,985 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-04 01:37:49,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:49,987 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,992 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-04 01:37:49,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 01:37:49,994 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,995 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:49,998 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:152, output treesize:9 [2018-02-04 01:37:50,022 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-04 01:37:50,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:50,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-02-04 01:37:50,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 01:37:50,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 01:37:50,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 01:37:50,042 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 33 states. [2018-02-04 01:37:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:51,095 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-02-04 01:37:51,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 01:37:51,095 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-02-04 01:37:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:51,096 INFO L225 Difference]: With dead ends: 159 [2018-02-04 01:37:51,096 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 01:37:51,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=1922, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 01:37:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 01:37:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-02-04 01:37:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 01:37:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-02-04 01:37:51,098 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-02-04 01:37:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:51,098 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-02-04 01:37:51,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 01:37:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-02-04 01:37:51,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 01:37:51,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:51,099 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-04 01:37:51,099 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-04 01:37:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1117992346, now seen corresponding path program 3 times [2018-02-04 01:37:51,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:51,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:51,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:51,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:51,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:51,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:51,389 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-04 01:37:51,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:51,389 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-04 01:37:51,400 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 01:37:51,449 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 01:37:51,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 01:37:51,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:51,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:37:51,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 01:37:51,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:37:51,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 01:37:51,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:51,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:51,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-02-04 01:37:51,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 01:37:51,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:51,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 01:37:51,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-02-04 01:37:51,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 01:37:51,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2018-02-04 01:37:51,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 01:37:51,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-02-04 01:37:51,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-04 01:37:51,787 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-04 01:37:51,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-02-04 01:37:51,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:51,883 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-04 01:37:51,885 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-04 01:37:51,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:51,941 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 36 treesize of output 39 [2018-02-04 01:37:51,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 01:37:51,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:37:51,999 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-04 01:37:51,999 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:83 [2018-02-04 01:37:52,053 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-04 01:37:52,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:52,069 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 3 case distinctions, treesize of input 63 treesize of output 59 [2018-02-04 01:37:52,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:37:52,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:52,100 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-04 01:37:52,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:37:52,146 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-04 01:37:52,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:52,148 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-04 01:37:52,149 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,153 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,171 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-04 01:37:52,171 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:155, output treesize:113 [2018-02-04 01:37:52,318 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-04 01:37:52,319 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-04 01:37:52,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 01:37:52,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 01:37:52,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-04 01:37:52,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,386 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-04 01:37:52,386 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,402 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-04 01:37:52,402 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,431 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-04 01:37:52,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 01:37:52,432 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:52,437 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,440 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:52,447 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-04 01:37:52,448 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-02-04 01:37:52,458 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-04 01:37:52,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:52,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2018-02-04 01:37:52,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 01:37:52,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 01:37:52,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=881, Unknown=1, NotChecked=0, Total=992 [2018-02-04 01:37:52,477 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 32 states. [2018-02-04 01:37:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:53,599 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-02-04 01:37:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 01:37:53,599 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-02-04 01:37:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:53,600 INFO L225 Difference]: With dead ends: 194 [2018-02-04 01:37:53,600 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 01:37:53,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=414, Invalid=2339, Unknown=3, NotChecked=0, Total=2756 [2018-02-04 01:37:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 01:37:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-02-04 01:37:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 01:37:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-02-04 01:37:53,602 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-02-04 01:37:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:53,603 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-02-04 01:37:53,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 01:37:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-02-04 01:37:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 01:37:53,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:53,603 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-04 01:37:53,604 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-04 01:37:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1117992345, now seen corresponding path program 2 times [2018-02-04 01:37:53,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:53,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:53,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:53,605 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 01:37:53,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:53,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:53,842 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-04 01:37:53,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:53,842 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-04 01:37:53,848 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 01:37:53,870 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 01:37:53,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 01:37:53,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:53,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 01:37:53,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:53,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:53,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 01:37:53,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:53,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:53,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 01:37:53,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:53,926 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-04 01:37:53,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:53,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:53,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 01:37:53,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:53,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 8 treesize of output 7 [2018-02-04 01:37:53,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:53,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:53,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 01:37:53,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:53,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:53,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-02-04 01:37:54,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-02-04 01:37:54,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 01:37:54,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-04 01:37:54,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:54,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2018-02-04 01:37:54,132 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-04 01:37:54,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,137 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-04 01:37:54,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,166 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-04 01:37:54,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 01:37:54,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2018-02-04 01:37:54,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 01:37:54,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 19 [2018-02-04 01:37:54,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-02-04 01:37:54,232 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-04 01:37:54,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-02-04 01:37:54,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-04 01:37:54,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-02-04 01:37:54,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:53 [2018-02-04 01:37:54,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,336 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-04 01:37:54,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 01:37:54,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,358 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-04 01:37:54,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 01:37:54,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:54,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:99 [2018-02-04 01:37:54,408 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-04 01:37:54,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,412 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-04 01:37:54,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,437 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-04 01:37:54,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:54,440 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-04 01:37:54,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:54,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:96 [2018-02-04 01:37:54,519 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-04 01:37:54,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-02-04 01:37:54,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:54,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:54,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-04 01:37:54,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:37:54,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 01:37:54,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 01:37:54,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 01:37:54,555 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:54,560 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-04 01:37:54,561 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:110, output treesize:18 [2018-02-04 01:37:54,611 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-04 01:37:54,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:54,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2018-02-04 01:37:54,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 01:37:54,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 01:37:54,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-02-04 01:37:54,630 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 31 states. [2018-02-04 01:37:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:55,811 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-02-04 01:37:55,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 01:37:55,812 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-02-04 01:37:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:55,813 INFO L225 Difference]: With dead ends: 200 [2018-02-04 01:37:55,813 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 01:37:55,813 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-04 01:37:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 01:37:55,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-02-04 01:37:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 01:37:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-02-04 01:37:55,816 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-02-04 01:37:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:55,816 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-02-04 01:37:55,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 01:37:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-02-04 01:37:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 01:37:55,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:55,817 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-04 01:37:55,817 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-04 01:37:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash -546616445, now seen corresponding path program 1 times [2018-02-04 01:37:55,818 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:55,818 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:55,819 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:55,819 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 01:37:55,819 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:37:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:37:55,870 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 01:37:55,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:37:55 BoogieIcfgContainer [2018-02-04 01:37:55,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:37:55,924 INFO L168 Benchmark]: Toolchain (without parser) took 24973.44 ms. Allocated memory was 398.5 MB in the beginning and 871.9 MB in the end (delta: 473.4 MB). Free memory was 352.5 MB in the beginning and 557.7 MB in the end (delta: -205.2 MB). Peak memory consumption was 268.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:55,925 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 398.5 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:37:55,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.20 ms. Allocated memory is still 398.5 MB. Free memory was 352.5 MB in the beginning and 340.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:55,925 INFO L168 Benchmark]: Boogie Preprocessor took 33.33 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 339.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:55,926 INFO L168 Benchmark]: RCFGBuilder took 333.58 ms. Allocated memory is still 398.5 MB. Free memory was 338.0 MB in the beginning and 304.7 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:55,926 INFO L168 Benchmark]: TraceAbstraction took 24424.29 ms. Allocated memory was 398.5 MB in the beginning and 871.9 MB in the end (delta: 473.4 MB). Free memory was 304.7 MB in the beginning and 557.7 MB in the end (delta: -253.0 MB). Peak memory consumption was 220.4 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:55,931 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 398.5 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.20 ms. Allocated memory is still 398.5 MB. Free memory was 352.5 MB in the beginning and 340.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.33 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 339.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 333.58 ms. Allocated memory is still 398.5 MB. Free memory was 338.0 MB in the beginning and 304.7 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 24424.29 ms. Allocated memory was 398.5 MB in the beginning and 871.9 MB in the end (delta: 473.4 MB). Free memory was 304.7 MB in the beginning and 557.7 MB in the end (delta: -253.0 MB). Peak memory consumption was 220.4 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))={23:0}, malloc(sizeof(SLL))={24:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1017] EXPR, FCALL end->next VAL [end={24:0}, end->next={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1019] FCALL end->colour = BLACK VAL [end={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21: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))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1027] 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}] [L1028] EXPR, FCALL end->colour VAL [end={23:0}, end->colour=1, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] 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}] [L1030] COND TRUE ((void*)0) != end VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24: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))={24:0}, malloc(sizeof(SLL))={21: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))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21: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))={23:0}, malloc(sizeof(SLL))={24: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))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] [L1032] EXPR, FCALL end->colour VAL [end={24:0}, end->colour=0, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24: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))={24:0}, malloc(sizeof(SLL))={21: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))={24:0}, malloc(sizeof(SLL))={21:0}] [L1035] end = end->next [L1038] FCALL end->next VAL [end={0:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={21:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 49 error locations. UNSAFE Result, 24.3s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1498 SDtfs, 5905 SDslu, 8734 SDs, 0 SdLazy, 13898 SolverSat, 1045 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 943 GetRequests, 401 SyntacticMatches, 43 SemanticMatches, 499 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4737 ImplicationChecksByTransitivity, 9.9s 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 1025 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1369 NumberOfCodeBlocks, 1369 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1279 ConstructedInterpolants, 236 QuantifiedInterpolants, 1789870 SizeOfPredicates, 167 NumberOfNonLiveVariables, 1990 ConjunctsInSsa, 472 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-04_01-37-55-937.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-04_01-37-55-937.csv Received shutdown request...