java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:15:12,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:15:12,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:15:12,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:15:12,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:15:12,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:15:12,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:15:12,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:15:12,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:15:12,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:15:12,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:15:12,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:15:12,041 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:15:12,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:15:12,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:15:12,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:15:12,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:15:12,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:15:12,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:15:12,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:15:12,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:15:12,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:15:12,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:15:12,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:15:12,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:15:12,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:15:12,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:15:12,059 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:15:12,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:15:12,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:15:12,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:15:12,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:15:12,070 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:15:12,071 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:15:12,071 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:15:12,072 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:15:12,072 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:15:12,072 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:15:12,072 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:15:12,073 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:15:12,073 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:15:12,073 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:15:12,074 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:15:12,074 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:15:12,074 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:15:12,074 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:15:12,074 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:15:12,075 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:15:12,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:15:12,075 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:15:12,075 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:15:12,075 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:15:12,076 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:15:12,076 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:15:12,076 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:15:12,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:15:12,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:15:12,077 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:15:12,077 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:15:12,077 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:15:12,077 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:15:12,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:15:12,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:15:12,078 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:15:12,079 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:15:12,079 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:15:12,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:15:12,126 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:15:12,131 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:15:12,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:15:12,133 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:15:12,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-24 13:15:12,318 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:15:12,325 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:15:12,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:15:12,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:15:12,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:15:12,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4d08b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12, skipping insertion in model container [2018-01-24 13:15:12,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,355 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:15:12,398 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:15:12,521 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:15:12,536 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:15:12,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12 WrapperNode [2018-01-24 13:15:12,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:15:12,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:15:12,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:15:12,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:15:12,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (1/1) ... [2018-01-24 13:15:12,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:15:12,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:15:12,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:15:12,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:15:12,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:15:12,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:15:12,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:15:12,627 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 13:15:12,627 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:15:12,628 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:15:12,628 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:15:12,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:15:12,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:15:12,628 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:15:12,628 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:15:12,628 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:15:12,628 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:15:12,629 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 13:15:12,629 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:15:12,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:15:12,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:15:12,878 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:15:12,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:15:12 BoogieIcfgContainer [2018-01-24 13:15:12,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:15:12,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:15:12,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:15:12,882 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:15:12,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:15:12" (1/3) ... [2018-01-24 13:15:12,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c01b8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:15:12, skipping insertion in model container [2018-01-24 13:15:12,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:15:12" (2/3) ... [2018-01-24 13:15:12,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c01b8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:15:12, skipping insertion in model container [2018-01-24 13:15:12,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:15:12" (3/3) ... [2018-01-24 13:15:12,885 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-24 13:15:12,891 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:15:12,897 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 13:15:12,936 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:15:12,937 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:15:12,937 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:15:12,937 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:15:12,937 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:15:12,937 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:15:12,937 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:15:12,937 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:15:12,938 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:15:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-24 13:15:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:15:12,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:12,963 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:12,963 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-01-24 13:15:12,969 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:13,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:13,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:13,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:13,011 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:13,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:13,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:13,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:15:13,114 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:13,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 13:15:13,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 13:15:13,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:15:13,134 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-24 13:15:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:13,246 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-01-24 13:15:13,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 13:15:13,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 13:15:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:13,257 INFO L225 Difference]: With dead ends: 109 [2018-01-24 13:15:13,257 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 13:15:13,261 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:15:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 13:15:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 13:15:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 13:15:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 13:15:13,300 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-01-24 13:15:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:13,300 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 13:15:13,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 13:15:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 13:15:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:15:13,301 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:13,301 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:13,301 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-01-24 13:15:13,302 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:13,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:13,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:13,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:13,303 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:13,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:13,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:13,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:15:13,401 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:13,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:15:13,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:15:13,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:15:13,404 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-01-24 13:15:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:13,534 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-01-24 13:15:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:15:13,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:15:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:13,536 INFO L225 Difference]: With dead ends: 56 [2018-01-24 13:15:13,536 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 13:15:13,537 INFO L525 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-01-24 13:15:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 13:15:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 13:15:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 13:15:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 13:15:13,545 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-01-24 13:15:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:13,546 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 13:15:13,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:15:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 13:15:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:15:13,547 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:13,547 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:13,547 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-01-24 13:15:13,547 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:13,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:13,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:13,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:13,549 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:13,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:13,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:13,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:15:13,660 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:13,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:15:13,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:15:13,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:15:13,661 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-01-24 13:15:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:13,783 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-24 13:15:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:15:13,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 13:15:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:13,785 INFO L225 Difference]: With dead ends: 55 [2018-01-24 13:15:13,785 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 13:15:13,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:15:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 13:15:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 13:15:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 13:15:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-24 13:15:13,793 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-01-24 13:15:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:13,793 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-24 13:15:13,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:15:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-24 13:15:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:15:13,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:13,794 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:13,795 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-01-24 13:15:13,795 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:13,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:13,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:13,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:13,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:13,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:13,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:13,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:15:13,917 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:13,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:15:13,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:15:13,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:15:13,918 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-01-24 13:15:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:14,038 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-24 13:15:14,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:15:14,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 13:15:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:14,040 INFO L225 Difference]: With dead ends: 54 [2018-01-24 13:15:14,040 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 13:15:14,041 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:15:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 13:15:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 13:15:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 13:15:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 13:15:14,047 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-01-24 13:15:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:14,048 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 13:15:14,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:15:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 13:15:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:15:14,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:14,049 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:14,049 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-01-24 13:15:14,049 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:14,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:14,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:14,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:14,050 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:14,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:14,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:14,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:15:14,208 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:14,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:15:14,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:15:14,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:15:14,209 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-01-24 13:15:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:14,352 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 13:15:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:15:14,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 13:15:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:14,357 INFO L225 Difference]: With dead ends: 91 [2018-01-24 13:15:14,357 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 13:15:14,358 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:15:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 13:15:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-01-24 13:15:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 13:15:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 13:15:14,366 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-01-24 13:15:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:14,366 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 13:15:14,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:15:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 13:15:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:15:14,367 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:14,367 INFO L322 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] [2018-01-24 13:15:14,368 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-01-24 13:15:14,368 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:14,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:14,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:14,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:14,369 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:14,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:14,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:14,453 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:15:14,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:14,466 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:14,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:14,554 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:14,613 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:15:14,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-24 13:15:14,614 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:14,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:15:14,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:15:14,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:15:14,615 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-24 13:15:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:14,753 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-01-24 13:15:14,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:15:14,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 13:15:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:14,754 INFO L225 Difference]: With dead ends: 124 [2018-01-24 13:15:14,754 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 13:15:14,755 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:15:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 13:15:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-01-24 13:15:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 13:15:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-24 13:15:14,762 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-24 13:15:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:14,763 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-24 13:15:14,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:15:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-24 13:15:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:15:14,764 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:14,764 INFO L322 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] [2018-01-24 13:15:14,764 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:14,765 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-01-24 13:15:14,765 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:14,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:14,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:14,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:14,767 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:14,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:14,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:14,998 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:15:15,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:15,006 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:15,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:15,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:15,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 13:15:15,073 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 16 treesize of output 15 [2018-01-24 13:15:15,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:15,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-24 13:15:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:15,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-24 13:15:15,710 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 8 treesize of output 1 [2018-01-24 13:15:15,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-24 13:15:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:15,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:15,742 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:15:15,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:15,746 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:15,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:15,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:15:15,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:15,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-24 13:15:15,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:15,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:15,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:15:15,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-24 13:15:15,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:15,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:15,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-24 13:15:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:16,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:16,105 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 10 treesize of output 3 [2018-01-24 13:15:16,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:16,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-24 13:15:16,124 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 8 treesize of output 1 [2018-01-24 13:15:16,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:16,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:16,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:16,130 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-24 13:15:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:16,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:15:16,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 8, 8] total 24 [2018-01-24 13:15:16,147 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:15:16,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:15:16,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:15:16,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=479, Unknown=1, NotChecked=0, Total=600 [2018-01-24 13:15:16,150 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 13 states. [2018-01-24 13:15:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:16,604 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-24 13:15:16,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:15:16,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-01-24 13:15:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:16,606 INFO L225 Difference]: With dead ends: 139 [2018-01-24 13:15:16,606 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 13:15:16,606 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=596, Unknown=1, NotChecked=0, Total=756 [2018-01-24 13:15:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 13:15:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2018-01-24 13:15:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 13:15:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-24 13:15:16,616 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 27 [2018-01-24 13:15:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:16,616 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-24 13:15:16,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:15:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-24 13:15:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:15:16,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:16,618 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:16,618 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash 616992647, now seen corresponding path program 1 times [2018-01-24 13:15:16,618 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:16,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:16,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:16,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:16,619 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:16,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:15:16,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:16,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:15:16,680 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:16,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:15:16,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:15:16,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:15:16,681 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 4 states. [2018-01-24 13:15:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:16,750 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-24 13:15:16,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:15:16,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 13:15:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:16,751 INFO L225 Difference]: With dead ends: 80 [2018-01-24 13:15:16,752 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 13:15:16,752 INFO L525 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-01-24 13:15:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 13:15:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 13:15:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 13:15:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-24 13:15:16,761 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2018-01-24 13:15:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:16,762 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-24 13:15:16,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:15:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-24 13:15:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:15:16,763 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:16,763 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:16,764 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:16,764 INFO L82 PathProgramCache]: Analyzing trace with hash 616992648, now seen corresponding path program 1 times [2018-01-24 13:15:16,764 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:16,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:16,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:16,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:16,765 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:16,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:15:16,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:16,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:15:16,896 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:16,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:15:16,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:15:16,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:15:16,897 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-01-24 13:15:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:17,022 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-24 13:15:17,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:15:17,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 13:15:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:17,066 INFO L225 Difference]: With dead ends: 80 [2018-01-24 13:15:17,066 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 13:15:17,067 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:15:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 13:15:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-24 13:15:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 13:15:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-24 13:15:17,076 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 29 [2018-01-24 13:15:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:17,077 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-24 13:15:17,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:15:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-24 13:15:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 13:15:17,078 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:17,078 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:17,078 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:17,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1946902913, now seen corresponding path program 1 times [2018-01-24 13:15:17,079 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:17,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:17,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:17,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:17,080 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:17,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:15:17,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:17,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:15:17,128 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:17,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:15:17,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:15:17,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:15:17,129 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 4 states. [2018-01-24 13:15:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:17,221 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-01-24 13:15:17,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:15:17,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-24 13:15:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:17,223 INFO L225 Difference]: With dead ends: 91 [2018-01-24 13:15:17,223 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 13:15:17,224 INFO L525 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-01-24 13:15:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 13:15:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-01-24 13:15:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 13:15:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-24 13:15:17,233 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 30 [2018-01-24 13:15:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:17,233 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-24 13:15:17,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:15:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-24 13:15:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 13:15:17,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:17,235 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:17,235 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash 746385703, now seen corresponding path program 2 times [2018-01-24 13:15:17,236 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:17,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:17,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:17,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:17,237 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:17,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:17,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:17,368 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:15:17,380 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:15:17,380 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:15:17,401 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:15:17,409 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:15:17,411 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:15:17,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:17,500 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:17,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:17,588 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:15:17,591 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:15:17,591 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:15:17,609 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:15:17,639 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:15:17,650 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:15:17,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:17,660 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:17,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:15:17,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 15 [2018-01-24 13:15:17,684 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:15:17,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:15:17,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:15:17,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:15:17,685 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2018-01-24 13:15:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:17,920 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2018-01-24 13:15:17,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:15:17,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-01-24 13:15:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:17,921 INFO L225 Difference]: With dead ends: 166 [2018-01-24 13:15:17,921 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 13:15:17,922 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:15:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 13:15:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-01-24 13:15:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 13:15:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-01-24 13:15:17,933 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2018-01-24 13:15:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:17,934 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-01-24 13:15:17,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:15:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-01-24 13:15:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:15:17,935 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:17,935 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:17,935 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 946337879, now seen corresponding path program 1 times [2018-01-24 13:15:17,935 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:17,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:17,936 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:15:17,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:17,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:17,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:15:18,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:18,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:15:18,024 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:18,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:15:18,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:15:18,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:15:18,025 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 6 states. [2018-01-24 13:15:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:18,115 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-24 13:15:18,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:15:18,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-24 13:15:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:18,117 INFO L225 Difference]: With dead ends: 108 [2018-01-24 13:15:18,117 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 13:15:18,118 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:15:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 13:15:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-24 13:15:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 13:15:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-01-24 13:15:18,129 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 33 [2018-01-24 13:15:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:18,130 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-01-24 13:15:18,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:15:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-01-24 13:15:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:15:18,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:18,131 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:18,132 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:18,132 INFO L82 PathProgramCache]: Analyzing trace with hash 946337880, now seen corresponding path program 1 times [2018-01-24 13:15:18,132 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:18,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:18,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:18,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:18,133 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:18,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:15:18,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:18,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:15:18,231 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:18,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:15:18,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:15:18,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:15:18,232 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 8 states. [2018-01-24 13:15:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:18,404 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-01-24 13:15:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:15:18,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-01-24 13:15:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:18,406 INFO L225 Difference]: With dead ends: 107 [2018-01-24 13:15:18,406 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 13:15:18,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:15:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 13:15:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-24 13:15:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 13:15:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-24 13:15:18,419 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 33 [2018-01-24 13:15:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:18,419 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-24 13:15:18,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:15:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-24 13:15:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:15:18,420 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:18,420 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:18,421 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash 946329935, now seen corresponding path program 1 times [2018-01-24 13:15:18,421 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:18,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:18,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:18,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:18,422 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:18,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:18,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:18,727 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:15:18,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:18,738 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:18,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:18,780 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-01-24 13:15:18,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-24 13:15:18,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:18,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:18,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:18,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 13:15:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:15:18,791 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:18,820 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 18 treesize of output 14 [2018-01-24 13:15:18,822 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2018-01-24 13:15:18,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:18,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:18,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:18,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2018-01-24 13:15:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:15:18,852 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:15:18,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [14] total 17 [2018-01-24 13:15:18,852 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:18,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:15:18,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:15:18,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:15:18,853 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 5 states. [2018-01-24 13:15:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:18,936 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-01-24 13:15:18,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:15:18,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 13:15:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:18,938 INFO L225 Difference]: With dead ends: 114 [2018-01-24 13:15:18,938 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 13:15:18,938 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:15:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 13:15:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-01-24 13:15:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 13:15:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-24 13:15:18,946 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 33 [2018-01-24 13:15:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:18,946 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-24 13:15:18,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:15:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-24 13:15:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:15:18,947 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:18,947 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:18,947 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:18,948 INFO L82 PathProgramCache]: Analyzing trace with hash 529142380, now seen corresponding path program 1 times [2018-01-24 13:15:18,948 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:18,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:18,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:18,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:18,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:18,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:15:19,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:19,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:15:19,098 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:19,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:15:19,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:15:19,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:15:19,099 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-01-24 13:15:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:19,247 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-01-24 13:15:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:15:19,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-24 13:15:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:19,248 INFO L225 Difference]: With dead ends: 114 [2018-01-24 13:15:19,248 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 13:15:19,248 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:15:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 13:15:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-01-24 13:15:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 13:15:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-01-24 13:15:19,257 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 34 [2018-01-24 13:15:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:19,258 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-01-24 13:15:19,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:15:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-01-24 13:15:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:15:19,258 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:19,259 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:19,259 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:19,259 INFO L82 PathProgramCache]: Analyzing trace with hash 569056812, now seen corresponding path program 3 times [2018-01-24 13:15:19,259 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:19,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:19,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:19,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:19,260 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:19,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 13:15:19,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:19,372 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:15:19,385 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:15:19,385 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:15:19,406 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:15:19,412 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:15:19,413 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:15:19,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:19,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:19,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:15:19,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 13:15:19,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:19,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:19,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:15:19,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-24 13:15:19,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 13:15:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 13:15:19,643 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 13:15:19,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:19,842 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:15:19,845 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:15:19,846 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:15:19,867 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:15:19,905 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:15:19,915 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:15:19,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:19,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:15:19,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:19,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 13:15:19,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:19,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-24 13:15:19,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:19,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:19,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:15:19,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:19,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:19,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-24 13:15:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 13:15:19,991 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 13:15:20,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:15:20,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7, 7, 7] total 19 [2018-01-24 13:15:20,143 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:15:20,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:15:20,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:15:20,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-24 13:15:20,144 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 14 states. [2018-01-24 13:15:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:20,503 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-01-24 13:15:20,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:15:20,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-24 13:15:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:20,505 INFO L225 Difference]: With dead ends: 108 [2018-01-24 13:15:20,505 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 13:15:20,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2018-01-24 13:15:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 13:15:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-01-24 13:15:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 13:15:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-01-24 13:15:20,515 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 34 [2018-01-24 13:15:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:20,515 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-01-24 13:15:20,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:15:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-01-24 13:15:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 13:15:20,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:20,516 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:20,517 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1102363112, now seen corresponding path program 1 times [2018-01-24 13:15:20,517 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:20,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:20,518 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:15:20,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:20,518 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:20,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:15:20,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:20,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:15:20,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:20,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:15:20,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:15:20,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:15:20,772 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 9 states. [2018-01-24 13:15:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:20,965 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-01-24 13:15:20,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:15:20,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-24 13:15:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:20,966 INFO L225 Difference]: With dead ends: 105 [2018-01-24 13:15:20,966 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 13:15:20,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:15:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 13:15:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-24 13:15:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 13:15:20,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-24 13:15:20,973 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-01-24 13:15:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:20,973 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-24 13:15:20,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:15:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-24 13:15:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:15:20,974 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:20,974 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:20,974 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 984721596, now seen corresponding path program 1 times [2018-01-24 13:15:20,974 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:20,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:20,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:20,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:20,975 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:20,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:15:21,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:21,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:15:21,061 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:21,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:15:21,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:15:21,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:15:21,062 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-01-24 13:15:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:21,133 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-01-24 13:15:21,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:15:21,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-24 13:15:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:21,133 INFO L225 Difference]: With dead ends: 78 [2018-01-24 13:15:21,133 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 13:15:21,134 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:15:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 13:15:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 13:15:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 13:15:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-24 13:15:21,141 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 41 [2018-01-24 13:15:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:21,141 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-24 13:15:21,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:15:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-24 13:15:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:15:21,141 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:21,141 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:21,141 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1657687266, now seen corresponding path program 1 times [2018-01-24 13:15:21,142 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:21,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:21,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:21,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:21,142 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:21,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:15:21,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:21,225 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:15:21,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:21,236 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:21,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:15:21,306 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:15:21,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:21,377 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:15:21,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:21,385 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:21,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:15:21,449 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:15:21,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:15:21,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 12 [2018-01-24 13:15:21,503 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:15:21,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:15:21,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:15:21,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:15:21,505 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2018-01-24 13:15:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:21,708 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-01-24 13:15:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:15:21,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-24 13:15:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:21,709 INFO L225 Difference]: With dead ends: 119 [2018-01-24 13:15:21,709 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 13:15:21,709 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 150 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=160, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:15:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 13:15:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-01-24 13:15:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 13:15:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-01-24 13:15:21,719 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-01-24 13:15:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:21,719 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-01-24 13:15:21,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:15:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-01-24 13:15:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 13:15:21,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:21,720 INFO L322 BasicCegarLoop]: trace histogram [3, 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-01-24 13:15:21,720 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 13:15:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1214448692, now seen corresponding path program 1 times [2018-01-24 13:15:21,721 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:21,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:21,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:21,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:21,722 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:21,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:22,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:22,344 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:15:22,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:22,349 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:22,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:22,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:15:22,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 13:15:22,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:22,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:22,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:15:22,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-24 13:15:22,477 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-01-24 13:15:22,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:22,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 13:15:22,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:15:22,520 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-01-24 13:15:22,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-01-24 13:15:22,766 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 38 treesize of output 42 [2018-01-24 13:15:22,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-24 13:15:22,772 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-01-24 13:15:22,773 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-01-24 13:15:22,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:22,804 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 19 [2018-01-24 13:15:22,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,812 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:22,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:22,889 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:50 [2018-01-24 13:15:22,987 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 81 treesize of output 63 [2018-01-24 13:15:22,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:22,990 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:22,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:22,991 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:22,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 81 [2018-01-24 13:15:22,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:23,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 10 [2018-01-24 13:15:23,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:23,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:23,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:23,011 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:88, output treesize:13 [2018-01-24 13:15:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:23,041 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:44,158 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2018-01-24 13:15:44,172 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 9 treesize of output 8 [2018-01-24 13:15:44,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2018-01-24 13:15:44,192 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-24 13:15:44,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-01-24 13:15:44,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-01-24 13:15:44,221 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:44,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 13:15:44,224 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-01-24 13:15:44,252 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-01-24 13:15:44,282 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:44,300 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:44,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-01-24 13:15:44,329 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,331 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 42 treesize of output 36 [2018-01-24 13:15:44,331 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-01-24 13:15:44,362 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-24 13:15:44,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-24 13:15:44,413 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:44,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-24 13:15:44,444 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-01-24 13:15:44,485 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:15:44,487 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-01-24 13:15:44,535 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:44,560 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:44,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 13:15:44,632 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 1 case distinctions, treesize of input 36 treesize of output 38 [2018-01-24 13:15:44,666 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 32 treesize of output 26 [2018-01-24 13:15:44,667 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,668 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 26 treesize of output 20 [2018-01-24 13:15:44,669 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,671 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 34 treesize of output 28 [2018-01-24 13:15:44,671 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,712 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 20 treesize of output 16 [2018-01-24 13:15:44,713 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,715 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 13:15:44,715 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-24 13:15:44,737 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:44,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 45 [2018-01-24 13:15:44,750 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-01-24 13:15:44,779 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:15:44,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 99 [2018-01-24 13:15:45,130 WARN L146 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 167 DAG size of output 157 [2018-01-24 13:15:45,133 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2018-01-24 13:15:45,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-01-24 13:15:45,172 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:15:45,173 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:45,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-01-24 13:15:45,197 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:45,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-01-24 13:15:45,240 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 3 xjuncts. [2018-01-24 13:15:45,273 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:45,299 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:45,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2018-01-24 13:15:45,307 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-01-24 13:15:45,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-01-24 13:15:45,347 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:45,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 13:15:45,352 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:45,352 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:15:45,353 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:45,368 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:45,384 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:45,387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2018-01-24 13:15:45,392 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-01-24 13:15:45,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-01-24 13:15:45,426 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:45,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 13:15:45,429 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:45,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-01-24 13:15:45,459 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 3 xjuncts. [2018-01-24 13:15:45,485 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:45,509 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:45,834 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 47 treesize of output 43 [2018-01-24 13:15:45,835 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:45,838 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-24 13:15:45,839 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:45,841 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-01-24 13:15:45,841 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-01-24 13:15:46,172 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-24 13:15:46,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-24 13:15:46,205 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:46,206 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:15:46,206 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-24 13:15:46,210 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,221 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,229 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 134 [2018-01-24 13:15:46,267 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:46,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 93 [2018-01-24 13:15:46,306 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:46,307 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:46,307 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:46,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:46,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 58 [2018-01-24 13:15:46,313 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,327 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-24 13:15:46,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-24 13:15:46,473 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,481 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 156 [2018-01-24 13:15:46,883 WARN L146 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 253 DAG size of output 140 [2018-01-24 13:15:46,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-01-24 13:15:46,890 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:46,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-01-24 13:15:46,984 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:47,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2018-01-24 13:15:47,144 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:47,167 INFO L267 ElimStorePlain]: Start of recursive call 54: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:47,455 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-01-24 13:15:47,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-01-24 13:15:47,479 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:47,506 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:47,584 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-01-24 13:15:47,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-01-24 13:15:47,637 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:15:47,639 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 3 xjuncts. [2018-01-24 13:15:47,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-24 13:15:47,659 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:47,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-24 13:15:47,663 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:47,701 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:47,738 INFO L267 ElimStorePlain]: Start of recursive call 49: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:48,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 131 [2018-01-24 13:15:48,100 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:48,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 90 [2018-01-24 13:15:48,134 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:48,138 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:48,138 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:48,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:48,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2018-01-24 13:15:48,140 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,151 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-01-24 13:15:48,301 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:48,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:48,305 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:48,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-01-24 13:15:48,306 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,315 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-01-24 13:15:48,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-24 13:15:48,464 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,472 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-24 13:15:48,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-01-24 13:15:48,554 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,560 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,681 INFO L267 ElimStorePlain]: Start of recursive call 64: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:48,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-01-24 13:15:48,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-24 13:15:48,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-24 13:15:48,702 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,702 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:15:48,703 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-24 13:15:48,722 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:48,731 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,737 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,911 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 67 treesize of output 61 [2018-01-24 13:15:48,911 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:48,913 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 69 [2018-01-24 13:15:48,913 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,000 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 108 [2018-01-24 13:15:49,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-01-24 13:15:49,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-24 13:15:49,027 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,033 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-01-24 13:15:49,090 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:49,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:49,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-01-24 13:15:49,091 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,099 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 135 [2018-01-24 13:15:49,406 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 214 DAG size of output 114 [2018-01-24 13:15:49,408 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:49,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 64 [2018-01-24 13:15:49,409 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:49,504 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:49,504 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:49,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 84 [2018-01-24 13:15:49,505 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-01-24 13:15:49,602 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-01-24 13:15:49,687 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-01-24 13:15:49,777 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,825 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:49,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 82 [2018-01-24 13:15:49,832 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:49,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-01-24 13:15:49,887 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,908 INFO L267 ElimStorePlain]: Start of recursive call 85: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:49,930 INFO L267 ElimStorePlain]: Start of recursive call 80: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:49,931 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-01-24 13:15:49,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-24 13:15:49,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-01-24 13:15:49,958 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:49,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 13:15:49,961 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,961 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:15:49,962 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,975 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:49,981 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:50,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 93 [2018-01-24 13:15:50,045 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 3 xjuncts. [2018-01-24 13:15:50,173 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-01-24 13:15:50,176 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-24 13:15:50,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-01-24 13:15:50,210 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 3 xjuncts. [2018-01-24 13:15:50,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-01-24 13:15:50,223 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2018-01-24 13:15:50,224 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:15:50,224 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:50,240 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:50,253 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:15:50,327 INFO L267 ElimStorePlain]: Start of recursive call 25: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 13:15:50,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-24 13:15:50,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-24 13:15:50,422 INFO L202 ElimStorePlain]: Needed 103 recursive calls to eliminate 4 variables, input treesize:98, output treesize:146 [2018-01-24 13:15:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:50,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:50,917 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:15:50,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:50,920 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:50,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:51,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:15:51,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:15:51,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:51,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:51,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:15:51,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-24 13:15:51,223 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-01-24 13:15:51,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:51,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-24 13:15:51,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:15:51,298 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-01-24 13:15:51,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-01-24 13:15:51,684 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 38 treesize of output 42 [2018-01-24 13:15:51,685 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-24 13:15:51,688 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-01-24 13:15:51,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-01-24 13:15:51,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2018-01-24 13:15:51,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:51,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:51,725 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:50 [2018-01-24 13:15:55,846 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 78 treesize of output 60 [2018-01-24 13:15:55,849 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 23 treesize of output 1 [2018-01-24 13:15:55,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:55,857 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:55,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-01-24 13:15:55,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:55,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:55,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:55,865 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:82, output treesize:11 [2018-01-24 13:15:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:55,904 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:16:04,387 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 41 DAG size of output 39 Received shutdown request... [2018-01-24 13:16:18,927 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:16:18,928 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:16:18,931 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:16:18,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:16:18 BoogieIcfgContainer [2018-01-24 13:16:18,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:16:18,933 INFO L168 Benchmark]: Toolchain (without parser) took 66614.23 ms. Allocated memory was 305.1 MB in the beginning and 628.6 MB in the end (delta: 323.5 MB). Free memory was 265.2 MB in the beginning and 367.9 MB in the end (delta: -102.7 MB). Peak memory consumption was 220.8 MB. Max. memory is 5.3 GB. [2018-01-24 13:16:18,934 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:16:18,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.93 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:16:18,934 INFO L168 Benchmark]: Boogie Preprocessor took 30.74 ms. Allocated memory is still 305.1 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:16:18,934 INFO L168 Benchmark]: RCFGBuilder took 305.86 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 233.5 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-01-24 13:16:18,935 INFO L168 Benchmark]: TraceAbstraction took 66052.29 ms. Allocated memory was 305.1 MB in the beginning and 628.6 MB in the end (delta: 323.5 MB). Free memory was 232.5 MB in the beginning and 367.9 MB in the end (delta: -135.4 MB). Peak memory consumption was 188.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:16:18,936 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.20 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.93 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.74 ms. Allocated memory is still 305.1 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 305.86 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 233.5 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66052.29 ms. Allocated memory was 305.1 MB in the beginning and 628.6 MB in the end (delta: 323.5 MB). Free memory was 232.5 MB in the beginning and 367.9 MB in the end (delta: -135.4 MB). Peak memory consumption was 188.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 71 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 66.0s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 1376 SDslu, 1526 SDs, 0 SdLazy, 1871 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 588 SyntacticMatches, 35 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=11, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 129 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 857 NumberOfCodeBlocks, 843 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1141 ConstructedInterpolants, 89 QuantifiedInterpolants, 231408 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1476 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 242/341 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-16-18-943.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-16-18-943.csv Completed graceful shutdown