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/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:01:24,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:01:24,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:01:24,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:01:24,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:01:24,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:01:24,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:01:24,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:01:24,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:01:24,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:01:24,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:01:24,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:01:24,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:01:24,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:01:24,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:01:24,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:01:24,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:01:24,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:01:24,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:01:24,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:01:24,965 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:01:24,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:01:24,966 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:01:24,967 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:01:24,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:01:24,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:01:24,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:01:24,970 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:01:24,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:01:24,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:01:24,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:01:24,971 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:01:24,980 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:01:24,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:01:24,981 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:01:24,981 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:01:24,981 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:01:24,981 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:01:24,981 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:01:24,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:01:24,982 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:01:24,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:01:24,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:01:24,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:01:24,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:01:24,982 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:01:24,982 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:01:24,982 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:01:24,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:01:24,983 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:01:24,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:01:24,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:01:24,983 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:01:24,983 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:01:24,984 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:01:24,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:01:24,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:01:24,984 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:01:24,984 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:01:24,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:01:24,985 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:01:24,985 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:01:24,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:01:24,985 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:01:24,986 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:01:24,986 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:01:25,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:01:25,031 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:01:25,035 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:01:25,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:01:25,037 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:01:25,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i [2018-01-24 13:01:25,233 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:01:25,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:01:25,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:01:25,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:01:25,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:01:25,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6546250d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25, skipping insertion in model container [2018-01-24 13:01:25,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,261 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:01:25,308 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:01:25,443 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:01:25,473 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:01:25,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25 WrapperNode [2018-01-24 13:01:25,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:01:25,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:01:25,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:01:25,487 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:01:25,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (1/1) ... [2018-01-24 13:01:25,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:01:25,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:01:25,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:01:25,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:01:25,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (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:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-01-24 13:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-01-24 13:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-01-24 13:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-01-24 13:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-01-24 13:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-01-24 13:01:25,591 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-01-24 13:01:25,592 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-01-24 13:01:25,592 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:01:25,592 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:01:25,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:01:25,592 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:01:25,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:01:25,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:01:25,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:01:25,593 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:01:25,593 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 13:01:25,593 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 13:01:25,593 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:01:25,593 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 13:01:25,594 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 13:01:25,594 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-01-24 13:01:25,594 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-01-24 13:01:25,594 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-01-24 13:01:25,594 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-01-24 13:01:25,594 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-01-24 13:01:25,595 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-01-24 13:01:25,595 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-01-24 13:01:25,595 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-01-24 13:01:25,595 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:01:25,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:01:25,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:01:25,808 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 13:01:26,176 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:01:26,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:01:26 BoogieIcfgContainer [2018-01-24 13:01:26,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:01:26,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:01:26,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:01:26,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:01:26,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:01:25" (1/3) ... [2018-01-24 13:01:26,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9be7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:01:26, skipping insertion in model container [2018-01-24 13:01:26,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:01:25" (2/3) ... [2018-01-24 13:01:26,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9be7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:01:26, skipping insertion in model container [2018-01-24 13:01:26,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:01:26" (3/3) ... [2018-01-24 13:01:26,183 INFO L105 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-01-24 13:01:26,190 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:01:26,197 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 13:01:26,239 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:01:26,239 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:01:26,239 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:01:26,239 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:01:26,240 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:01:26,240 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:01:26,240 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:01:26,240 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:01:26,241 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:01:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-01-24 13:01:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:01:26,268 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:26,269 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:26,270 INFO L371 AbstractCegarLoop]: === Iteration 1 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash 167141018, now seen corresponding path program 1 times [2018-01-24 13:01:26,275 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:26,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:26,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:26,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:26,316 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:26,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:26,569 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:01:26,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:26,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:01:26,572 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:26,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:01:26,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:01:26,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:01:26,594 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-01-24 13:01:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:26,874 INFO L93 Difference]: Finished difference Result 368 states and 442 transitions. [2018-01-24 13:01:26,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:01:26,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:01:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:26,891 INFO L225 Difference]: With dead ends: 368 [2018-01-24 13:01:26,891 INFO L226 Difference]: Without dead ends: 202 [2018-01-24 13:01:26,897 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:01:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-24 13:01:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-01-24 13:01:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-24 13:01:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2018-01-24 13:01:26,953 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 14 [2018-01-24 13:01:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:26,954 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2018-01-24 13:01:26,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:01:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2018-01-24 13:01:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:01:26,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:26,955 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:26,955 INFO L371 AbstractCegarLoop]: === Iteration 2 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:26,955 INFO L82 PathProgramCache]: Analyzing trace with hash 167141019, now seen corresponding path program 1 times [2018-01-24 13:01:26,956 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:26,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:26,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:26,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:26,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:26,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:27,052 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:01:27,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:27,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:01:27,053 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:27,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:01:27,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:01:27,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:01:27,055 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand 4 states. [2018-01-24 13:01:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:27,257 INFO L93 Difference]: Finished difference Result 209 states and 250 transitions. [2018-01-24 13:01:27,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:01:27,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:01:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:27,262 INFO L225 Difference]: With dead ends: 209 [2018-01-24 13:01:27,263 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 13:01:27,264 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:01:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 13:01:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-01-24 13:01:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-24 13:01:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2018-01-24 13:01:27,287 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 14 [2018-01-24 13:01:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:27,288 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2018-01-24 13:01:27,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:01:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2018-01-24 13:01:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:01:27,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:27,289 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:27,289 INFO L371 AbstractCegarLoop]: === Iteration 3 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1430949362, now seen corresponding path program 1 times [2018-01-24 13:01:27,289 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:27,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:27,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:27,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:27,291 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:27,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:27,399 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:01:27,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:27,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:01:27,432 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:27,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:01:27,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:01:27,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:01:27,433 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand 5 states. [2018-01-24 13:01:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:27,594 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-01-24 13:01:27,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:01:27,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:01:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:27,596 INFO L225 Difference]: With dead ends: 206 [2018-01-24 13:01:27,596 INFO L226 Difference]: Without dead ends: 202 [2018-01-24 13:01:27,597 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:01:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-24 13:01:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2018-01-24 13:01:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-24 13:01:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2018-01-24 13:01:27,615 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 17 [2018-01-24 13:01:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:27,615 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2018-01-24 13:01:27,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:01:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2018-01-24 13:01:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:01:27,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:27,617 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:27,617 INFO L371 AbstractCegarLoop]: === Iteration 4 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:27,617 INFO L82 PathProgramCache]: Analyzing trace with hash 752800660, now seen corresponding path program 1 times [2018-01-24 13:01:27,618 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:27,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:27,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:27,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:27,619 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:27,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:27,668 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:01:27,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:27,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:01:27,669 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:27,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:01:27,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:01:27,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:01:27,670 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand 5 states. [2018-01-24 13:01:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:28,030 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-01-24 13:01:28,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:01:28,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 13:01:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:28,032 INFO L225 Difference]: With dead ends: 202 [2018-01-24 13:01:28,032 INFO L226 Difference]: Without dead ends: 201 [2018-01-24 13:01:28,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:01:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-24 13:01:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2018-01-24 13:01:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-24 13:01:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2018-01-24 13:01:28,048 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 19 [2018-01-24 13:01:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:28,048 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2018-01-24 13:01:28,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:01:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2018-01-24 13:01:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:01:28,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:28,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] [2018-01-24 13:01:28,049 INFO L371 AbstractCegarLoop]: === Iteration 5 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:28,050 INFO L82 PathProgramCache]: Analyzing trace with hash 752800661, now seen corresponding path program 1 times [2018-01-24 13:01:28,050 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:28,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:28,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:28,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:28,051 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:28,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:28,121 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:01:28,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:28,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:01:28,121 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:28,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:01:28,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:01:28,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:01:28,122 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand 5 states. [2018-01-24 13:01:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:28,343 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-01-24 13:01:28,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:01:28,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 13:01:28,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:28,347 INFO L225 Difference]: With dead ends: 201 [2018-01-24 13:01:28,347 INFO L226 Difference]: Without dead ends: 200 [2018-01-24 13:01:28,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:01:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-24 13:01:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-01-24 13:01:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 13:01:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2018-01-24 13:01:28,366 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 19 [2018-01-24 13:01:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:28,366 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2018-01-24 13:01:28,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:01:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2018-01-24 13:01:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:01:28,367 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:28,367 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, 1, 1] [2018-01-24 13:01:28,367 INFO L371 AbstractCegarLoop]: === Iteration 6 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash -439424694, now seen corresponding path program 1 times [2018-01-24 13:01:28,368 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:28,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:28,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:28,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:28,369 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:28,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:28,567 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:01:28,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:28,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:01:28,567 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:28,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:01:28,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:01:28,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:01:28,568 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand 5 states. [2018-01-24 13:01:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:28,651 INFO L93 Difference]: Finished difference Result 395 states and 472 transitions. [2018-01-24 13:01:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:01:28,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 13:01:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:28,654 INFO L225 Difference]: With dead ends: 395 [2018-01-24 13:01:28,654 INFO L226 Difference]: Without dead ends: 210 [2018-01-24 13:01:28,656 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:01:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-24 13:01:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-01-24 13:01:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-24 13:01:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2018-01-24 13:01:28,670 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 22 [2018-01-24 13:01:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:28,671 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2018-01-24 13:01:28,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:01:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2018-01-24 13:01:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:01:28,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:28,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:28,673 INFO L371 AbstractCegarLoop]: === Iteration 7 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475983, now seen corresponding path program 1 times [2018-01-24 13:01:28,673 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:28,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:28,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:28,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:28,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:28,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:28,747 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:01:28,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:28,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:01:28,748 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:28,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:01:28,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:01:28,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:01:28,749 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand 6 states. [2018-01-24 13:01:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:28,936 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-01-24 13:01:28,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:01:28,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 13:01:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:28,938 INFO L225 Difference]: With dead ends: 210 [2018-01-24 13:01:28,938 INFO L226 Difference]: Without dead ends: 208 [2018-01-24 13:01:28,939 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:01:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-24 13:01:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-01-24 13:01:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-24 13:01:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2018-01-24 13:01:28,953 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 32 [2018-01-24 13:01:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:28,954 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2018-01-24 13:01:28,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:01:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2018-01-24 13:01:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:01:28,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:28,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:28,955 INFO L371 AbstractCegarLoop]: === Iteration 8 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475984, now seen corresponding path program 1 times [2018-01-24 13:01:28,956 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:28,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:28,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:28,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:28,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:28,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:29,101 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:01:29,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:29,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:01:29,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:29,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:01:29,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:01:29,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:01:29,102 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand 8 states. [2018-01-24 13:01:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:29,345 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2018-01-24 13:01:29,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:01:29,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-24 13:01:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:29,348 INFO L225 Difference]: With dead ends: 208 [2018-01-24 13:01:29,348 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 13:01:29,349 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:01:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 13:01:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-01-24 13:01:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 13:01:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-01-24 13:01:29,361 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 32 [2018-01-24 13:01:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:29,361 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-01-24 13:01:29,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:01:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-01-24 13:01:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:01:29,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:29,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:29,363 INFO L371 AbstractCegarLoop]: === Iteration 9 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1428852052, now seen corresponding path program 1 times [2018-01-24 13:01:29,363 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:29,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:29,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:29,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:29,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:29,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:29,471 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:01:29,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:29,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:01:29,471 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:29,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:01:29,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:01:29,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:01:29,472 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 7 states. [2018-01-24 13:01:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:29,631 INFO L93 Difference]: Finished difference Result 411 states and 498 transitions. [2018-01-24 13:01:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:01:29,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-01-24 13:01:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:29,633 INFO L225 Difference]: With dead ends: 411 [2018-01-24 13:01:29,633 INFO L226 Difference]: Without dead ends: 215 [2018-01-24 13:01:29,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:01:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-24 13:01:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-01-24 13:01:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-24 13:01:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2018-01-24 13:01:29,649 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 33 [2018-01-24 13:01:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:29,650 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2018-01-24 13:01:29,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:01:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2018-01-24 13:01:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:01:29,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:29,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:29,651 INFO L371 AbstractCegarLoop]: === Iteration 10 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1006536674, now seen corresponding path program 1 times [2018-01-24 13:01:29,652 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:29,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:29,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:29,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:29,653 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:29,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:29,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:29,778 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:01:29,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:29,791 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:01:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:29,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:29,934 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:30,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:30,207 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:01:30,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:30,217 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:01:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:30,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:30,286 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:30,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:01:30,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 16 [2018-01-24 13:01:30,590 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:01:30,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:01:30,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:01:30,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:01:30,591 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand 11 states. [2018-01-24 13:01:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:30,884 INFO L93 Difference]: Finished difference Result 435 states and 532 transitions. [2018-01-24 13:01:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:01:30,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-01-24 13:01:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:30,887 INFO L225 Difference]: With dead ends: 435 [2018-01-24 13:01:30,887 INFO L226 Difference]: Without dead ends: 229 [2018-01-24 13:01:30,888 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-01-24 13:01:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-24 13:01:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2018-01-24 13:01:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 13:01:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2018-01-24 13:01:30,910 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 34 [2018-01-24 13:01:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:30,911 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2018-01-24 13:01:30,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:01:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2018-01-24 13:01:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 13:01:30,912 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:30,912 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:01:30,912 INFO L371 AbstractCegarLoop]: === Iteration 11 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:30,913 INFO L82 PathProgramCache]: Analyzing trace with hash -799661844, now seen corresponding path program 2 times [2018-01-24 13:01:30,913 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:30,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:30,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:30,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:30,914 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:30,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:31,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:31,109 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:01:31,120 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:01:31,120 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:01:31,146 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:31,167 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:31,168 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:31,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:31,240 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:31,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:31,434 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:01:31,437 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:01:31,437 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:01:31,460 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:31,597 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:31,613 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:31,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:31,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:31,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:01:31,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8, 8] total 18 [2018-01-24 13:01:31,826 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:01:31,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:01:31,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:01:31,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:01:31,827 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand 12 states. [2018-01-24 13:01:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:32,061 INFO L93 Difference]: Finished difference Result 439 states and 528 transitions. [2018-01-24 13:01:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:01:32,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-01-24 13:01:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:32,063 INFO L225 Difference]: With dead ends: 439 [2018-01-24 13:01:32,063 INFO L226 Difference]: Without dead ends: 227 [2018-01-24 13:01:32,065 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:01:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-24 13:01:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2018-01-24 13:01:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-24 13:01:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 260 transitions. [2018-01-24 13:01:32,078 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 260 transitions. Word has length 35 [2018-01-24 13:01:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:32,078 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 260 transitions. [2018-01-24 13:01:32,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:01:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 260 transitions. [2018-01-24 13:01:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 13:01:32,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:32,079 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:32,080 INFO L371 AbstractCegarLoop]: === Iteration 12 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:32,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1318490590, now seen corresponding path program 3 times [2018-01-24 13:01:32,080 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:32,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:32,081 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:01:32,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:32,081 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:32,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:32,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:32,212 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:01:32,219 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:01:32,219 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:01:32,238 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:01:32,257 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:01:32,285 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:01:32,286 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:32,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:32,405 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:32,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:32,686 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:01:32,691 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:01:32,691 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:01:32,715 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:01:32,855 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:01:33,040 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:01:33,059 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:33,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:33,075 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:33,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:01:33,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 9] total 19 [2018-01-24 13:01:33,172 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:01:33,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:01:33,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:01:33,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-01-24 13:01:33,173 INFO L87 Difference]: Start difference. First operand 217 states and 260 transitions. Second operand 13 states. [2018-01-24 13:01:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:33,395 INFO L93 Difference]: Finished difference Result 443 states and 534 transitions. [2018-01-24 13:01:33,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:01:33,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-24 13:01:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:33,397 INFO L225 Difference]: With dead ends: 443 [2018-01-24 13:01:33,397 INFO L226 Difference]: Without dead ends: 230 [2018-01-24 13:01:33,399 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:01:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-24 13:01:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2018-01-24 13:01:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 13:01:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2018-01-24 13:01:33,411 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2018-01-24 13:01:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:33,411 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2018-01-24 13:01:33,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:01:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2018-01-24 13:01:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 13:01:33,412 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:33,412 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:33,412 INFO L371 AbstractCegarLoop]: === Iteration 13 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1738260692, now seen corresponding path program 4 times [2018-01-24 13:01:33,413 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:33,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:33,414 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:01:33,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:33,414 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:33,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:33,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:33,532 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:01:33,540 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 13:01:33,540 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 13:01:33,575 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:33,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:33,629 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:34,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:34,060 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:01:34,078 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 13:01:34,078 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 13:01:34,223 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:34,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:34,238 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:34,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:01:34,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 21 [2018-01-24 13:01:34,472 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:01:34,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:01:34,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:01:34,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:01:34,473 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 14 states. [2018-01-24 13:01:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:34,757 INFO L93 Difference]: Finished difference Result 447 states and 540 transitions. [2018-01-24 13:01:34,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 13:01:34,757 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-01-24 13:01:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:34,759 INFO L225 Difference]: With dead ends: 447 [2018-01-24 13:01:34,759 INFO L226 Difference]: Without dead ends: 233 [2018-01-24 13:01:34,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 131 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2018-01-24 13:01:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-24 13:01:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-01-24 13:01:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-24 13:01:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2018-01-24 13:01:34,774 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 37 [2018-01-24 13:01:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:34,774 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2018-01-24 13:01:34,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:01:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2018-01-24 13:01:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:01:34,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:34,775 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:34,775 INFO L371 AbstractCegarLoop]: === Iteration 14 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2008269922, now seen corresponding path program 5 times [2018-01-24 13:01:34,776 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:34,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:34,777 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:01:34,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:34,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:34,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:34,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:34,946 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:01:34,956 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 13:01:34,957 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:01:34,967 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:34,970 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:34,975 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:35,003 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:35,006 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:35,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:35,056 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:35,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:35,474 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:01:35,479 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 13:01:35,479 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:01:35,489 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:35,493 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:35,502 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:35,533 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:35,550 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:35,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:35,562 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:35,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:01:35,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 11, 11] total 24 [2018-01-24 13:01:35,846 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:01:35,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:01:35,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:01:35,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-01-24 13:01:35,847 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand 15 states. [2018-01-24 13:01:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:36,123 INFO L93 Difference]: Finished difference Result 451 states and 546 transitions. [2018-01-24 13:01:36,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 13:01:36,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-01-24 13:01:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:36,125 INFO L225 Difference]: With dead ends: 451 [2018-01-24 13:01:36,125 INFO L226 Difference]: Without dead ends: 236 [2018-01-24 13:01:36,126 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2018-01-24 13:01:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-24 13:01:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-01-24 13:01:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-24 13:01:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2018-01-24 13:01:36,134 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 38 [2018-01-24 13:01:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:36,135 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2018-01-24 13:01:36,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:01:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2018-01-24 13:01:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 13:01:36,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:36,136 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:36,136 INFO L371 AbstractCegarLoop]: === Iteration 15 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1788621460, now seen corresponding path program 6 times [2018-01-24 13:01:36,137 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:36,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:36,138 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:01:36,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:36,138 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:36,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:36,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:36,350 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:01:36,357 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 13:01:36,357 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-24 13:01:36,376 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 13:01:36,396 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 13:01:36,422 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 13:01:36,572 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 13:01:36,574 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:36,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:36,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:37,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:37,030 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:01:37,033 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 13:01:37,033 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-24 13:01:37,057 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 13:01:37,212 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 13:01:37,366 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 13:01:37,633 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 13:01:37,666 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:37,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:37,677 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:37,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:01:37,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12, 12, 12] total 26 [2018-01-24 13:01:37,820 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:01:37,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 13:01:37,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 13:01:37,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-01-24 13:01:37,821 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand 16 states. [2018-01-24 13:01:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:38,039 INFO L93 Difference]: Finished difference Result 455 states and 552 transitions. [2018-01-24 13:01:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 13:01:38,039 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-01-24 13:01:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:38,041 INFO L225 Difference]: With dead ends: 455 [2018-01-24 13:01:38,041 INFO L226 Difference]: Without dead ends: 239 [2018-01-24 13:01:38,042 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 13:01:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-24 13:01:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2018-01-24 13:01:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-24 13:01:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-01-24 13:01:38,053 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 39 [2018-01-24 13:01:38,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:38,054 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-01-24 13:01:38,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 13:01:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-01-24 13:01:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 13:01:38,055 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:38,055 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:38,055 INFO L371 AbstractCegarLoop]: === Iteration 16 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:38,055 INFO L82 PathProgramCache]: Analyzing trace with hash 725513566, now seen corresponding path program 7 times [2018-01-24 13:01:38,055 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:38,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:38,056 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:01:38,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:38,057 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:38,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:38,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:38,247 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:01:38,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:38,255 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:01:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:38,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:38,350 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:38,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:38,695 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 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 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:01:38,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:38,698 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:01:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:38,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:38,758 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:38,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:01:38,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13, 13, 13] total 27 [2018-01-24 13:01:38,942 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:01:38,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:01:38,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:01:38,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2018-01-24 13:01:38,943 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 17 states. [2018-01-24 13:01:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:39,176 INFO L93 Difference]: Finished difference Result 459 states and 558 transitions. [2018-01-24 13:01:39,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 13:01:39,176 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-01-24 13:01:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:39,178 INFO L225 Difference]: With dead ends: 459 [2018-01-24 13:01:39,178 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 13:01:39,180 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 13:01:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 13:01:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-01-24 13:01:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-24 13:01:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 270 transitions. [2018-01-24 13:01:39,191 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 270 transitions. Word has length 40 [2018-01-24 13:01:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:39,191 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 270 transitions. [2018-01-24 13:01:39,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:01:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2018-01-24 13:01:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:01:39,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:39,192 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:39,192 INFO L371 AbstractCegarLoop]: === Iteration 17 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:01:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288044, now seen corresponding path program 8 times [2018-01-24 13:01:39,193 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:39,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:39,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:39,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:39,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:39,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 13:01:39,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:39,487 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:01:39,492 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:01:39,492 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:01:39,510 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:39,533 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:01:39,536 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:01:39,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:39,555 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:01:39,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:39,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:39,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:01:39,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:39,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:39,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 13:01:39,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:39,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:39,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-24 13:01:39,654 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 13 treesize of output 10 [2018-01-24 13:01:39,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:01:39,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:39,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:39,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:39,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-24 13:01:39,712 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:01:39,714 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 14 treesize of output 10 [2018-01-24 13:01:39,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:39,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:39,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:39,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-24 13:01:40,562 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 82 treesize of output 76 [2018-01-24 13:01:40,567 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 51 treesize of output 54 [2018-01-24 13:01:40,578 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 54 treesize of output 56 [2018-01-24 13:01:40,596 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 56 treesize of output 58 [2018-01-24 13:01:40,635 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 58 treesize of output 60 [2018-01-24 13:01:40,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-01-24 13:01:40,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-01-24 13:01:40,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-01-24 13:01:40,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-01-24 13:01:40,927 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:40,942 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:40,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:40,971 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:40,985 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:40,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:41,072 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:104, output treesize:164 [2018-01-24 13:01:41,208 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 157 treesize of output 109 [2018-01-24 13:01:41,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:41,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 148 [2018-01-24 13:01:41,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:41,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:165, output treesize:150 [2018-01-24 13:01:41,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 113 [2018-01-24 13:01:41,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:41,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 150 [2018-01-24 13:01:41,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:41,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:169, output treesize:150 [2018-01-24 13:01:41,590 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 129 treesize of output 75 [2018-01-24 13:01:41,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-24 13:01:41,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-01-24 13:01:41,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:41,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:41,651 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:134, output treesize:15 [2018-01-24 13:01:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 28 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:41,716 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:41,938 WARN L143 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 63 [2018-01-24 13:01:42,612 WARN L146 SmtUtils]: Spent 591ms on a formula simplification. DAG size of input: 90 DAG size of output 88 [2018-01-24 13:01:42,853 WARN L143 SmtUtils]: Spent 239ms on a formula simplification that was a NOOP. DAG size: 70 [2018-01-24 13:01:43,162 WARN L143 SmtUtils]: Spent 308ms on a formula simplification that was a NOOP. DAG size: 74 [2018-01-24 13:01:43,496 WARN L143 SmtUtils]: Spent 332ms on a formula simplification that was a NOOP. DAG size: 74 [2018-01-24 13:01:43,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:43,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:43,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:43,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:16 [2018-01-24 13:01:43,657 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:43,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:43,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:43,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2018-01-24 13:01:43,878 WARN L143 SmtUtils]: Spent 174ms on a formula simplification that was a NOOP. DAG size: 63 [2018-01-24 13:01:53,236 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 76 treesize of output 68 [2018-01-24 13:01:53,252 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 11 treesize of output 10 [2018-01-24 13:01:53,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,264 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 25 treesize of output 21 [2018-01-24 13:01:53,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-01-24 13:01:53,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,276 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 73 treesize of output 75 [2018-01-24 13:01:53,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 75 [2018-01-24 13:01:53,313 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 3 case distinctions, treesize of input 66 treesize of output 90 [2018-01-24 13:01:53,317 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:53,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 86 [2018-01-24 13:01:53,323 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:53,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 69 [2018-01-24 13:01:53,333 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:53,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 72 [2018-01-24 13:01:53,347 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:53,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 75 [2018-01-24 13:01:53,365 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:53,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 78 [2018-01-24 13:01:53,425 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:53,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:53,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2018-01-24 13:01:53,452 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,455 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:53,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 16 [2018-01-24 13:01:53,474 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,483 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,486 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,490 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,493 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,500 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,549 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 60 treesize of output 63 [2018-01-24 13:01:53,555 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 54 [2018-01-24 13:01:53,563 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 54 treesize of output 57 [2018-01-24 13:01:53,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 60 [2018-01-24 13:01:53,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 63 [2018-01-24 13:01:53,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 8 [2018-01-24 13:01:53,682 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:53,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 14 [2018-01-24 13:01:53,704 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,710 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,712 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,714 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,715 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,720 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:53,763 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 68 treesize of output 71 [2018-01-24 13:01:53,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-01-24 13:01:53,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-01-24 13:01:53,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 76 [2018-01-24 13:01:53,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-01-24 13:01:53,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 1 [2018-01-24 13:01:53,881 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,882 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,883 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,884 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,885 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,887 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:53,932 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 4 case distinctions, treesize of input 69 treesize of output 105 [2018-01-24 13:01:53,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:53,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-01-24 13:01:53,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-01-24 13:01:53,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 76 [2018-01-24 13:01:54,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-01-24 13:01:54,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 1 [2018-01-24 13:01:54,090 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,091 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,092 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,093 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,095 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 120 [2018-01-24 13:01:54,170 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,173 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,177 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 120 [2018-01-24 13:01:54,212 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,216 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,219 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,221 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 130 [2018-01-24 13:01:54,248 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,253 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,257 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,260 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:54,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 116 [2018-01-24 13:01:54,345 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,350 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,354 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,357 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 29 [2018-01-24 13:01:54,363 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,376 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,463 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,469 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,473 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,476 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,478 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 154 [2018-01-24 13:01:54,572 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,576 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,579 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,581 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,583 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 36 [2018-01-24 13:01:54,585 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,602 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:54,707 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,713 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,718 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,721 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:54,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 145 [2018-01-24 13:01:55,174 WARN L146 SmtUtils]: Spent 421ms on a formula simplification. DAG size of input: 156 DAG size of output 147 [2018-01-24 13:01:55,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,187 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,191 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,194 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:55,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 52 [2018-01-24 13:01:55,202 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:55,336 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,341 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,345 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,351 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 91 [2018-01-24 13:01:55,371 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-01-24 13:01:55,379 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,384 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,388 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,394 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 89 [2018-01-24 13:01:55,414 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-01-24 13:01:55,572 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,575 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,577 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,579 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,581 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,583 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,583 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,585 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,586 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,586 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:55,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 117 [2018-01-24 13:01:55,589 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:55,651 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 13:01:55,712 INFO L267 ElimStorePlain]: Start of recursive call 37: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 13:01:55,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 101 [2018-01-24 13:01:55,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:01:55,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:01:55,896 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:55,904 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,908 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,912 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,915 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:55,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 70 [2018-01-24 13:01:55,937 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:55,966 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:55,984 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:56,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 31 [2018-01-24 13:01:56,063 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,126 INFO L267 ElimStorePlain]: Start of recursive call 36: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:01:56,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 135 [2018-01-24 13:01:56,253 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,256 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,258 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,260 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 106 treesize of output 137 [2018-01-24 13:01:56,269 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,273 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,276 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,278 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 99 [2018-01-24 13:01:56,316 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,320 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,323 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,325 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2018-01-24 13:01:56,328 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,347 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,347 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,351 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,352 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,355 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,355 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,358 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,358 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:56,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 70 [2018-01-24 13:01:56,365 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,388 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,402 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2018-01-24 13:01:56,475 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:56,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 80 [2018-01-24 13:01:56,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-01-24 13:01:56,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 1 [2018-01-24 13:01:56,642 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,645 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,653 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:56,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 150 [2018-01-24 13:01:56,753 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:01:56,762 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,767 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,771 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,774 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,778 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:56,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 140 [2018-01-24 13:01:57,231 WARN L146 SmtUtils]: Spent 430ms on a formula simplification. DAG size of input: 156 DAG size of output 149 [2018-01-24 13:01:57,237 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,240 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,242 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,245 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,245 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,248 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,249 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,249 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,250 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:57,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 110 [2018-01-24 13:01:57,255 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:57,438 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,443 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,447 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,449 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,453 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,454 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 81 [2018-01-24 13:01:57,464 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-01-24 13:01:57,473 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,477 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,481 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,484 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,488 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,489 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 79 [2018-01-24 13:01:57,499 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-01-24 13:01:57,614 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,617 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,618 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,620 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,621 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,623 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,623 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,624 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:57,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 95 [2018-01-24 13:01:57,626 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:57,712 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,716 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,719 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:57,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:57,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 59 [2018-01-24 13:01:57,725 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:57,770 INFO L267 ElimStorePlain]: Start of recursive call 62: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:01:57,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 83 [2018-01-24 13:01:57,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-01-24 13:01:57,937 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:57,940 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:58,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 111 [2018-01-24 13:01:58,078 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,083 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,087 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,090 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,095 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 65 [2018-01-24 13:01:58,111 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:01:58,134 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:58,171 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 10 [2018-01-24 13:01:58,236 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:58,268 INFO L267 ElimStorePlain]: Start of recursive call 61: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:01:58,310 INFO L267 ElimStorePlain]: Start of recursive call 52: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 13:01:58,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 91 [2018-01-24 13:01:58,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-01-24 13:01:58,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:01:58,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:01:58,456 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:58,464 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,469 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,478 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 75 [2018-01-24 13:01:58,500 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,524 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,536 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,555 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,614 INFO L267 ElimStorePlain]: Start of recursive call 35: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:01:58,708 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 78 treesize of output 81 [2018-01-24 13:01:58,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-01-24 13:01:58,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-01-24 13:01:58,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:01:58,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:01:58,790 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:58,797 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,801 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:58,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 80 [2018-01-24 13:01:58,835 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,857 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,869 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,881 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,898 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:58,930 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:01:58,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:01:58,987 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 58 treesize of output 61 [2018-01-24 13:01:58,993 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 56 treesize of output 59 [2018-01-24 13:01:59,000 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 62 [2018-01-24 13:01:59,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-01-24 13:01:59,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-01-24 13:01:59,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:01:59,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 90 [2018-01-24 13:01:59,134 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-24 13:01:59,135 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:59,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:01:59,154 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,174 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:59,190 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:59,206 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:59,222 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:59,237 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:59,256 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:01:59,284 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:01:59,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:01:59,339 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-01-24 13:01:59,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 70 [2018-01-24 13:01:59,353 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 64 [2018-01-24 13:01:59,357 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 56 treesize of output 59 [2018-01-24 13:01:59,365 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 62 [2018-01-24 13:01:59,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-01-24 13:01:59,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-01-24 13:01:59,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:01:59,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:59,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 14 [2018-01-24 13:01:59,473 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:01:59,494 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,500 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,502 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,503 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,504 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,506 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,508 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 85 [2018-01-24 13:01:59,539 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 68 treesize of output 71 [2018-01-24 13:01:59,546 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 62 [2018-01-24 13:01:59,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-01-24 13:01:59,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-01-24 13:01:59,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:01:59,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:01:59,625 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:59,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 14 [2018-01-24 13:01:59,653 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,660 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,661 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,663 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,664 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,668 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,709 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 95 [2018-01-24 13:01:59,729 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,731 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 105 [2018-01-24 13:01:59,755 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,758 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 105 [2018-01-24 13:01:59,771 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,774 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 82 [2018-01-24 13:01:59,786 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,790 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-01-24 13:01:59,828 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,832 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,832 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,836 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:59,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 42 [2018-01-24 13:01:59,850 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,853 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,857 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 23 [2018-01-24 13:01:59,870 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,883 INFO L267 ElimStorePlain]: Start of recursive call 115: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,887 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,895 INFO L267 ElimStorePlain]: Start of recursive call 113: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:59,959 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,962 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:59,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 91 [2018-01-24 13:01:59,975 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,979 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2018-01-24 13:01:59,995 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:59,999 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 93 [2018-01-24 13:02:00,055 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,060 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 15 [2018-01-24 13:02:00,073 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,077 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,081 INFO L267 ElimStorePlain]: Start of recursive call 119: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,086 INFO L267 ElimStorePlain]: Start of recursive call 118: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,137 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,139 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,142 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 115 [2018-01-24 13:02:00,151 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,154 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,158 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2018-01-24 13:02:00,167 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,171 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,175 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 92 [2018-01-24 13:02:00,209 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,212 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,216 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 30 [2018-01-24 13:02:00,224 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,228 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,232 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,232 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,236 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,236 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:00,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2018-01-24 13:02:00,247 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,258 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,263 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,272 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,307 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,310 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 120 [2018-01-24 13:02:00,342 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,345 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:00,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 94 [2018-01-24 13:02:00,361 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,365 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 93 [2018-01-24 13:02:00,424 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,429 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 15 [2018-01-24 13:02:00,443 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,446 INFO L267 ElimStorePlain]: Start of recursive call 129: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,451 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,508 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,511 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 135 [2018-01-24 13:02:00,549 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,554 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:00,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 97 [2018-01-24 13:02:00,610 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,615 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 20 [2018-01-24 13:02:00,627 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,632 INFO L267 ElimStorePlain]: Start of recursive call 132: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,747 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,751 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,754 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,757 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,759 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 149 [2018-01-24 13:02:00,829 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,830 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,833 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,834 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,836 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,838 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,842 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,843 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,843 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:00,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 77 [2018-01-24 13:02:00,845 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,862 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:00,902 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,906 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:00,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 150 [2018-01-24 13:02:01,196 WARN L146 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 154 DAG size of output 151 [2018-01-24 13:02:01,203 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,207 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:01,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 24 [2018-01-24 13:02:01,220 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:01,341 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,346 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 95 treesize of output 87 [2018-01-24 13:02:01,379 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 2 xjuncts. [2018-01-24 13:02:01,386 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,390 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 88 [2018-01-24 13:02:01,423 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 2 xjuncts. [2018-01-24 13:02:01,511 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,513 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,516 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,518 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,519 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,521 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,522 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,524 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,524 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,524 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:01,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112 [2018-01-24 13:02:01,527 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:01,628 INFO L267 ElimStorePlain]: Start of recursive call 136: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 13:02:01,689 INFO L267 ElimStorePlain]: Start of recursive call 131: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 13:02:01,774 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,777 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,780 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,781 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 101 treesize of output 132 [2018-01-24 13:02:01,791 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,795 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,798 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,800 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 99 [2018-01-24 13:02:01,839 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,839 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,843 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,844 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,847 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,847 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,849 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,850 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:01,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 70 [2018-01-24 13:02:01,856 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:01,863 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,867 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,870 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,872 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:01,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2018-01-24 13:02:01,875 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:01,896 INFO L267 ElimStorePlain]: Start of recursive call 142: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:01,908 INFO L267 ElimStorePlain]: Start of recursive call 141: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,028 INFO L267 ElimStorePlain]: Start of recursive call 127: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-01-24 13:02:02,098 INFO L267 ElimStorePlain]: Start of recursive call 112: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-24 13:02:02,210 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 80 [2018-01-24 13:02:02,215 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-01-24 13:02:02,221 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 67 [2018-01-24 13:02:02,231 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-01-24 13:02:02,262 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,264 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:02,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 28 [2018-01-24 13:02:02,276 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,279 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 16 [2018-01-24 13:02:02,290 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,297 INFO L267 ElimStorePlain]: Start of recursive call 148: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,300 INFO L267 ElimStorePlain]: Start of recursive call 147: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,302 INFO L267 ElimStorePlain]: Start of recursive call 146: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,308 INFO L267 ElimStorePlain]: Start of recursive call 145: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,410 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,411 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 98 [2018-01-24 13:02:02,417 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,419 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2018-01-24 13:02:02,428 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,430 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 82 [2018-01-24 13:02:02,443 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,447 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-01-24 13:02:02,485 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,487 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,489 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,491 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:02,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 42 [2018-01-24 13:02:02,504 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,509 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,512 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 23 [2018-01-24 13:02:02,524 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,536 INFO L267 ElimStorePlain]: Start of recursive call 154: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,539 INFO L267 ElimStorePlain]: Start of recursive call 153: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,543 INFO L267 ElimStorePlain]: Start of recursive call 152: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,549 INFO L267 ElimStorePlain]: Start of recursive call 151: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,637 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:02,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-01-24 13:02:02,645 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 72 [2018-01-24 13:02:02,655 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 75 [2018-01-24 13:02:02,670 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 78 [2018-01-24 13:02:02,717 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 13 [2018-01-24 13:02:02,731 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,734 INFO L267 ElimStorePlain]: Start of recursive call 160: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,737 INFO L267 ElimStorePlain]: Start of recursive call 159: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,739 INFO L267 ElimStorePlain]: Start of recursive call 158: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,743 INFO L267 ElimStorePlain]: Start of recursive call 157: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:02,812 INFO L267 ElimStorePlain]: Start of recursive call 111: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-01-24 13:02:02,909 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 81 [2018-01-24 13:02:02,914 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 69 [2018-01-24 13:02:02,921 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 72 [2018-01-24 13:02:02,931 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 75 [2018-01-24 13:02:02,946 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 78 [2018-01-24 13:02:02,985 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:02,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:03,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2018-01-24 13:02:03,007 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,009 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 16 [2018-01-24 13:02:03,026 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,033 INFO L267 ElimStorePlain]: Start of recursive call 166: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,036 INFO L267 ElimStorePlain]: Start of recursive call 165: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,039 INFO L267 ElimStorePlain]: Start of recursive call 164: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,042 INFO L267 ElimStorePlain]: Start of recursive call 163: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,047 INFO L267 ElimStorePlain]: Start of recursive call 162: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,150 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 4 case distinctions, treesize of input 64 treesize of output 100 [2018-01-24 13:02:03,155 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,157 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 105 [2018-01-24 13:02:03,179 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:03,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 91 [2018-01-24 13:02:03,195 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,199 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2018-01-24 13:02:03,216 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,221 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 93 [2018-01-24 13:02:03,286 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,290 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 15 [2018-01-24 13:02:03,303 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,307 INFO L267 ElimStorePlain]: Start of recursive call 173: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,311 INFO L267 ElimStorePlain]: Start of recursive call 172: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,317 INFO L267 ElimStorePlain]: Start of recursive call 171: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,378 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,380 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,382 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 115 [2018-01-24 13:02:03,389 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,392 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,395 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2018-01-24 13:02:03,404 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,408 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,412 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 92 [2018-01-24 13:02:03,449 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,453 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,453 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,457 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,457 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:03,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2018-01-24 13:02:03,469 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,473 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,477 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,481 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 30 [2018-01-24 13:02:03,489 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,500 INFO L267 ElimStorePlain]: Start of recursive call 177: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,504 INFO L267 ElimStorePlain]: Start of recursive call 176: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,513 INFO L267 ElimStorePlain]: Start of recursive call 175: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,547 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,550 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 120 [2018-01-24 13:02:03,580 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,583 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,585 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,586 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 101 treesize of output 132 [2018-01-24 13:02:03,595 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,599 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,603 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,605 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 99 [2018-01-24 13:02:03,642 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,646 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,649 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,653 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2018-01-24 13:02:03,656 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,662 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,664 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,667 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,668 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,670 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,671 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,675 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,677 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:03,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 70 [2018-01-24 13:02:03,680 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,702 INFO L267 ElimStorePlain]: Start of recursive call 182: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,714 INFO L267 ElimStorePlain]: Start of recursive call 181: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,792 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,796 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:03,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 94 [2018-01-24 13:02:03,812 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,817 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 93 [2018-01-24 13:02:03,879 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,883 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 20 [2018-01-24 13:02:03,897 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,901 INFO L267 ElimStorePlain]: Start of recursive call 186: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,906 INFO L267 ElimStorePlain]: Start of recursive call 185: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:03,954 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,957 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:03,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 135 [2018-01-24 13:02:03,998 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,003 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:04,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 97 [2018-01-24 13:02:04,063 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,067 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 15 [2018-01-24 13:02:04,080 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:04,085 INFO L267 ElimStorePlain]: Start of recursive call 189: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:04,154 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,158 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,162 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,164 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,165 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 149 [2018-01-24 13:02:04,242 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,242 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,246 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,247 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,250 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,251 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,253 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,253 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,257 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,257 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:04,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2018-01-24 13:02:04,259 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:04,279 INFO L267 ElimStorePlain]: Start of recursive call 191: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:04,320 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,324 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 150 [2018-01-24 13:02:04,721 WARN L146 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 154 DAG size of output 151 [2018-01-24 13:02:04,731 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,737 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,741 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,747 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,749 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,749 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 79 [2018-01-24 13:02:04,760 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 2 xjuncts. [2018-01-24 13:02:04,769 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,775 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,780 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,786 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,787 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,788 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 81 [2018-01-24 13:02:04,799 INFO L267 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 2 xjuncts. [2018-01-24 13:02:04,808 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,813 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,817 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,823 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,825 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,826 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 82 [2018-01-24 13:02:04,838 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 2 xjuncts. [2018-01-24 13:02:04,988 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,990 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,992 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:04,994 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:05,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 46 [2018-01-24 13:02:05,008 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:05,114 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,118 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:05,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 24 [2018-01-24 13:02:05,132 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:05,209 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,212 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,213 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,216 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,217 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,220 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,220 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,221 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,221 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:05,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:05,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 105 [2018-01-24 13:02:05,226 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:05,284 INFO L267 ElimStorePlain]: Start of recursive call 193: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 13:02:05,403 INFO L267 ElimStorePlain]: Start of recursive call 188: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 13:02:05,531 INFO L267 ElimStorePlain]: Start of recursive call 180: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-01-24 13:02:05,669 INFO L267 ElimStorePlain]: Start of recursive call 170: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-24 13:02:05,786 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 71 treesize of output 74 [2018-01-24 13:02:05,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-01-24 13:02:05,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-01-24 13:02:05,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:02:05,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:05,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 14 [2018-01-24 13:02:05,882 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:05,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:02:05,899 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:05,904 INFO L267 ElimStorePlain]: Start of recursive call 203: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:05,906 INFO L267 ElimStorePlain]: Start of recursive call 202: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:05,907 INFO L267 ElimStorePlain]: Start of recursive call 201: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:05,910 INFO L267 ElimStorePlain]: Start of recursive call 200: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,005 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,006 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,008 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 98 [2018-01-24 13:02:06,012 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,014 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2018-01-24 13:02:06,022 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,024 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 82 [2018-01-24 13:02:06,036 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,040 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-01-24 13:02:06,082 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,085 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,087 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,090 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:06,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 42 [2018-01-24 13:02:06,105 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,109 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,112 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 23 [2018-01-24 13:02:06,123 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,132 INFO L267 ElimStorePlain]: Start of recursive call 209: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,135 INFO L267 ElimStorePlain]: Start of recursive call 208: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,138 INFO L267 ElimStorePlain]: Start of recursive call 207: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,145 INFO L267 ElimStorePlain]: Start of recursive call 206: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 115 [2018-01-24 13:02:06,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2018-01-24 13:02:06,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-01-24 13:02:06,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:02:06,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:06,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 14 [2018-01-24 13:02:06,341 INFO L267 ElimStorePlain]: Start of recursive call 216: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:02:06,359 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,364 INFO L267 ElimStorePlain]: Start of recursive call 215: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,365 INFO L267 ElimStorePlain]: Start of recursive call 214: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,368 INFO L267 ElimStorePlain]: Start of recursive call 213: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,422 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,424 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,426 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,429 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 115 [2018-01-24 13:02:06,432 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,435 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,438 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2018-01-24 13:02:06,446 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,450 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,453 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 92 [2018-01-24 13:02:06,489 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,493 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,493 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,497 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,497 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:06,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2018-01-24 13:02:06,509 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,512 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,516 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,520 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:06,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 30 [2018-01-24 13:02:06,529 INFO L267 ElimStorePlain]: Start of recursive call 222: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,539 INFO L267 ElimStorePlain]: Start of recursive call 220: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,544 INFO L267 ElimStorePlain]: Start of recursive call 219: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,553 INFO L267 ElimStorePlain]: Start of recursive call 218: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:06,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2018-01-24 13:02:06,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 76 [2018-01-24 13:02:06,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-01-24 13:02:06,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 5 [2018-01-24 13:02:06,695 INFO L267 ElimStorePlain]: Start of recursive call 226: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,696 INFO L267 ElimStorePlain]: Start of recursive call 225: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,697 INFO L267 ElimStorePlain]: Start of recursive call 224: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,699 INFO L267 ElimStorePlain]: Start of recursive call 223: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 130 [2018-01-24 13:02:06,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 80 [2018-01-24 13:02:06,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-24 13:02:06,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:06,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 14 [2018-01-24 13:02:06,841 INFO L267 ElimStorePlain]: Start of recursive call 230: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 8 [2018-01-24 13:02:06,859 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,865 INFO L267 ElimStorePlain]: Start of recursive call 229: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,869 INFO L267 ElimStorePlain]: Start of recursive call 228: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:06,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:06,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 80 [2018-01-24 13:02:06,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-01-24 13:02:07,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 5 [2018-01-24 13:02:07,019 INFO L267 ElimStorePlain]: Start of recursive call 234: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,020 INFO L267 ElimStorePlain]: Start of recursive call 233: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,022 INFO L267 ElimStorePlain]: Start of recursive call 232: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,074 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,077 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,079 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,080 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 101 treesize of output 132 [2018-01-24 13:02:07,089 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,093 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,096 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,098 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 99 [2018-01-24 13:02:07,134 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,138 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,141 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,145 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2018-01-24 13:02:07,146 INFO L267 ElimStorePlain]: Start of recursive call 237: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,154 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,154 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,158 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,158 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,161 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,161 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,166 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,166 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:07,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 70 [2018-01-24 13:02:07,169 INFO L267 ElimStorePlain]: Start of recursive call 238: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,191 INFO L267 ElimStorePlain]: Start of recursive call 236: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,203 INFO L267 ElimStorePlain]: Start of recursive call 235: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 145 [2018-01-24 13:02:07,273 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:02:07,279 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,283 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,286 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,288 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,291 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 149 [2018-01-24 13:02:07,356 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,360 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,363 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,367 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,367 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:07,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 36 [2018-01-24 13:02:07,368 INFO L267 ElimStorePlain]: Start of recursive call 241: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,382 INFO L267 ElimStorePlain]: Start of recursive call 240: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:07,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 83 [2018-01-24 13:02:07,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 1 [2018-01-24 13:02:07,522 INFO L267 ElimStorePlain]: Start of recursive call 243: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,524 INFO L267 ElimStorePlain]: Start of recursive call 242: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:07,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 76 treesize of output 160 [2018-01-24 13:02:07,648 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-24 13:02:07,981 WARN L146 SmtUtils]: Spent 330ms on a formula simplification. DAG size of input: 154 DAG size of output 151 [2018-01-24 13:02:08,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:08,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 10 [2018-01-24 13:02:08,005 INFO L267 ElimStorePlain]: Start of recursive call 245: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:08,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 97 [2018-01-24 13:02:08,158 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-24 13:02:08,159 INFO L267 ElimStorePlain]: Start of recursive call 246: End of recursive call: and 2 xjuncts. [2018-01-24 13:02:08,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 98 [2018-01-24 13:02:08,208 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-24 13:02:08,209 INFO L267 ElimStorePlain]: Start of recursive call 247: End of recursive call: and 2 xjuncts. [2018-01-24 13:02:08,346 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,350 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,351 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,367 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,367 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,370 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,371 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,371 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,372 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:02:08,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:08,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 105 [2018-01-24 13:02:08,377 INFO L267 ElimStorePlain]: Start of recursive call 248: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:08,434 INFO L267 ElimStorePlain]: Start of recursive call 244: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 13:02:08,494 INFO L267 ElimStorePlain]: Start of recursive call 239: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 13:02:08,556 INFO L267 ElimStorePlain]: Start of recursive call 227: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-01-24 13:02:08,621 INFO L267 ElimStorePlain]: Start of recursive call 212: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-24 13:02:08,698 INFO L267 ElimStorePlain]: Start of recursive call 169: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-01-24 13:02:08,775 INFO L267 ElimStorePlain]: Start of recursive call 103: 4 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-01-24 13:02:08,826 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-01-24 13:02:08,871 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-01-24 13:02:08,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-01-24 13:02:08,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:02:08,980 INFO L202 ElimStorePlain]: Needed 248 recursive calls to eliminate 10 variables, input treesize:76, output treesize:25 [2018-01-24 13:02:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-24 13:02:09,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-24 13:02:09,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [15, 21] total 42 [2018-01-24 13:02:09,109 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:09,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:02:09,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:02:09,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1368, Unknown=290, NotChecked=0, Total=1806 [2018-01-24 13:02:09,110 INFO L87 Difference]: Start difference. First operand 222 states and 270 transitions. Second operand 12 states. [2018-01-24 13:02:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:13,410 INFO L93 Difference]: Finished difference Result 229 states and 281 transitions. [2018-01-24 13:02:13,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:02:13,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-24 13:02:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:13,412 INFO L225 Difference]: With dead ends: 229 [2018-01-24 13:02:13,412 INFO L226 Difference]: Without dead ends: 228 [2018-01-24 13:02:13,413 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=198, Invalid=1962, Unknown=290, NotChecked=0, Total=2450 [2018-01-24 13:02:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-24 13:02:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 221. [2018-01-24 13:02:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-24 13:02:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 269 transitions. [2018-01-24 13:02:13,426 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 269 transitions. Word has length 41 [2018-01-24 13:02:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:13,426 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 269 transitions. [2018-01-24 13:02:13,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:02:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 269 transitions. [2018-01-24 13:02:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:02:13,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:13,427 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:13,427 INFO L371 AbstractCegarLoop]: === Iteration 18 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:02:13,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288045, now seen corresponding path program 1 times [2018-01-24 13:02:13,427 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:13,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:13,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:02:13,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:13,428 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:13,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 13:02:13,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:13,894 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:02:13,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:13,913 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:13,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:13,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:02:13,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:13,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:13,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:13,973 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:02:13,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:13,977 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:02:13,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-01-24 13:02:14,002 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 13 treesize of output 10 [2018-01-24 13:02:14,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:02:14,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 13:02:14,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:02:14,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:02:14,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:38 [2018-01-24 13:02:14,072 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 26 treesize of output 22 [2018-01-24 13:02:14,074 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 22 treesize of output 14 [2018-01-24 13:02:14,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:02:14,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:02:14,084 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 9 treesize of output 7 [2018-01-24 13:02:14,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-24 13:02:14,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:02:14,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2018-01-24 13:02:14,117 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_22 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_22))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_786| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_786|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 (mod |c_#Ultimate.C_memset_#value| 256))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0))))))) is different from true [2018-01-24 13:02:14,125 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_786| Int) (|v_#Ultimate.C_memset_#t~loopctr54_787| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_786|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_787|))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_22 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_22)))) is different from true [2018-01-24 13:02:14,133 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_22 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_22))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_788| Int) (|v_#Ultimate.C_memset_#t~loopctr54_786| Int) (|v_#Ultimate.C_memset_#t~loopctr54_787| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_786|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_787|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_788|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0))))))) is different from true [2018-01-24 13:02:14,142 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_22 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_22))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_788| Int) (|v_#Ultimate.C_memset_#t~loopctr54_789| Int) (|v_#Ultimate.C_memset_#t~loopctr54_786| Int) (|v_#Ultimate.C_memset_#t~loopctr54_787| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_786|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_787|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_788|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_789|))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0))))))) is different from true [2018-01-24 13:02:14,153 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_22 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_22))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_790| Int) (|v_#Ultimate.C_memset_#t~loopctr54_788| Int) (|v_#Ultimate.C_memset_#t~loopctr54_789| Int) (|v_#Ultimate.C_memset_#t~loopctr54_786| Int) (|v_#Ultimate.C_memset_#t~loopctr54_787| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_786|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_787|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_788|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_789|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_790| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0))))))) is different from true [2018-01-24 13:02:14,162 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_22 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_22))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_791| Int) (|v_#Ultimate.C_memset_#t~loopctr54_790| Int) (|v_#Ultimate.C_memset_#t~loopctr54_788| Int) (|v_#Ultimate.C_memset_#t~loopctr54_789| Int) (|v_#Ultimate.C_memset_#t~loopctr54_786| Int) (|v_#Ultimate.C_memset_#t~loopctr54_787| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_786|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_787|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_788|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_789|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_790| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_791| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse6 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse6) .cse1 .cse6) .cse2 .cse6) .cse3 .cse6) .cse4 .cse6) .cse5 .cse6)))))))) is different from true [2018-01-24 13:02:14,174 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_22 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_22))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_791| Int) (|v_#Ultimate.C_memset_#t~loopctr54_792| Int) (|v_#Ultimate.C_memset_#t~loopctr54_790| Int) (|v_#Ultimate.C_memset_#t~loopctr54_788| Int) (|v_#Ultimate.C_memset_#t~loopctr54_789| Int) (|v_#Ultimate.C_memset_#t~loopctr54_786| Int) (|v_#Ultimate.C_memset_#t~loopctr54_787| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_786|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_787|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_788|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_789|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_790| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_791| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_792| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse7 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse7) .cse1 .cse7) .cse2 .cse7) .cse3 .cse7) .cse4 .cse7) .cse5 .cse7) .cse6 .cse7))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-01-24 13:02:14,186 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_22 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_22))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_791| Int) (|v_#Ultimate.C_memset_#t~loopctr54_792| Int) (|v_#Ultimate.C_memset_#t~loopctr54_790| Int) (|v_#Ultimate.C_memset_#t~loopctr54_793| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr54_788| Int) (|v_#Ultimate.C_memset_#t~loopctr54_789| Int) (|v_#Ultimate.C_memset_#t~loopctr54_786| Int) (|v_#Ultimate.C_memset_#t~loopctr54_787| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_786|)) (.cse2 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_787|)) (.cse3 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_788|)) (.cse4 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_789|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_790| |#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_791| |#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_792| |#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |v_#Ultimate.C_memset_#t~loopctr54_793| |#Ultimate.C_memset_#ptr.offset|))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0))))))) is different from true [2018-01-24 13:02:14,242 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 162 treesize of output 156 [2018-01-24 13:02:14,247 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 51 treesize of output 54 [2018-01-24 13:02:14,255 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 54 treesize of output 56 [2018-01-24 13:02:14,276 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 56 treesize of output 58 [2018-01-24 13:02:14,318 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 58 treesize of output 60 [2018-01-24 13:02:14,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-01-24 13:02:14,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-01-24 13:02:14,611 INFO L303 Elim1Store]: Index analysis took 135 ms [2018-01-24 13:02:14,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-01-24 13:02:14,753 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-01-24 13:02:14,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-01-24 13:02:14,754 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,799 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,896 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,941 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:14,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,249 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 86 treesize of output 87 [2018-01-24 13:02:15,253 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 67 treesize of output 70 [2018-01-24 13:02:15,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2018-01-24 13:02:15,264 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 72 treesize of output 74 [2018-01-24 13:02:15,289 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 74 treesize of output 76 [2018-01-24 13:02:15,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 78 [2018-01-24 13:02:15,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2018-01-24 13:02:15,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-01-24 13:02:15,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 137 [2018-01-24 13:02:15,380 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,400 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,419 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,438 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,458 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,478 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,498 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,516 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,539 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2018-01-24 13:02:15,592 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:183, output treesize:303 [2018-01-24 13:02:15,693 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 297 treesize of output 233 [2018-01-24 13:02:15,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:15,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 288 [2018-01-24 13:02:15,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,813 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 161 treesize of output 166 [2018-01-24 13:02:15,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:15,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 13:02:15,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-24 13:02:15,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:324, output treesize:294 [2018-01-24 13:02:15,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 170 [2018-01-24 13:02:15,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:15,904 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 24 treesize of output 18 [2018-01-24 13:02:15,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:15,998 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 301 treesize of output 237 [2018-01-24 13:02:16,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:02:16,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 290 [2018-01-24 13:02:16,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:16,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:16,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-24 13:02:16,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:332, output treesize:294 [2018-01-24 13:02:16,324 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 291 treesize of output 205 [2018-01-24 13:02:16,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 102 [2018-01-24 13:02:16,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:16,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-01-24 13:02:16,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:16,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:16,447 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 107 treesize of output 91 [2018-01-24 13:02:16,450 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:02:16,450 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:16,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 1 [2018-01-24 13:02:16,497 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:02:16,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:02:16,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:02:16,503 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:312, output treesize:16 [2018-01-24 13:02:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2018-01-24 13:02:16,547 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:17,617 WARN L143 SmtUtils]: Spent 977ms on a formula simplification that was a NOOP. DAG size: 105 [2018-01-24 13:02:18,789 WARN L143 SmtUtils]: Spent 1058ms on a formula simplification that was a NOOP. DAG size: 122 [2018-01-24 13:02:20,008 WARN L143 SmtUtils]: Spent 1217ms on a formula simplification that was a NOOP. DAG size: 104 Received shutdown request... [2018-01-24 13:02:20,272 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:02:20,272 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:02:20,278 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:02:20,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:02:20 BoogieIcfgContainer [2018-01-24 13:02:20,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:02:20,279 INFO L168 Benchmark]: Toolchain (without parser) took 55045.02 ms. Allocated memory was 305.7 MB in the beginning and 859.8 MB in the end (delta: 554.2 MB). Free memory was 264.7 MB in the beginning and 349.3 MB in the end (delta: -84.6 MB). Peak memory consumption was 469.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:20,279 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:02:20,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.50 ms. Allocated memory is still 305.7 MB. Free memory was 263.7 MB in the beginning and 250.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:20,280 INFO L168 Benchmark]: Boogie Preprocessor took 55.14 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 248.5 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:02:20,280 INFO L168 Benchmark]: RCFGBuilder took 634.35 ms. Allocated memory is still 305.7 MB. Free memory was 248.5 MB in the beginning and 199.5 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:20,280 INFO L168 Benchmark]: TraceAbstraction took 54100.13 ms. Allocated memory was 305.7 MB in the beginning and 859.8 MB in the end (delta: 554.2 MB). Free memory was 199.5 MB in the beginning and 349.3 MB in the end (delta: -149.7 MB). Peak memory consumption was 404.4 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:20,281 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.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.50 ms. Allocated memory is still 305.7 MB. Free memory was 263.7 MB in the beginning and 250.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 55.14 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 634.35 ms. Allocated memory is still 305.7 MB. Free memory was 248.5 MB in the beginning and 199.5 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54100.13 ms. Allocated memory was 305.7 MB in the beginning and 859.8 MB in the end (delta: 554.2 MB). Free memory was 199.5 MB in the beginning and 349.3 MB in the end (delta: -149.7 MB). Peak memory consumption was 404.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 5 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 210 locations, 55 error locations. TIMEOUT Result, 54.0s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3773 SDtfs, 574 SDslu, 19749 SDs, 0 SdLazy, 3979 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 984 SyntacticMatches, 55 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 2286 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 128 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 35.9s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1061 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1573 ConstructedInterpolants, 157 QuantifiedInterpolants, 354906 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2904 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 64/528 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/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-02-20-290.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-02-20-290.csv Completed graceful shutdown