./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39996758d4a4793ed5619e696b4574ccdffaa666 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:35:23,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:35:23,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:35:23,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:35:23,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:35:23,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:35:23,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:35:23,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:35:23,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:35:23,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:35:23,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:35:23,850 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:35:23,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:35:23,851 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:35:23,855 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:35:23,856 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:35:23,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:35:23,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:35:23,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:35:23,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:35:23,869 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:35:23,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:35:23,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:35:23,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:35:23,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:35:23,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:35:23,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:35:23,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:35:23,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:35:23,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:35:23,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:35:23,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:35:23,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:35:23,884 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:35:23,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:35:23,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:35:23,888 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:35:23,916 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:35:23,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:35:23,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:35:23,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:35:23,926 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:35:23,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:35:23,927 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:35:23,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:35:23,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:35:23,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:35:23,927 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:35:23,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:35:23,927 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:35:23,928 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:35:23,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:35:23,930 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:35:23,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:35:23,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:35:23,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:35:23,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:35:23,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:35:23,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:35:23,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:35:23,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:35:23,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:35:23,933 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:35:23,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:35:23,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:35:23,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39996758d4a4793ed5619e696b4574ccdffaa666 [2019-01-12 09:35:23,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:35:24,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:35:24,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:35:24,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:35:24,023 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:35:24,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:35:24,078 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04855298/1c5bded15bb3470882eb449b450d8a78/FLAGbc8cc3fb3 [2019-01-12 09:35:24,535 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:35:24,535 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:35:24,555 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04855298/1c5bded15bb3470882eb449b450d8a78/FLAGbc8cc3fb3 [2019-01-12 09:35:24,857 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04855298/1c5bded15bb3470882eb449b450d8a78 [2019-01-12 09:35:24,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:35:24,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:35:24,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:35:24,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:35:24,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:35:24,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:35:24" (1/1) ... [2019-01-12 09:35:24,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525e61c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:24, skipping insertion in model container [2019-01-12 09:35:24,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:35:24" (1/1) ... [2019-01-12 09:35:24,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:35:24,954 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:35:25,312 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:35:25,333 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:35:25,479 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:35:25,552 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:35:25,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25 WrapperNode [2019-01-12 09:35:25,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:35:25,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:35:25,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:35:25,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:35:25,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:35:25,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:35:25,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:35:25,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:35:25,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... [2019-01-12 09:35:25,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:35:25,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:35:25,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:35:25,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:35:25,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (1/1) ... No working directory specified, using /storage/repos/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 [2019-01-12 09:35:25,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:35:25,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:35:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 09:35:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:35:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:35:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:35:25,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:35:25,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:35:26,593 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:35:26,594 INFO L286 CfgBuilder]: Removed 35 assue(true) statements. [2019-01-12 09:35:26,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:26 BoogieIcfgContainer [2019-01-12 09:35:26,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:35:26,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:35:26,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:35:26,599 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:35:26,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:35:24" (1/3) ... [2019-01-12 09:35:26,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f857ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:35:26, skipping insertion in model container [2019-01-12 09:35:26,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:25" (2/3) ... [2019-01-12 09:35:26,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f857ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:35:26, skipping insertion in model container [2019-01-12 09:35:26,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:26" (3/3) ... [2019-01-12 09:35:26,603 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:35:26,613 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:35:26,621 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-01-12 09:35:26,638 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-01-12 09:35:26,668 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:35:26,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:35:26,669 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:35:26,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:35:26,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:35:26,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:35:26,670 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:35:26,670 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:35:26,670 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:35:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-01-12 09:35:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 09:35:26,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:26,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 09:35:26,700 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2019-01-12 09:35:26,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:26,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:26,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:26,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:26,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:26,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:26,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:35:26,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:35:26,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:35:26,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:35:26,868 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2019-01-12 09:35:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:26,894 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2019-01-12 09:35:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:35:26,896 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-01-12 09:35:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:26,908 INFO L225 Difference]: With dead ends: 168 [2019-01-12 09:35:26,909 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 09:35:26,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:35:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 09:35:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-12 09:35:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 09:35:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-01-12 09:35:26,953 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2019-01-12 09:35:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:26,953 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-01-12 09:35:26,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:35:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-01-12 09:35:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 09:35:26,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:26,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 09:35:26,955 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:26,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:26,955 INFO L82 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2019-01-12 09:35:26,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:26,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:26,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:26,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:26,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:27,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:27,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:27,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:27,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:27,040 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 3 states. [2019-01-12 09:35:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:27,110 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-01-12 09:35:27,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:27,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-12 09:35:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:27,114 INFO L225 Difference]: With dead ends: 80 [2019-01-12 09:35:27,114 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 09:35:27,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 09:35:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-12 09:35:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 09:35:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-01-12 09:35:27,124 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2019-01-12 09:35:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:27,124 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-01-12 09:35:27,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-01-12 09:35:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 09:35:27,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:27,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:27,127 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2019-01-12 09:35:27,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:27,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:27,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:27,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:27,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:35:27,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:35:27,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:35:27,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:35:27,266 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 4 states. [2019-01-12 09:35:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:27,383 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-01-12 09:35:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:27,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-12 09:35:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:27,386 INFO L225 Difference]: With dead ends: 70 [2019-01-12 09:35:27,386 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 09:35:27,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:35:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 09:35:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 09:35:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 09:35:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-01-12 09:35:27,396 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2019-01-12 09:35:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:27,396 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-01-12 09:35:27,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:35:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-01-12 09:35:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:35:27,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:27,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:27,399 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2019-01-12 09:35:27,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:27,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:27,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:27,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:27,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:27,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:27,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:27,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:27,469 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 3 states. [2019-01-12 09:35:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:27,528 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-01-12 09:35:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:27,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-12 09:35:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:27,533 INFO L225 Difference]: With dead ends: 153 [2019-01-12 09:35:27,533 INFO L226 Difference]: Without dead ends: 87 [2019-01-12 09:35:27,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-12 09:35:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-01-12 09:35:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-12 09:35:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-01-12 09:35:27,544 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2019-01-12 09:35:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:27,545 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-01-12 09:35:27,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-01-12 09:35:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:35:27,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:27,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:27,547 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2019-01-12 09:35:27,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:27,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:27,738 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-12 09:35:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:27,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:27,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:35:27,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:35:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:35:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:35:27,770 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2019-01-12 09:35:27,959 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:35:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:28,133 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-01-12 09:35:28,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:35:28,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-12 09:35:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:28,135 INFO L225 Difference]: With dead ends: 91 [2019-01-12 09:35:28,135 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:35:28,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:35:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:35:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:35:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:35:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-01-12 09:35:28,149 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2019-01-12 09:35:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:28,150 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-01-12 09:35:28,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:35:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-01-12 09:35:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:35:28,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:28,151 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:28,152 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:28,153 INFO L82 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2019-01-12 09:35:28,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:28,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:28,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:28,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:28,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:28,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:28,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-12 09:35:28,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:28,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:28,636 INFO L478 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 [2019-01-12 09:35:28,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:28,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:28,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-12 09:35:28,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:28,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:28,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-12 09:35:28,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:28,794 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2019-01-12 09:35:28,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:28,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:28,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-01-12 09:35:28,916 INFO L478 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 [2019-01-12 09:35:28,916 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:28,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-01-12 09:35:28,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:28,970 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:28,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:29,043 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:29,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:29,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:35:29,125 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:111, output treesize:56 [2019-01-12 09:35:29,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2019-01-12 09:35:29,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:29,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-12 09:35:29,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:29,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-01-12 09:35:29,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-01-12 09:35:29,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-12 09:35:29,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:35:29,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:29,422 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-01-12 09:35:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:29,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:29,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 09:35:29,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:35:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:35:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:35:29,451 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 8 states. [2019-01-12 09:35:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:29,967 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2019-01-12 09:35:29,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:35:29,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-12 09:35:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:29,971 INFO L225 Difference]: With dead ends: 144 [2019-01-12 09:35:29,971 INFO L226 Difference]: Without dead ends: 142 [2019-01-12 09:35:29,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:35:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-12 09:35:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2019-01-12 09:35:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-12 09:35:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-01-12 09:35:29,981 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2019-01-12 09:35:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:29,981 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-01-12 09:35:29,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:35:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-01-12 09:35:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:35:29,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:29,982 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:29,983 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:29,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2019-01-12 09:35:29,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:29,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:29,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:29,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:29,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:30,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:30,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:30,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:30,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:30,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:30,034 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 3 states. [2019-01-12 09:35:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:30,113 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2019-01-12 09:35:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:30,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-12 09:35:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:30,114 INFO L225 Difference]: With dead ends: 174 [2019-01-12 09:35:30,114 INFO L226 Difference]: Without dead ends: 108 [2019-01-12 09:35:30,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-12 09:35:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-01-12 09:35:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-12 09:35:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-01-12 09:35:30,136 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2019-01-12 09:35:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:30,137 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-01-12 09:35:30,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-01-12 09:35:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:35:30,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:30,138 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:30,140 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2019-01-12 09:35:30,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:30,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:30,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:30,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 09:35:30,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:30,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:30,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:30,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:30,282 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 3 states. [2019-01-12 09:35:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:30,462 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2019-01-12 09:35:30,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:30,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-12 09:35:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:30,465 INFO L225 Difference]: With dead ends: 201 [2019-01-12 09:35:30,465 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 09:35:30,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 09:35:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-01-12 09:35:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 09:35:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-01-12 09:35:30,491 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2019-01-12 09:35:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:30,491 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-01-12 09:35:30,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-01-12 09:35:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 09:35:30,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:30,497 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:30,497 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2019-01-12 09:35:30,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:30,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:30,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:30,794 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-12 09:35:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:31,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:31,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:35:31,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:31,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:31,131 INFO L478 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 [2019-01-12 09:35:31,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-01-12 09:35:31,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:31,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:31,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-12 09:35:31,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,265 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2019-01-12 09:35:31,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:31,358 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-01-12 09:35:31,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:31,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:31,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-01-12 09:35:31,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2019-01-12 09:35:31,492 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:31,518 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:31,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:31,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:31,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:31,654 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:114, output treesize:83 [2019-01-12 09:35:31,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2019-01-12 09:35:31,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:31,768 INFO L478 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2019-01-12 09:35:31,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:31,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:32,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2019-01-12 09:35:32,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-12 09:35:32,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:32,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:32,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-12 09:35:32,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:124 [2019-01-12 09:35:32,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 214 [2019-01-12 09:35:32,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:32,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 203 [2019-01-12 09:35:32,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:32,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:32,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 203 [2019-01-12 09:35:32,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:33,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 116 [2019-01-12 09:35:33,374 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-01-12 09:35:33,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2019-01-12 09:35:33,379 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:33,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 75 [2019-01-12 09:35:33,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:33,420 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:33,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 80 [2019-01-12 09:35:33,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:33,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 57 [2019-01-12 09:35:33,654 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:33,904 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:33,946 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:34,016 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:34,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 121 [2019-01-12 09:35:34,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2019-01-12 09:35:34,377 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2019-01-12 09:35:34,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 81 [2019-01-12 09:35:34,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:34,505 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:34,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-12 09:35:34,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:34,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 57 [2019-01-12 09:35:34,565 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:34,615 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:34,656 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:34,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 82 [2019-01-12 09:35:34,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:34,687 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:34,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 87 [2019-01-12 09:35:34,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:34,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 68 [2019-01-12 09:35:34,845 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:34,912 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:34,973 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:35,106 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-12 09:35:35,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 116 [2019-01-12 09:35:35,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2019-01-12 09:35:35,452 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:35,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 75 [2019-01-12 09:35:35,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:35,491 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:35,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 80 [2019-01-12 09:35:35,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:35,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 57 [2019-01-12 09:35:35,601 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:35,639 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:35,678 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:35,723 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:35,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2019-01-12 09:35:35,963 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 13 variables, input treesize:642, output treesize:481 [2019-01-12 09:35:36,214 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-01-12 09:35:36,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 79 [2019-01-12 09:35:36,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:36,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-01-12 09:35:36,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 86 [2019-01-12 09:35:36,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:36,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-01-12 09:35:36,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 79 [2019-01-12 09:35:36,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:36,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-01-12 09:35:36,498 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-01-12 09:35:36,560 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:330, output treesize:201 [2019-01-12 09:35:36,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2019-01-12 09:35:36,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:35:36,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-12 09:35:36,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:35:36,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 47 [2019-01-12 09:35:36,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2019-01-12 09:35:36,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2019-01-12 09:35:36,885 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:35:36,893 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,900 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2019-01-12 09:35:36,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2019-01-12 09:35:36,951 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-12 09:35:36,975 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:35:36,981 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:36,988 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:37,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:37,004 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:213, output treesize:4 [2019-01-12 09:35:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:37,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:37,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-12 09:35:37,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 09:35:37,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 09:35:37,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:35:37,035 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 13 states. [2019-01-12 09:35:37,240 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-01-12 09:35:37,434 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-12 09:35:37,606 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-01-12 09:35:37,999 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-01-12 09:35:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:38,292 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2019-01-12 09:35:38,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:35:38,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-01-12 09:35:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:38,295 INFO L225 Difference]: With dead ends: 160 [2019-01-12 09:35:38,295 INFO L226 Difference]: Without dead ends: 158 [2019-01-12 09:35:38,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:35:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-12 09:35:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2019-01-12 09:35:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-12 09:35:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-12 09:35:38,303 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 28 [2019-01-12 09:35:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:38,304 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-12 09:35:38,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 09:35:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-12 09:35:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:35:38,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:38,305 INFO L402 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] [2019-01-12 09:35:38,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2019-01-12 09:35:38,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:38,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:35:38,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:38,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:38,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:38,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:38,379 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 3 states. [2019-01-12 09:35:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:38,464 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-01-12 09:35:38,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:38,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-12 09:35:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:38,466 INFO L225 Difference]: With dead ends: 111 [2019-01-12 09:35:38,466 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 09:35:38,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 09:35:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-12 09:35:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-12 09:35:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-12 09:35:38,473 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 29 [2019-01-12 09:35:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:38,474 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-12 09:35:38,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-12 09:35:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:35:38,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:38,475 INFO L402 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] [2019-01-12 09:35:38,475 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:38,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2019-01-12 09:35:38,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:38,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:38,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:38,926 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-12 09:35:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:39,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:39,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-12 09:35:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:39,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:39,383 INFO L478 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 [2019-01-12 09:35:39,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-12 09:35:39,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:39,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:39,536 INFO L478 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 [2019-01-12 09:35:39,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,565 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2019-01-12 09:35:39,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:39,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,636 INFO L478 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 42 treesize of output 38 [2019-01-12 09:35:39,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:39,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:39,658 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:39,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2019-01-12 09:35:39,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:39,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 79 [2019-01-12 09:35:39,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,692 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,705 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,748 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 93 [2019-01-12 09:35:39,854 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-01-12 09:35:39,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:39,857 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,878 INFO L478 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 68 treesize of output 64 [2019-01-12 09:35:39,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:39,887 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2019-01-12 09:35:39,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:39,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2019-01-12 09:35:39,918 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,934 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,968 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:39,985 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,010 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:191, output treesize:70 [2019-01-12 09:35:40,085 INFO L478 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 152 treesize of output 141 [2019-01-12 09:35:40,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:40,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:40,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:40,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2019-01-12 09:35:40,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,209 INFO L478 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 125 treesize of output 109 [2019-01-12 09:35:40,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:40,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:40,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:40,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2019-01-12 09:35:40,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,283 INFO L478 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 25 treesize of output 18 [2019-01-12 09:35:40,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-01-12 09:35:40,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,298 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,314 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:171, output treesize:85 [2019-01-12 09:35:40,363 INFO L478 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 85 treesize of output 63 [2019-01-12 09:35:40,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:40,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2019-01-12 09:35:40,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,456 INFO L478 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 49 treesize of output 36 [2019-01-12 09:35:40,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,483 INFO L478 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 46 treesize of output 38 [2019-01-12 09:35:40,486 INFO L478 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 29 treesize of output 18 [2019-01-12 09:35:40,486 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:40,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-12 09:35:40,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:40,515 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:99, output treesize:13 [2019-01-12 09:35:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:40,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:40,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-01-12 09:35:40,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 09:35:40,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 09:35:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-01-12 09:35:40,579 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 15 states. [2019-01-12 09:35:41,409 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-12 09:35:41,844 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-12 09:35:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:42,395 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2019-01-12 09:35:42,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 09:35:42,396 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-01-12 09:35:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:42,398 INFO L225 Difference]: With dead ends: 148 [2019-01-12 09:35:42,398 INFO L226 Difference]: Without dead ends: 146 [2019-01-12 09:35:42,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2019-01-12 09:35:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-12 09:35:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2019-01-12 09:35:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-12 09:35:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2019-01-12 09:35:42,411 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 29 [2019-01-12 09:35:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:42,412 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2019-01-12 09:35:42,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 09:35:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2019-01-12 09:35:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 09:35:42,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:42,416 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:42,416 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2019-01-12 09:35:42,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:42,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:42,985 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-12 09:35:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:43,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:43,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:35:43,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:43,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:43,088 INFO L478 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 [2019-01-12 09:35:43,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-01-12 09:35:43,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:43,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:43,220 INFO L478 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 [2019-01-12 09:35:43,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,271 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2019-01-12 09:35:43,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:43,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,365 INFO L478 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 42 treesize of output 38 [2019-01-12 09:35:43,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:43,369 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:43,388 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:43,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2019-01-12 09:35:43,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:43,404 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:43,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 114 [2019-01-12 09:35:43,405 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,420 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,572 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 93 [2019-01-12 09:35:43,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:43,633 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,652 INFO L478 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 68 treesize of output 64 [2019-01-12 09:35:43,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:43,656 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2019-01-12 09:35:43,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:43,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2019-01-12 09:35:43,744 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,760 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,774 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,788 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,816 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:200, output treesize:83 [2019-01-12 09:35:43,863 INFO L478 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 71 treesize of output 68 [2019-01-12 09:35:43,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:43,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:43,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:43,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2019-01-12 09:35:43,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:43,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:44,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 87 [2019-01-12 09:35:44,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,020 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:44,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 109 [2019-01-12 09:35:44,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:44,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:44,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:44,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:99 [2019-01-12 09:35:44,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2019-01-12 09:35:44,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:44,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 286 [2019-01-12 09:35:44,309 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-01-12 09:35:44,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2019-01-12 09:35:44,319 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:44,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 235 [2019-01-12 09:35:44,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:44,397 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:44,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:44,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 240 [2019-01-12 09:35:44,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 80 [2019-01-12 09:35:44,485 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:44,579 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:44,670 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:44,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:45,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 134 [2019-01-12 09:35:45,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,132 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:45,136 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-12 09:35:45,137 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 98 [2019-01-12 09:35:45,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:45,199 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,231 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:45,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 97 [2019-01-12 09:35:45,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2019-01-12 09:35:45,247 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,270 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,289 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,320 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 144 [2019-01-12 09:35:45,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,350 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:45,356 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2019-01-12 09:35:45,357 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 112 [2019-01-12 09:35:45,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:45,425 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 106 [2019-01-12 09:35:45,484 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:45,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2019-01-12 09:35:45,485 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,506 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,521 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,564 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:45,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:35:45,639 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:401, output treesize:243 [2019-01-12 09:35:45,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:45,852 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-12 09:35:45,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 241 [2019-01-12 09:35:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,010 INFO L303 Elim1Store]: Index analysis took 153 ms [2019-01-12 09:35:46,126 INFO L478 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 100 [2019-01-12 09:35:46,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:46,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:46,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 295 [2019-01-12 09:35:46,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,451 INFO L478 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 84 treesize of output 66 [2019-01-12 09:35:46,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:46,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:46,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 203 [2019-01-12 09:35:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,677 INFO L478 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 84 treesize of output 66 [2019-01-12 09:35:46,677 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:46,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:46,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 197 [2019-01-12 09:35:46,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,871 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:46,876 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-01-12 09:35:46,876 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:46,912 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:46,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 215 [2019-01-12 09:35:46,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:46,950 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 55 [2019-01-12 09:35:46,950 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:47,001 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:47,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-12 09:35:47,122 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:658, output treesize:516 [2019-01-12 09:35:47,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 126 [2019-01-12 09:35:47,291 INFO L478 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 17 treesize of output 1 [2019-01-12 09:35:47,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2019-01-12 09:35:47,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:47,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 38 [2019-01-12 09:35:47,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:47,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2019-01-12 09:35:47,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 151 [2019-01-12 09:35:47,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2019-01-12 09:35:47,517 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:47,542 INFO L478 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 105 treesize of output 88 [2019-01-12 09:35:47,542 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2019-01-12 09:35:47,564 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:47,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 60 [2019-01-12 09:35:47,655 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2019-01-12 09:35:47,658 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-12 09:35:47,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-01-12 09:35:47,684 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2019-01-12 09:35:47,704 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:47,715 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:47,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 125 [2019-01-12 09:35:47,787 INFO L478 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 106 treesize of output 99 [2019-01-12 09:35:47,787 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:35:47,808 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2019-01-12 09:35:47,827 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:47,839 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:47,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 53 [2019-01-12 09:35:47,890 INFO L478 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 [2019-01-12 09:35:47,890 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-01-12 09:35:47,904 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-12 09:35:47,913 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,919 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,946 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 10 variables, input treesize:552, output treesize:4 [2019-01-12 09:35:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:47,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:47,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-01-12 09:35:47,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:35:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:35:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:35:47,987 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand 12 states. [2019-01-12 09:35:48,401 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-12 09:35:48,689 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-12 09:35:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:48,809 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2019-01-12 09:35:48,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:35:48,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-01-12 09:35:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:48,813 INFO L225 Difference]: With dead ends: 161 [2019-01-12 09:35:48,813 INFO L226 Difference]: Without dead ends: 159 [2019-01-12 09:35:48,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-12 09:35:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-12 09:35:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2019-01-12 09:35:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-12 09:35:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2019-01-12 09:35:48,827 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 31 [2019-01-12 09:35:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:48,828 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2019-01-12 09:35:48,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:35:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2019-01-12 09:35:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 09:35:48,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:48,832 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:48,832 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash 509365297, now seen corresponding path program 1 times [2019-01-12 09:35:48,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:48,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:48,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-12 09:35:48,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:48,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:48,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:48,905 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 3 states. [2019-01-12 09:35:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:49,044 INFO L93 Difference]: Finished difference Result 210 states and 233 transitions. [2019-01-12 09:35:49,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:49,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 09:35:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:49,050 INFO L225 Difference]: With dead ends: 210 [2019-01-12 09:35:49,050 INFO L226 Difference]: Without dead ends: 119 [2019-01-12 09:35:49,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-12 09:35:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2019-01-12 09:35:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 09:35:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-01-12 09:35:49,063 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 36 [2019-01-12 09:35:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:49,064 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-01-12 09:35:49,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-01-12 09:35:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 09:35:49,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:49,065 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:49,065 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 778254669, now seen corresponding path program 1 times [2019-01-12 09:35:49,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:49,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:49,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:49,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:49,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:49,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-12 09:35:49,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:49,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:49,398 INFO L478 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 [2019-01-12 09:35:49,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-01-12 09:35:49,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:49,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:49,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-12 09:35:49,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,580 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2019-01-12 09:35:49,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:49,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-01-12 09:35:49,648 INFO L478 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 [2019-01-12 09:35:49,648 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-01-12 09:35:49,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:49,683 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:49,706 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:49,730 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:49,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:49,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:35:49,786 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:120, output treesize:82 [2019-01-12 09:35:49,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-12 09:35:49,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:49,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-12 09:35:49,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-01-12 09:35:49,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:49,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:49,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:49,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2019-01-12 09:35:49,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:49,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 163 [2019-01-12 09:35:50,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2019-01-12 09:35:50,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 133 [2019-01-12 09:35:50,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:35:50,080 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 145 [2019-01-12 09:35:50,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,132 INFO L478 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 45 treesize of output 109 [2019-01-12 09:35:50,132 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,168 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,197 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 55 [2019-01-12 09:35:50,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:35:50,331 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2019-01-12 09:35:50,371 INFO L478 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 20 treesize of output 11 [2019-01-12 09:35:50,371 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,378 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,393 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:50,432 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:261, output treesize:79 [2019-01-12 09:35:50,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 115 [2019-01-12 09:35:50,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,558 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 88 [2019-01-12 09:35:50,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:35:50,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:50,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:79 [2019-01-12 09:35:50,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2019-01-12 09:35:50,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 152 [2019-01-12 09:35:50,925 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 74 [2019-01-12 09:35:50,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-12 09:35:50,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 121 [2019-01-12 09:35:50,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-12 09:35:50,995 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:51,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 126 [2019-01-12 09:35:51,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:51,071 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:51,116 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:51,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:51,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:51,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-12 09:35:51,315 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:181, output treesize:348 [2019-01-12 09:35:51,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,691 INFO L303 Elim1Store]: Index analysis took 320 ms [2019-01-12 09:35:51,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 162 [2019-01-12 09:35:51,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-12 09:35:51,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:51,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:51,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:51,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:229, output treesize:166 [2019-01-12 09:35:51,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:51,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 92 [2019-01-12 09:35:51,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-01-12 09:35:51,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:51,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2019-01-12 09:35:51,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:51,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:35:51,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2019-01-12 09:35:52,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,017 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:170, output treesize:4 [2019-01-12 09:35:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:52,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:52,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-01-12 09:35:52,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 09:35:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 09:35:52,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=152, Unknown=4, NotChecked=0, Total=210 [2019-01-12 09:35:52,054 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 15 states. [2019-01-12 09:35:52,328 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-01-12 09:35:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:53,141 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2019-01-12 09:35:53,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 09:35:53,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-01-12 09:35:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:53,144 INFO L225 Difference]: With dead ends: 173 [2019-01-12 09:35:53,146 INFO L226 Difference]: Without dead ends: 171 [2019-01-12 09:35:53,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=310, Unknown=4, NotChecked=0, Total=420 [2019-01-12 09:35:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-12 09:35:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 102. [2019-01-12 09:35:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-12 09:35:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-01-12 09:35:53,161 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 38 [2019-01-12 09:35:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:53,162 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-01-12 09:35:53,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 09:35:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-01-12 09:35:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 09:35:53,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:53,163 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:53,167 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:53,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:53,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1793269558, now seen corresponding path program 1 times [2019-01-12 09:35:53,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:53,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:53,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:53,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:53,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:35:53,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:53,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:53,715 INFO L478 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 [2019-01-12 09:35:53,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-01-12 09:35:53,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:53,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:53,745 INFO L478 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 [2019-01-12 09:35:53,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,790 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2019-01-12 09:35:53,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:53,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,859 INFO L478 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 42 treesize of output 38 [2019-01-12 09:35:53,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:53,863 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:53,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:53,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2019-01-12 09:35:53,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:53,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:53,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 114 [2019-01-12 09:35:53,904 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,928 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,941 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,998 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 93 [2019-01-12 09:35:54,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:54,059 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,081 INFO L478 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 68 treesize of output 64 [2019-01-12 09:35:54,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:54,087 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2019-01-12 09:35:54,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2019-01-12 09:35:54,128 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,149 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,163 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,179 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,230 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:200, output treesize:83 [2019-01-12 09:35:54,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 87 [2019-01-12 09:35:54,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,384 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:54,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 109 [2019-01-12 09:35:54,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,503 INFO L478 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 14 [2019-01-12 09:35:54,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:54,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,560 INFO L478 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 130 treesize of output 117 [2019-01-12 09:35:54,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 115 [2019-01-12 09:35:54,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,642 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:134, output treesize:120 [2019-01-12 09:35:54,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2019-01-12 09:35:54,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 607 treesize of output 379 [2019-01-12 09:35:55,164 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-12 09:35:55,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:55,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 386 [2019-01-12 09:35:55,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:55,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:55,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:55,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 405 treesize of output 354 [2019-01-12 09:35:55,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:35:55,354 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:55,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:55,454 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:55,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:55,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:55,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 359 [2019-01-12 09:35:55,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 389 treesize of output 396 [2019-01-12 09:35:55,556 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:55,783 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:55,987 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:56,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:56,426 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:56,433 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:56,648 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:56,711 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:56,713 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:56,781 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 364 [2019-01-12 09:35:57,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,149 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2019-01-12 09:35:57,149 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 311 [2019-01-12 09:35:57,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-12 09:35:57,262 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,315 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:57,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 274 treesize of output 321 [2019-01-12 09:35:57,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2019-01-12 09:35:57,336 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,367 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,388 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,428 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 462 treesize of output 374 [2019-01-12 09:35:57,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,464 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 82 [2019-01-12 09:35:57,464 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 319 [2019-01-12 09:35:57,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-12 09:35:57,545 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:57,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 278 treesize of output 324 [2019-01-12 09:35:57,618 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:35:57,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 48 [2019-01-12 09:35:57,620 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,652 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:57,862 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,068 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,235 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 202 [2019-01-12 09:35:58,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:58,241 INFO L478 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 44 treesize of output 75 [2019-01-12 09:35:58,241 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 86 [2019-01-12 09:35:58,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-01-12 09:35:58,294 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 91 [2019-01-12 09:35:58,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-12 09:35:58,325 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,336 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,342 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,373 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,380 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 231 [2019-01-12 09:35:58,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:58,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 83 [2019-01-12 09:35:58,387 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:58,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 96 [2019-01-12 09:35:58,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-01-12 09:35:58,464 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:58,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 101 [2019-01-12 09:35:58,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2019-01-12 09:35:58,533 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2019-01-12 09:35:58,554 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:58,576 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:58,635 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:58,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-12 09:35:58,798 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 8 variables, input treesize:655, output treesize:536 [2019-01-12 09:35:58,991 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-01-12 09:35:59,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:59,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:59,182 INFO L303 Elim1Store]: Index analysis took 180 ms [2019-01-12 09:35:59,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 395 treesize of output 316 [2019-01-12 09:35:59,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:59,258 INFO L478 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 100 treesize of output 86 [2019-01-12 09:35:59,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:59,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:00,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 357 [2019-01-12 09:36:00,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-01-12 09:36:00,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:00,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:01,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 301 [2019-01-12 09:36:01,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-01-12 09:36:01,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:02,129 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:02,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 235 [2019-01-12 09:36:02,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,323 INFO L478 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 122 [2019-01-12 09:36:02,324 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-12 09:36:02,406 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:36:02,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 315 [2019-01-12 09:36:02,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,606 INFO L478 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 100 treesize of output 86 [2019-01-12 09:36:02,606 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:02,639 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:02,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 248 [2019-01-12 09:36:02,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,828 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:36:02,833 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-01-12 09:36:02,834 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:02,880 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:02,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 262 [2019-01-12 09:36:02,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:02,920 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2019-01-12 09:36:02,920 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2019-01-12 09:36:02,982 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:36:03,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-12 09:36:03,138 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:738, output treesize:690 [2019-01-12 09:36:03,313 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-12 09:36:03,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:03,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:03,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:03,468 INFO L303 Elim1Store]: Index analysis took 121 ms [2019-01-12 09:36:03,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 161 [2019-01-12 09:36:03,481 INFO L478 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 19 treesize of output 1 [2019-01-12 09:36:03,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:03,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 81 [2019-01-12 09:36:03,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:04,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 74 [2019-01-12 09:36:04,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:04,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:05,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:05,462 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-12 09:36:05,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 160 [2019-01-12 09:36:05,480 INFO L478 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 86 treesize of output 79 [2019-01-12 09:36:05,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:05,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:05,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2019-01-12 09:36:05,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:05,928 INFO L478 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 [2019-01-12 09:36:05,928 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:05,946 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:06,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 65 [2019-01-12 09:36:06,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:36:06,061 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:06,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:06,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-12 09:36:06,083 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:06,099 INFO L478 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 22 treesize of output 13 [2019-01-12 09:36:06,100 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:06,111 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:06,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:06,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:06,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:06,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 165 [2019-01-12 09:36:06,238 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2019-01-12 09:36:06,240 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:36:06,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2019-01-12 09:36:06,303 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-12 09:36:06,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 91 [2019-01-12 09:36:06,362 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:06,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 80 [2019-01-12 09:36:06,366 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:06,428 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-12 09:36:06,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:06,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:06,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:06,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 80 [2019-01-12 09:36:06,654 INFO L478 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 [2019-01-12 09:36:06,654 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:06,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2019-01-12 09:36:06,756 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:06,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2019-01-12 09:36:06,775 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:06,785 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:06,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 69 [2019-01-12 09:36:06,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2019-01-12 09:36:06,894 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:06,913 INFO L478 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 [2019-01-12 09:36:06,914 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:06,931 INFO L478 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 22 treesize of output 13 [2019-01-12 09:36:06,931 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:06,945 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:06,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 76 [2019-01-12 09:36:06,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2019-01-12 09:36:06,955 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,006 INFO L478 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 39 treesize of output 32 [2019-01-12 09:36:07,007 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:36:07,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-01-12 09:36:07,032 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,042 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-12 09:36:07,104 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 10 variables, input treesize:723, output treesize:108 [2019-01-12 09:36:39,206 WARN L181 SmtUtils]: Spent 32.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-01-12 09:36:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:36:39,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:36:39,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-01-12 09:36:39,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 09:36:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 09:36:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:36:39,292 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 14 states. [2019-01-12 09:36:39,687 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-01-12 09:36:56,278 WARN L181 SmtUtils]: Spent 16.15 s on a formula simplification that was a NOOP. DAG size: 96 [2019-01-12 09:37:12,582 WARN L181 SmtUtils]: Spent 16.18 s on a formula simplification that was a NOOP. DAG size: 97 [2019-01-12 09:37:12,827 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-12 09:37:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:37:12,840 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-01-12 09:37:12,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 09:37:12,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-01-12 09:37:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:37:12,843 INFO L225 Difference]: With dead ends: 137 [2019-01-12 09:37:12,843 INFO L226 Difference]: Without dead ends: 135 [2019-01-12 09:37:12,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 65.8s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:37:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-12 09:37:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 103. [2019-01-12 09:37:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 09:37:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2019-01-12 09:37:12,858 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 40 [2019-01-12 09:37:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:37:12,859 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2019-01-12 09:37:12,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 09:37:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2019-01-12 09:37:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 09:37:12,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:37:12,859 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:37:12,861 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:37:12,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:37:12,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1428751921, now seen corresponding path program 1 times [2019-01-12 09:37:12,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:37:12,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:37:12,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:12,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:37:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-12 09:37:12,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:37:12,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:37:12,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:37:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:37:12,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:37:12,937 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 3 states. [2019-01-12 09:37:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:37:13,214 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-01-12 09:37:13,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:37:13,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-01-12 09:37:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:37:13,217 INFO L225 Difference]: With dead ends: 129 [2019-01-12 09:37:13,217 INFO L226 Difference]: Without dead ends: 117 [2019-01-12 09:37:13,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:37:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-12 09:37:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2019-01-12 09:37:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 09:37:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-01-12 09:37:13,246 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 41 [2019-01-12 09:37:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:37:13,246 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-01-12 09:37:13,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:37:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-01-12 09:37:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 09:37:13,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:37:13,247 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:37:13,248 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:37:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:37:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 755507507, now seen corresponding path program 1 times [2019-01-12 09:37:13,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:37:13,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:37:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:37:13,608 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-12 09:37:14,028 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-01-12 09:37:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:37:14,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:37:14,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-12 09:37:14,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:37:14,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:37:14,337 INFO L478 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 [2019-01-12 09:37:14,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-01-12 09:37:14,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,394 INFO L478 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 [2019-01-12 09:37:14,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,440 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2019-01-12 09:37:14,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:14,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,509 INFO L478 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 42 treesize of output 38 [2019-01-12 09:37:14,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:14,514 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-01-12 09:37:14,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 47 [2019-01-12 09:37:14,551 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,569 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,636 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2019-01-12 09:37:14,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:37:14,684 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2019-01-12 09:37:14,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:14,724 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,746 INFO L478 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 56 treesize of output 63 [2019-01-12 09:37:14,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,750 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:14,751 INFO L478 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 18 treesize of output 46 [2019-01-12 09:37:14,751 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,786 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,797 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,808 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,838 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:200, output treesize:99 [2019-01-12 09:37:14,888 INFO L478 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 101 treesize of output 90 [2019-01-12 09:37:14,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2019-01-12 09:37:14,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:14,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2019-01-12 09:37:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:14,978 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:14,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 109 [2019-01-12 09:37:14,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:91 [2019-01-12 09:37:15,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2019-01-12 09:37:15,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 609 treesize of output 393 [2019-01-12 09:37:15,367 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-01-12 09:37:15,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 378 [2019-01-12 09:37:15,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 409 treesize of output 373 [2019-01-12 09:37:15,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-01-12 09:37:15,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,549 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:15,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 370 [2019-01-12 09:37:15,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,608 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 415 [2019-01-12 09:37:15,610 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:37:15,706 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,746 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,859 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:15,862 INFO L478 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 312 treesize of output 172 [2019-01-12 09:37:15,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,918 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:15,919 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 89 [2019-01-12 09:37:15,919 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 160 [2019-01-12 09:37:15,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-12 09:37:15,958 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:15,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:15,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 123 treesize of output 165 [2019-01-12 09:37:16,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,003 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:16,004 INFO L478 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 34 treesize of output 82 [2019-01-12 09:37:16,004 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,029 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,045 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,061 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,109 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:624, output treesize:241 [2019-01-12 09:37:16,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 198 [2019-01-12 09:37:16,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,214 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:16,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 189 [2019-01-12 09:37:16,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 247 [2019-01-12 09:37:16,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,391 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 160 [2019-01-12 09:37:16,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-12 09:37:16,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:279, output treesize:253 [2019-01-12 09:37:16,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2019-01-12 09:37:16,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:16,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:16,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 748 treesize of output 591 [2019-01-12 09:37:17,008 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-01-12 09:37:17,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2019-01-12 09:37:17,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:17,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 560 treesize of output 537 [2019-01-12 09:37:17,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2019-01-12 09:37:17,162 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:17,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 543 treesize of output 538 [2019-01-12 09:37:17,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,410 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 421 [2019-01-12 09:37:17,414 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2019-01-12 09:37:17,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:17,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:17,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:17,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,793 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:17,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 556 treesize of output 411 [2019-01-12 09:37:17,934 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-01-12 09:37:17,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,941 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:17,942 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 94 [2019-01-12 09:37:17,943 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:17,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:17,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 351 [2019-01-12 09:37:18,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-12 09:37:18,034 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 334 [2019-01-12 09:37:18,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,122 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:18,123 INFO L478 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 34 treesize of output 78 [2019-01-12 09:37:18,124 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,173 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,204 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,234 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,292 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:763, output treesize:339 [2019-01-12 09:37:18,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 816 treesize of output 816 [2019-01-12 09:37:18,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,511 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 457 treesize of output 653 [2019-01-12 09:37:18,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2019-01-12 09:37:18,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 595 treesize of output 641 [2019-01-12 09:37:18,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:18,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 314 [2019-01-12 09:37:18,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:18,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:819, output treesize:461 [2019-01-12 09:37:19,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 445 treesize of output 340 [2019-01-12 09:37:19,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:19,284 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:19,354 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 282 treesize of output 322 [2019-01-12 09:37:19,355 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-12 09:37:19,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 368 dim-0 vars, End of recursive call: 368 dim-0 vars, and 139 xjuncts. [2019-01-12 09:37:21,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 224 [2019-01-12 09:37:21,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:21,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 117 [2019-01-12 09:37:21,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:21,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:21,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:21,390 INFO L478 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 23 treesize of output 21 [2019-01-12 09:37:21,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:21,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:21,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2019-01-12 09:37:21,478 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:21,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:21,491 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:445, output treesize:4 [2019-01-12 09:37:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:37:21,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:37:21,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-01-12 09:37:21,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 09:37:21,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 09:37:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:37:21,533 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 18 states. [2019-01-12 09:37:21,901 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-12 09:37:22,208 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-12 09:37:23,274 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-01-12 09:37:23,455 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-01-12 09:37:23,679 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-01-12 09:37:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:37:23,886 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2019-01-12 09:37:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 09:37:23,888 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-01-12 09:37:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:37:23,890 INFO L225 Difference]: With dead ends: 166 [2019-01-12 09:37:23,890 INFO L226 Difference]: Without dead ends: 164 [2019-01-12 09:37:23,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-01-12 09:37:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-12 09:37:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 101. [2019-01-12 09:37:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-12 09:37:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-01-12 09:37:23,902 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 41 [2019-01-12 09:37:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:37:23,903 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-01-12 09:37:23,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 09:37:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-01-12 09:37:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 09:37:23,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:37:23,904 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:37:23,904 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:37:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:37:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1699655007, now seen corresponding path program 1 times [2019-01-12 09:37:23,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:37:23,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:37:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:23,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:23,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:37:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:37:24,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:37:24,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:37:24,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:37:24,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:37:24,350 INFO L478 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 [2019-01-12 09:37:24,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-01-12 09:37:24,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,392 INFO L478 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 [2019-01-12 09:37:24,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,440 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2019-01-12 09:37:24,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:24,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,505 INFO L478 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 42 treesize of output 38 [2019-01-12 09:37:24,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:24,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-01-12 09:37:24,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 47 [2019-01-12 09:37:24,544 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,562 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,618 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2019-01-12 09:37:24,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:37:24,664 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2019-01-12 09:37:24,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:24,701 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,723 INFO L478 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 56 treesize of output 63 [2019-01-12 09:37:24,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,728 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:24,729 INFO L478 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 18 treesize of output 46 [2019-01-12 09:37:24,730 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,743 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,756 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,766 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,795 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:200, output treesize:99 [2019-01-12 09:37:24,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 91 [2019-01-12 09:37:24,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:24,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 109 [2019-01-12 09:37:24,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,922 INFO L478 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 117 treesize of output 104 [2019-01-12 09:37:24,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:24,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 115 [2019-01-12 09:37:24,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:24,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:107 [2019-01-12 09:37:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2019-01-12 09:37:25,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 585 treesize of output 445 [2019-01-12 09:37:25,252 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-12 09:37:25,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,258 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:25,266 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 89 [2019-01-12 09:37:25,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 403 treesize of output 417 [2019-01-12 09:37:25,361 INFO L478 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 22 treesize of output 21 [2019-01-12 09:37:25,361 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:25,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 380 treesize of output 414 [2019-01-12 09:37:25,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,449 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:25,450 INFO L478 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 28 treesize of output 64 [2019-01-12 09:37:25,450 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,498 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,530 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 432 treesize of output 246 [2019-01-12 09:37:25,756 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-01-12 09:37:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 187 [2019-01-12 09:37:25,791 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 215 [2019-01-12 09:37:25,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 09:37:25,857 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:25,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 220 [2019-01-12 09:37:25,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:25,931 INFO L478 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 202 treesize of output 229 [2019-01-12 09:37:25,932 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:25,985 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:26,022 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:26,059 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:26,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:26,109 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:632, output treesize:233 [2019-01-12 09:37:26,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 215 [2019-01-12 09:37:26,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 81 [2019-01-12 09:37:26,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:26,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:26,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 239 [2019-01-12 09:37:26,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,328 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:26,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 150 [2019-01-12 09:37:26,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:26,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:26,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:26,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:271, output treesize:251 [2019-01-12 09:37:26,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2019-01-12 09:37:26,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:26,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 657 treesize of output 464 [2019-01-12 09:37:26,942 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-01-12 09:37:26,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:26,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 81 [2019-01-12 09:37:26,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:27,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:27,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:27,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:27,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 414 [2019-01-12 09:37:27,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-12 09:37:27,074 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:27,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:27,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:27,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 456 treesize of output 421 [2019-01-12 09:37:27,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:37:27,226 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:27,324 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:37:27,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:37:27,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:37:27,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:27,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:27,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 346 [2019-01-12 09:37:27,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:27,970 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:27,973 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2019-01-12 09:37:27,974 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:28,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 261 [2019-01-12 09:37:28,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-12 09:37:28,068 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:28,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 255 [2019-01-12 09:37:28,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2019-01-12 09:37:28,156 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:28,191 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:28,213 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:28,256 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:28,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 356 [2019-01-12 09:37:28,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,287 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:28,291 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 102 [2019-01-12 09:37:28,291 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:28,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 291 [2019-01-12 09:37:28,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-12 09:37:28,390 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:28,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:28,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 285 [2019-01-12 09:37:28,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2019-01-12 09:37:28,476 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:28,531 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:37:28,601 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:37:28,692 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:37:28,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:37:28,846 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 7 variables, input treesize:684, output treesize:1245 [2019-01-12 09:37:29,039 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-12 09:37:29,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 1191 treesize of output 751 [2019-01-12 09:37:29,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,089 INFO L478 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 244 treesize of output 194 [2019-01-12 09:37:29,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:29,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:29,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 952 treesize of output 969 [2019-01-12 09:37:29,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,368 INFO L478 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 244 treesize of output 194 [2019-01-12 09:37:29,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:29,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:29,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 1176 treesize of output 638 [2019-01-12 09:37:29,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:29,667 INFO L478 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 213 treesize of output 247 [2019-01-12 09:37:29,668 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:29,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:37:30,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 857 treesize of output 860 [2019-01-12 09:37:30,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:30,111 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 73 [2019-01-12 09:37:30,112 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:30,190 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:30,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 923 treesize of output 926 [2019-01-12 09:37:30,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,247 INFO L478 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 139 [2019-01-12 09:37:30,247 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:30,349 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:37:30,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-12 09:37:30,582 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:2368, output treesize:2222 [2019-01-12 09:37:30,826 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-12 09:37:30,887 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:30,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:30,970 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-12 09:37:30,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 707 treesize of output 399 [2019-01-12 09:37:30,978 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:30,994 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 261 [2019-01-12 09:37:30,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-12 09:37:31,154 INFO L478 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 207 treesize of output 186 [2019-01-12 09:37:31,155 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,167 INFO L478 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 223 treesize of output 202 [2019-01-12 09:37:31,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,171 INFO L478 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 217 treesize of output 196 [2019-01-12 09:37:31,172 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 121 [2019-01-12 09:37:31,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 137 [2019-01-12 09:37:31,301 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 131 [2019-01-12 09:37:31,304 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2019-01-12 09:37:31,415 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:31,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:31,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2019-01-12 09:37:31,422 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:31,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 105 [2019-01-12 09:37:31,432 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-12 09:37:31,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-12 09:37:31,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 75 [2019-01-12 09:37:31,832 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 67 [2019-01-12 09:37:31,846 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 71 [2019-01-12 09:37:31,858 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:31,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 67 [2019-01-12 09:37:31,871 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:32,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:32,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:32,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:32,071 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:32,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:32,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:32,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:32,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:32,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 849 treesize of output 493 [2019-01-12 09:37:32,105 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:32,122 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 434 treesize of output 290 [2019-01-12 09:37:32,126 INFO L267 ElimStorePlain]: Start of recursive call 18: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-12 09:37:32,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 211 [2019-01-12 09:37:32,302 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:32,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:32,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 227 [2019-01-12 09:37:32,308 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:32,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 227 [2019-01-12 09:37:32,322 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-12 09:37:32,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 222 [2019-01-12 09:37:32,552 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:32,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 218 [2019-01-12 09:37:32,565 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:32,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 214 [2019-01-12 09:37:32,578 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:32,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 222 [2019-01-12 09:37:32,595 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:33,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 152 [2019-01-12 09:37:33,280 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:33,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 133 [2019-01-12 09:37:33,301 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:33,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 129 [2019-01-12 09:37:33,305 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:33,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 144 [2019-01-12 09:37:33,308 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:33,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 125 [2019-01-12 09:37:33,312 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:33,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 152 [2019-01-12 09:37:33,316 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:33,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 148 [2019-01-12 09:37:33,319 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:33,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 133 [2019-01-12 09:37:33,323 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:33,748 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2019-01-12 09:37:34,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2019-01-12 09:37:34,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-01-12 09:37:34,215 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2019-01-12 09:37:34,246 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:34,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:37:34,274 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,277 INFO L478 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 14 treesize of output 6 [2019-01-12 09:37:34,278 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:34,294 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,304 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 88 [2019-01-12 09:37:34,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2019-01-12 09:37:34,319 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-01-12 09:37:34,349 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2019-01-12 09:37:34,376 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:34,394 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,406 INFO L267 ElimStorePlain]: Start of recursive call 40: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2019-01-12 09:37:34,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-01-12 09:37:34,425 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-01-12 09:37:34,452 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:34,474 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2019-01-12 09:37:34,500 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:34,516 INFO L267 ElimStorePlain]: Start of recursive call 45: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 88 [2019-01-12 09:37:34,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-01-12 09:37:34,533 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2019-01-12 09:37:34,564 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 6 [2019-01-12 09:37:34,591 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:34,611 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,627 INFO L267 ElimStorePlain]: Start of recursive call 50: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2019-01-12 09:37:34,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-01-12 09:37:34,643 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-01-12 09:37:34,672 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:34,693 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2019-01-12 09:37:34,719 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2019-01-12 09:37:34,735 INFO L267 ElimStorePlain]: Start of recursive call 55: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 92 [2019-01-12 09:37:34,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-01-12 09:37:34,755 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2019-01-12 09:37:34,788 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 6 [2019-01-12 09:37:34,816 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:34,836 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,851 INFO L267 ElimStorePlain]: Start of recursive call 60: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2019-01-12 09:37:34,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-01-12 09:37:34,865 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 6 [2019-01-12 09:37:34,890 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:34,906 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:34,919 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,929 INFO L267 ElimStorePlain]: Start of recursive call 65: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 88 [2019-01-12 09:37:34,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2019-01-12 09:37:34,944 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:34,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-01-12 09:37:34,972 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:34,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:34,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2019-01-12 09:37:34,997 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:35,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-12 09:37:35,012 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:35,023 INFO L267 ElimStorePlain]: Start of recursive call 70: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:35,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:35,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:35,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:35,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:35,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:35,280 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:35,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:35,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:35,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 749 treesize of output 461 [2019-01-12 09:37:35,298 INFO L478 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 31 treesize of output 1 [2019-01-12 09:37:35,298 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:35,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:35,359 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:35,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 194 [2019-01-12 09:37:35,360 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:35,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 168 [2019-01-12 09:37:35,398 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:35,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 60 [2019-01-12 09:37:35,430 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:35,454 INFO L267 ElimStorePlain]: Start of recursive call 75: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:35,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 67 [2019-01-12 09:37:35,677 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:35,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:35,868 INFO L202 ElimStorePlain]: Needed 80 recursive calls to eliminate 10 variables, input treesize:2306, output treesize:4 [2019-01-12 09:37:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:37:35,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:37:35,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-01-12 09:37:35,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 09:37:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 09:37:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-01-12 09:37:35,928 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 16 states. [2019-01-12 09:37:36,924 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-01-12 09:37:37,654 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-01-12 09:37:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:37:37,826 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2019-01-12 09:37:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:37:37,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-01-12 09:37:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:37:37,829 INFO L225 Difference]: With dead ends: 153 [2019-01-12 09:37:37,830 INFO L226 Difference]: Without dead ends: 151 [2019-01-12 09:37:37,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-01-12 09:37:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-12 09:37:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2019-01-12 09:37:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-12 09:37:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-01-12 09:37:37,845 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 44 [2019-01-12 09:37:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:37:37,846 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-01-12 09:37:37,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 09:37:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-01-12 09:37:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 09:37:37,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:37:37,847 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:37:37,847 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:37:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:37:37,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1402235726, now seen corresponding path program 1 times [2019-01-12 09:37:37,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:37:37,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:37:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:37,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:37:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 09:37:37,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:37:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:37:37,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:37:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:37:37,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:37:37,950 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 4 states. [2019-01-12 09:37:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:37:38,028 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-01-12 09:37:38,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:37:38,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-12 09:37:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:37:38,031 INFO L225 Difference]: With dead ends: 160 [2019-01-12 09:37:38,031 INFO L226 Difference]: Without dead ends: 141 [2019-01-12 09:37:38,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:37:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-12 09:37:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-01-12 09:37:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-12 09:37:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2019-01-12 09:37:38,055 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 45 [2019-01-12 09:37:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:37:38,055 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2019-01-12 09:37:38,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:37:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2019-01-12 09:37:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 09:37:38,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:37:38,056 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:37:38,056 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:37:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:37:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1904852406, now seen corresponding path program 1 times [2019-01-12 09:37:38,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:37:38,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:37:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:38,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:37:38,343 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-12 09:37:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:37:38,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:37:38,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-12 09:37:38,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:37:38,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:37:38,661 INFO L478 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 [2019-01-12 09:37:38,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-12 09:37:38,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:38,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:38,688 INFO L478 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 [2019-01-12 09:37:38,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,724 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2019-01-12 09:37:38,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:38,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,792 INFO L478 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 42 treesize of output 38 [2019-01-12 09:37:38,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:38,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-01-12 09:37:38,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:38,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 47 [2019-01-12 09:37:38,839 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,857 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:38,914 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2019-01-12 09:37:38,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:37:38,964 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2019-01-12 09:37:39,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:37:39,006 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,030 INFO L478 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 56 treesize of output 63 [2019-01-12 09:37:39,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,037 INFO L478 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 18 treesize of output 35 [2019-01-12 09:37:39,038 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,052 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,065 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,078 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,098 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:191, output treesize:86 [2019-01-12 09:37:39,132 INFO L478 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 183 treesize of output 180 [2019-01-12 09:37:39,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 99 [2019-01-12 09:37:39,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,197 INFO L478 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 147 treesize of output 101 [2019-01-12 09:37:39,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 175 [2019-01-12 09:37:39,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:202, output treesize:80 [2019-01-12 09:37:39,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 77 [2019-01-12 09:37:39,307 INFO L478 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 44 treesize of output 36 [2019-01-12 09:37:39,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:39,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,331 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:37:39,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2019-01-12 09:37:39,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:37:39,364 INFO L478 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 44 treesize of output 34 [2019-01-12 09:37:39,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:37:39,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2019-01-12 09:37:39,370 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,383 INFO L478 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 16 treesize of output 7 [2019-01-12 09:37:39,383 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:37:39,397 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:110, output treesize:7 [2019-01-12 09:37:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:37:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:37:39,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-01-12 09:37:39,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 09:37:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 09:37:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=191, Unknown=2, NotChecked=0, Total=240 [2019-01-12 09:37:39,451 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 16 states. [2019-01-12 09:37:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:37:40,075 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-01-12 09:37:40,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:37:40,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-01-12 09:37:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:37:40,077 INFO L225 Difference]: With dead ends: 141 [2019-01-12 09:37:40,077 INFO L226 Difference]: Without dead ends: 106 [2019-01-12 09:37:40,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=298, Unknown=3, NotChecked=0, Total=380 [2019-01-12 09:37:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-12 09:37:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-12 09:37:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-12 09:37:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-01-12 09:37:40,092 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 45 [2019-01-12 09:37:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:37:40,092 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-01-12 09:37:40,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 09:37:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-01-12 09:37:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 09:37:40,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:37:40,093 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2019-01-12 09:37:40,093 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:37:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:37:40,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1057023877, now seen corresponding path program 1 times [2019-01-12 09:37:40,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:37:40,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:37:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:40,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:37:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:37:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:37:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:37:40,188 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:37:40,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:37:40 BoogieIcfgContainer [2019-01-12 09:37:40,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:37:40,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:37:40,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:37:40,251 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:37:40,252 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:26" (3/4) ... [2019-01-12 09:37:40,254 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:37:40,330 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:37:40,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:37:40,331 INFO L168 Benchmark]: Toolchain (without parser) took 135469.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 946.0 MB in the beginning and 830.6 MB in the end (delta: 115.4 MB). Peak memory consumption was 444.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:37:40,333 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:37:40,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:37:40,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:37:40,333 INFO L168 Benchmark]: Boogie Preprocessor took 63.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:37:40,334 INFO L168 Benchmark]: RCFGBuilder took 906.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:37:40,334 INFO L168 Benchmark]: TraceAbstraction took 133654.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 840.7 MB in the end (delta: 251.1 MB). Peak memory consumption was 429.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:37:40,334 INFO L168 Benchmark]: Witness Printer took 79.50 ms. Allocated memory is still 1.4 GB. Free memory was 840.7 MB in the beginning and 830.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:37:40,336 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 906.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 133654.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 840.7 MB in the end (delta: 251.1 MB). Peak memory consumption was 429.4 MB. Max. memory is 11.5 GB. * Witness Printer took 79.50 ms. Allocated memory is still 1.4 GB. Free memory was 840.7 MB in the beginning and 830.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = ((void*)0) [L988] head->prev = ((void*)0) [L989] head->data = 0 [L990] SLL* item = head; [L991] int status = 0; [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) [L1000] COND TRUE !status [L1002] item->data = 1 [L1003] status = 1 [L1016] COND FALSE !(!(head != ((void*)0))) [L1017] COND FALSE !(!(item != ((void*)0))) [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) [L1000] COND FALSE !(!status) [L1005] COND TRUE status == 1 [L1007] item->data = 2 [L1008] status = 2 [L1016] COND FALSE !(!(head != ((void*)0))) [L1017] COND FALSE !(!(item != ((void*)0))) [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) [L1000] COND FALSE !(!status) [L1005] COND FALSE !(status == 1) [L1010] COND TRUE status >= 2 [L1012] item->data = 3 [L1013] status = 3 [L1016] COND FALSE !(!(head != ((void*)0))) [L1017] COND FALSE !(!(item != ((void*)0))) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1020] COND FALSE !(!(head != ((void*)0))) [L1021] COND FALSE !(status == 1) [L1026] COND FALSE !(status == 2) [L1032] COND TRUE status == 3 [L1034] COND FALSE !(!(head != ((void*)0))) [L1035] EXPR head->next [L1035] COND FALSE !(!(head->next != ((void*)0))) [L1036] EXPR head->next [L1036] EXPR head->next->next [L1036] COND FALSE !(!(head->next->next != ((void*)0))) [L1037] EXPR head->next [L1037] EXPR head->next->next [L1037] EXPR head->next->next->next [L1037] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1038] EXPR head->next [L1038] EXPR head->next->next [L1038] EXPR head->next->next->next [L1038] EXPR head->next->next->next->data [L1038] COND TRUE !(head->next->next->next->data != 3) [L1038] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 14 error locations. UNSAFE Result, 133.5s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 45.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1399 SDtfs, 1861 SDslu, 4627 SDs, 0 SdLazy, 3132 SolverSat, 227 SolverUnsat, 72 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 300 SyntacticMatches, 15 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 77.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 397 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 86.2s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 848 ConstructedInterpolants, 136 QuantifiedInterpolants, 4207433 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1152 ConjunctsInSsa, 360 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 130/379 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...