./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/calendar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/calendar.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe08ef78ee5c945bc38e9e915e26405aefe9ffb2d4911c91347e07e6a879dcd5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:23:49,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:23:49,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:23:49,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:23:49,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:23:49,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:23:49,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:23:49,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:23:49,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:23:49,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:23:49,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:23:49,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:23:49,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:23:49,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:23:49,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:23:49,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:23:49,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:23:49,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:23:49,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:23:49,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:23:49,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:23:49,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:23:49,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:23:49,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:23:49,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:23:49,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:23:49,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:23:49,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:23:49,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:23:49,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:23:49,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:23:49,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:23:49,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:23:49,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:23:49,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:23:49,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:23:49,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:23:49,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:23:49,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:23:49,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:23:49,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:23:49,720 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:23:49,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:23:49,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:23:49,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:23:49,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:23:49,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:23:49,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:23:49,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:23:49,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:23:49,765 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:23:49,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:23:49,767 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:23:49,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:23:49,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:23:49,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:23:49,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:23:49,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:23:49,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:23:49,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:23:49,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:23:49,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:23:49,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:23:49,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:23:49,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:23:49,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:23:49,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:23:49,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:23:49,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:23:49,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:23:49,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:23:49,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:23:49,771 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:23:49,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:23:49,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:23:49,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a 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(reach_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 -> fe08ef78ee5c945bc38e9e915e26405aefe9ffb2d4911c91347e07e6a879dcd5 [2022-11-21 16:23:50,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:23:50,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:23:50,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:23:50,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:23:50,058 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:23:50,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/heap-data/calendar.i [2022-11-21 16:23:53,175 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:23:53,407 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:23:53,408 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/sv-benchmarks/c/heap-data/calendar.i [2022-11-21 16:23:53,419 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/data/415e7aff2/1dbf215c8f5240fe8d92c087f85472bf/FLAG0039e3d44 [2022-11-21 16:23:53,434 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/data/415e7aff2/1dbf215c8f5240fe8d92c087f85472bf [2022-11-21 16:23:53,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:23:53,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:23:53,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:23:53,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:23:53,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:23:53,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:53,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b196fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53, skipping insertion in model container [2022-11-21 16:23:53,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:53,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:23:53,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:23:53,779 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/sv-benchmarks/c/heap-data/calendar.i[23742,23755] [2022-11-21 16:23:53,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:23:53,804 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:23:53,872 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/sv-benchmarks/c/heap-data/calendar.i[23742,23755] [2022-11-21 16:23:53,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:23:53,915 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:23:53,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53 WrapperNode [2022-11-21 16:23:53,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:23:53,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:23:53,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:23:53,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:23:53,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:53,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:53,976 INFO L138 Inliner]: procedures = 121, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2022-11-21 16:23:53,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:23:53,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:23:53,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:23:53,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:23:53,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:53,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:53,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:53,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:53,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:54,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:54,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:54,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:54,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:23:54,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:23:54,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:23:54,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:23:54,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (1/1) ... [2022-11-21 16:23:54,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:23:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:23:54,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:23:54,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:23:54,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:23:54,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:23:54,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:23:54,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:23:54,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:23:54,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:23:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:23:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:23:54,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:23:54,289 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:23:54,291 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:23:54,509 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:23:54,515 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:23:54,515 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 16:23:54,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:23:54 BoogieIcfgContainer [2022-11-21 16:23:54,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:23:54,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:23:54,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:23:54,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:23:54,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:23:53" (1/3) ... [2022-11-21 16:23:54,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4e8502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:23:54, skipping insertion in model container [2022-11-21 16:23:54,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:23:53" (2/3) ... [2022-11-21 16:23:54,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4e8502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:23:54, skipping insertion in model container [2022-11-21 16:23:54,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:23:54" (3/3) ... [2022-11-21 16:23:54,532 INFO L112 eAbstractionObserver]: Analyzing ICFG calendar.i [2022-11-21 16:23:54,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:23:54,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:23:54,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:23:54,602 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5de09281, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:23:54,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:23:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:23:54,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:54,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:54,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash 399551724, now seen corresponding path program 1 times [2022-11-21 16:23:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:54,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090705406] [2022-11-21 16:23:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:23:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090705406] [2022-11-21 16:23:54,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090705406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:54,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:54,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:23:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850120238] [2022-11-21 16:23:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:54,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:23:54,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:23:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:23:54,820 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:54,836 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-11-21 16:23:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:23:54,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 16:23:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:54,853 INFO L225 Difference]: With dead ends: 35 [2022-11-21 16:23:54,854 INFO L226 Difference]: Without dead ends: 18 [2022-11-21 16:23:54,856 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:23:54,860 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:54,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:23:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-21 16:23:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-21 16:23:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-11-21 16:23:54,892 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2022-11-21 16:23:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:54,893 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-11-21 16:23:54,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-11-21 16:23:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:23:54,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:54,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:54,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:23:54,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1946762309, now seen corresponding path program 1 times [2022-11-21 16:23:54,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:54,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440421664] [2022-11-21 16:23:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:23:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:55,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440421664] [2022-11-21 16:23:55,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440421664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:55,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:55,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:23:55,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103230098] [2022-11-21 16:23:55,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:55,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:23:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:55,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:23:55,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:23:55,120 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:55,204 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-11-21 16:23:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:23:55,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 16:23:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:55,205 INFO L225 Difference]: With dead ends: 35 [2022-11-21 16:23:55,206 INFO L226 Difference]: Without dead ends: 23 [2022-11-21 16:23:55,206 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:23:55,207 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:55,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:23:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-21 16:23:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-21 16:23:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-11-21 16:23:55,214 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-11-21 16:23:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:55,215 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-11-21 16:23:55,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-11-21 16:23:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:23:55,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:55,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:55,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:23:55,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1070818203, now seen corresponding path program 1 times [2022-11-21 16:23:55,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:55,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741850147] [2022-11-21 16:23:55,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:23:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:55,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741850147] [2022-11-21 16:23:55,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741850147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:55,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:55,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:23:55,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903088709] [2022-11-21 16:23:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:55,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:23:55,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:55,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:23:55,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:23:55,914 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:56,506 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2022-11-21 16:23:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 16:23:56,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:23:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:56,508 INFO L225 Difference]: With dead ends: 78 [2022-11-21 16:23:56,508 INFO L226 Difference]: Without dead ends: 68 [2022-11-21 16:23:56,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-11-21 16:23:56,511 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 140 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:56,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 114 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:23:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-21 16:23:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 27. [2022-11-21 16:23:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-11-21 16:23:56,520 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-11-21 16:23:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:56,520 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-11-21 16:23:56,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-11-21 16:23:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:23:56,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:56,522 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:56,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:23:56,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1737463723, now seen corresponding path program 1 times [2022-11-21 16:23:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:56,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073007471] [2022-11-21 16:23:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:23:56,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:56,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073007471] [2022-11-21 16:23:56,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073007471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:56,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:56,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:23:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435414017] [2022-11-21 16:23:56,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:56,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:23:56,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:56,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:23:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:23:56,687 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:56,778 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-11-21 16:23:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:23:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 16:23:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:56,782 INFO L225 Difference]: With dead ends: 50 [2022-11-21 16:23:56,782 INFO L226 Difference]: Without dead ends: 38 [2022-11-21 16:23:56,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:23:56,789 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:56,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 53 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:23:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-21 16:23:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-11-21 16:23:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-11-21 16:23:56,806 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2022-11-21 16:23:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:56,807 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-11-21 16:23:56,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-11-21 16:23:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:23:56,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:56,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:56,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:23:56,809 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:56,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1737523305, now seen corresponding path program 1 times [2022-11-21 16:23:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:56,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315037103] [2022-11-21 16:23:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:23:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:56,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315037103] [2022-11-21 16:23:56,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315037103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:56,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:56,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:23:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66270901] [2022-11-21 16:23:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:56,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:23:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:23:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:23:56,871 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:56,900 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-11-21 16:23:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:23:56,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 16:23:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:56,902 INFO L225 Difference]: With dead ends: 34 [2022-11-21 16:23:56,902 INFO L226 Difference]: Without dead ends: 32 [2022-11-21 16:23:56,903 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:23:56,906 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:56,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:23:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-21 16:23:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-21 16:23:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-11-21 16:23:56,914 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2022-11-21 16:23:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:56,915 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-11-21 16:23:56,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-11-21 16:23:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:23:56,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:56,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:56,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:23:56,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:56,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash -782496211, now seen corresponding path program 1 times [2022-11-21 16:23:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:56,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570840502] [2022-11-21 16:23:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:23:57,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:57,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570840502] [2022-11-21 16:23:57,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570840502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:57,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:57,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:23:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198380433] [2022-11-21 16:23:57,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:57,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:23:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:57,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:23:57,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:23:57,305 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:57,732 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-11-21 16:23:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:23:57,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 16:23:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:57,737 INFO L225 Difference]: With dead ends: 76 [2022-11-21 16:23:57,737 INFO L226 Difference]: Without dead ends: 74 [2022-11-21 16:23:57,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:23:57,739 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 109 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:57,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 108 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:23:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-21 16:23:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 35. [2022-11-21 16:23:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-11-21 16:23:57,757 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 19 [2022-11-21 16:23:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:57,757 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-11-21 16:23:57,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-11-21 16:23:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 16:23:57,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:57,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:57,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:23:57,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash 830966801, now seen corresponding path program 1 times [2022-11-21 16:23:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:57,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053634030] [2022-11-21 16:23:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:57,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:23:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:58,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053634030] [2022-11-21 16:23:58,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053634030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:23:58,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309215295] [2022-11-21 16:23:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:58,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:23:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:23:58,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:23:58,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:23:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:58,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-21 16:23:58,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:23:58,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:23:58,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:23:58,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:23:58,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:23:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:23:58,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:23:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:23:58,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309215295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:23:58,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:23:58,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-11-21 16:23:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963862461] [2022-11-21 16:23:58,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:23:58,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:23:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:58,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:23:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:23:58,634 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:58,763 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-11-21 16:23:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:23:58,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-21 16:23:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:58,765 INFO L225 Difference]: With dead ends: 68 [2022-11-21 16:23:58,766 INFO L226 Difference]: Without dead ends: 40 [2022-11-21 16:23:58,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:23:58,768 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:58,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:23:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-21 16:23:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-21 16:23:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-11-21 16:23:58,783 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 25 [2022-11-21 16:23:58,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:58,784 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-11-21 16:23:58,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-11-21 16:23:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 16:23:58,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:58,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:58,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:23:58,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:23:58,992 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1524144039, now seen corresponding path program 2 times [2022-11-21 16:23:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:58,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146335571] [2022-11-21 16:23:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:23:59,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:59,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146335571] [2022-11-21 16:23:59,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146335571] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:23:59,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650121766] [2022-11-21 16:23:59,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:23:59,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:23:59,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:23:59,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:23:59,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:23:59,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:23:59,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:23:59,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 16:23:59,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:23:59,952 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:23:59,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:23:59,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:23:59,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:24:00,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:00,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:00,091 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 16:24:00,092 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 16:24:00,102 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2022-11-21 16:24:00,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:24:00,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-21 16:24:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:00,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:24:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:00,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650121766] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:24:00,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:24:00,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 23 [2022-11-21 16:24:00,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629757824] [2022-11-21 16:24:00,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:24:00,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 16:24:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:24:00,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 16:24:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=443, Unknown=1, NotChecked=0, Total=506 [2022-11-21 16:24:00,864 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:24:04,988 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2022-11-21 16:24:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-21 16:24:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-21 16:24:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:24:04,990 INFO L225 Difference]: With dead ends: 136 [2022-11-21 16:24:04,990 INFO L226 Difference]: Without dead ends: 121 [2022-11-21 16:24:04,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=883, Invalid=2308, Unknown=1, NotChecked=0, Total=3192 [2022-11-21 16:24:04,994 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 624 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:24:04,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 297 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:24:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-21 16:24:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 48. [2022-11-21 16:24:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2022-11-21 16:24:05,006 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 30 [2022-11-21 16:24:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:24:05,008 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2022-11-21 16:24:05,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-11-21 16:24:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 16:24:05,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:24:05,013 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:24:05,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:24:05,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:05,219 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:24:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:24:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1895186671, now seen corresponding path program 1 times [2022-11-21 16:24:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:24:05,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075418743] [2022-11-21 16:24:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:24:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:24:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:24:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:24:05,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075418743] [2022-11-21 16:24:05,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075418743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:24:05,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853659600] [2022-11-21 16:24:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:24:05,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:24:05,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:24:05,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:24:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:24:06,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-21 16:24:06,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:24:06,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:06,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:06,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:24:06,114 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:24:06,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:06,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:06,247 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 16:24:06,248 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 16:24:06,255 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2022-11-21 16:24:06,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-21 16:24:06,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:24:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:06,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:24:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:06,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853659600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:24:06,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:24:06,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 18 [2022-11-21 16:24:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046195597] [2022-11-21 16:24:06,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:24:06,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 16:24:06,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:24:06,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 16:24:06,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=255, Unknown=1, NotChecked=0, Total=306 [2022-11-21 16:24:06,931 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:24:08,217 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-11-21 16:24:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 16:24:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-21 16:24:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:24:08,218 INFO L225 Difference]: With dead ends: 67 [2022-11-21 16:24:08,219 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 16:24:08,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=896, Unknown=1, NotChecked=0, Total=1260 [2022-11-21 16:24:08,220 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 238 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:24:08,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 221 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:24:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 16:24:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2022-11-21 16:24:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-11-21 16:24:08,229 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 32 [2022-11-21 16:24:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:24:08,229 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-11-21 16:24:08,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-11-21 16:24:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 16:24:08,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:24:08,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:24:08,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:24:08,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:08,436 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:24:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:24:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1135420755, now seen corresponding path program 3 times [2022-11-21 16:24:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:24:08,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169427166] [2022-11-21 16:24:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:24:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:24:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:24:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:09,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:24:09,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169427166] [2022-11-21 16:24:09,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169427166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:24:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228796173] [2022-11-21 16:24:09,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:24:09,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:24:09,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:24:09,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:24:09,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 16:24:09,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:24:09,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-21 16:24:09,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:24:09,275 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:24:09,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:09,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:09,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:09,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:09,370 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-21 16:24:09,381 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 16:24:09,382 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 16:24:09,389 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-21 16:24:09,776 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-21 16:24:09,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-11-21 16:24:09,790 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 16:24:09,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-21 16:24:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:09,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:24:09,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:09,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-11-21 16:24:09,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:09,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-11-21 16:24:09,916 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 16:24:09,930 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 16:24:10,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:10,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-21 16:24:10,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:24:10,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-21 16:24:10,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:10,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-21 16:24:10,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:24:10,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 16:24:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228796173] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:24:10,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:24:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2022-11-21 16:24:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487128229] [2022-11-21 16:24:10,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:24:10,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 16:24:10,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:24:10,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 16:24:10,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:24:10,162 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:24:10,591 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-11-21 16:24:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:24:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-21 16:24:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:24:10,593 INFO L225 Difference]: With dead ends: 102 [2022-11-21 16:24:10,593 INFO L226 Difference]: Without dead ends: 61 [2022-11-21 16:24:10,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:24:10,594 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 86 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:24:10,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 321 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:24:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-21 16:24:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-21 16:24:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-11-21 16:24:10,609 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 38 [2022-11-21 16:24:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:24:10,611 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-11-21 16:24:10,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-11-21 16:24:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 16:24:10,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:24:10,615 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:24:10,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:24:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:10,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:24:10,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:24:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1704598909, now seen corresponding path program 4 times [2022-11-21 16:24:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:24:10,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910511921] [2022-11-21 16:24:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:24:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:24:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:24:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:12,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:24:12,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910511921] [2022-11-21 16:24:12,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910511921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:24:12,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746859440] [2022-11-21 16:24:12,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:24:12,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:12,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:24:12,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:24:12,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:24:12,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:24:12,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:24:12,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-21 16:24:12,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:24:12,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:12,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:12,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:24:12,213 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:24:12,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:12,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:12,349 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 16:24:12,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-21 16:24:12,378 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 16:24:12,379 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-21 16:24:12,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:12,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:12,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:12,558 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-21 16:24:12,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:12,571 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 49 [2022-11-21 16:24:12,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:12,587 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-11-21 16:24:12,588 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-11-21 16:24:12,596 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-11-21 16:24:13,413 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-11-21 16:24:13,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 149 [2022-11-21 16:24:13,494 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-11-21 16:24:13,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 119 [2022-11-21 16:24:14,915 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-21 16:24:14,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-11-21 16:24:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:14,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:24:15,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:15,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2022-11-21 16:24:15,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:15,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2022-11-21 16:24:15,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:15,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 107 [2022-11-21 16:24:15,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:24:15,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 83 [2022-11-21 16:24:15,530 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 78 [2022-11-21 16:24:15,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:15,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-11-21 16:24:15,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:24:15,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-11-21 16:24:15,710 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-21 16:24:15,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2022-11-21 16:24:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:15,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746859440] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:24:15,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:24:15,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 29 [2022-11-21 16:24:15,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631857424] [2022-11-21 16:24:15,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:24:15,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 16:24:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:24:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 16:24:15,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-11-21 16:24:15,714 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:24:25,258 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2022-11-21 16:24:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-21 16:24:25,258 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-21 16:24:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:24:25,259 INFO L225 Difference]: With dead ends: 169 [2022-11-21 16:24:25,259 INFO L226 Difference]: Without dead ends: 154 [2022-11-21 16:24:25,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1518, Invalid=4334, Unknown=0, NotChecked=0, Total=5852 [2022-11-21 16:24:25,263 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 929 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:24:25,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 517 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:24:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-21 16:24:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 64. [2022-11-21 16:24:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-11-21 16:24:25,274 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 43 [2022-11-21 16:24:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:24:25,274 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-11-21 16:24:25,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-11-21 16:24:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 16:24:25,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:24:25,276 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:24:25,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:24:25,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 16:24:25,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:24:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:24:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash -781342395, now seen corresponding path program 2 times [2022-11-21 16:24:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:24:25,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700945673] [2022-11-21 16:24:25,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:24:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:24:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:24:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:24:26,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700945673] [2022-11-21 16:24:26,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700945673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:24:26,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307224155] [2022-11-21 16:24:26,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:24:26,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:26,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:24:26,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:24:26,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:24:27,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:24:27,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:24:27,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-21 16:24:27,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:24:27,068 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:24:27,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:27,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:27,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:24:27,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:27,141 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 16:24:27,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-21 16:24:27,167 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 16:24:27,168 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-21 16:24:27,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:27,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:27,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:27,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:27,361 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-11-21 16:24:27,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:27,368 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 49 [2022-11-21 16:24:27,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:27,379 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-11-21 16:24:27,380 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-11-21 16:24:27,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:27,387 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-21 16:24:28,167 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-11-21 16:24:28,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 149 [2022-11-21 16:24:28,251 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-11-21 16:24:28,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 119 [2022-11-21 16:24:29,604 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-21 16:24:29,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-11-21 16:24:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:29,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:24:29,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:29,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2022-11-21 16:24:29,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:29,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2022-11-21 16:24:29,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:29,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 121 [2022-11-21 16:24:29,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:24:29,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 91 [2022-11-21 16:24:29,983 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 86 [2022-11-21 16:24:29,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:29,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2022-11-21 16:24:29,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:24:29,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2022-11-21 16:24:30,175 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-21 16:24:30,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2022-11-21 16:24:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:30,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307224155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:24:30,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:24:30,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 25 [2022-11-21 16:24:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318448778] [2022-11-21 16:24:30,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:24:30,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 16:24:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:24:30,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 16:24:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=527, Unknown=2, NotChecked=0, Total=600 [2022-11-21 16:24:30,180 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:24:39,427 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2022-11-21 16:24:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-21 16:24:39,427 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-21 16:24:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:24:39,428 INFO L225 Difference]: With dead ends: 160 [2022-11-21 16:24:39,428 INFO L226 Difference]: Without dead ends: 158 [2022-11-21 16:24:39,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1573, Invalid=4745, Unknown=2, NotChecked=0, Total=6320 [2022-11-21 16:24:39,431 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 761 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:24:39,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 462 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:24:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-21 16:24:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 67. [2022-11-21 16:24:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-11-21 16:24:39,444 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 45 [2022-11-21 16:24:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:24:39,444 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-11-21 16:24:39,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:24:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-11-21 16:24:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:24:39,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:24:39,445 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:24:39,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:24:39,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:39,651 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:24:39,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:24:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2085516585, now seen corresponding path program 5 times [2022-11-21 16:24:39,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:24:39,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979976722] [2022-11-21 16:24:39,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:24:39,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:24:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:24:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:40,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:24:40,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979976722] [2022-11-21 16:24:40,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979976722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:24:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310027568] [2022-11-21 16:24:40,711 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:24:40,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:40,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:24:40,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:24:40,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:24:41,214 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-21 16:24:41,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:24:41,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-21 16:24:41,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:24:41,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:41,257 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:24:41,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:24:41,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:41,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:41,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:41,351 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-21 16:24:41,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:41,359 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-21 16:24:41,384 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 16:24:41,384 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-21 16:24:41,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:41,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:41,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:24:41,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:41,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:24:41,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:41,540 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 16:24:41,541 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2022-11-21 16:24:41,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:41,558 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 16:24:41,559 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 33 treesize of output 50 [2022-11-21 16:24:41,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:41,586 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-11-21 16:24:41,586 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-11-21 16:24:41,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-21 16:24:42,658 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-11-21 16:24:42,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 88 [2022-11-21 16:24:42,676 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-21 16:24:42,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 35 [2022-11-21 16:24:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:42,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:24:43,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:43,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 129 [2022-11-21 16:24:43,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:43,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 111 [2022-11-21 16:24:44,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:44,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 387 treesize of output 367 [2022-11-21 16:24:44,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:44,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 340 [2022-11-21 16:24:44,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:44,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 333 treesize of output 302 [2022-11-21 16:24:44,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:44,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 509 treesize of output 643 [2022-11-21 16:24:44,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:44,246 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 372 [2022-11-21 16:24:44,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:44,275 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 336 [2022-11-21 16:24:52,448 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_25 0))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse4 v_arrayElimArr_27)) (.cse11 (store |c_#memory_$Pointer$.offset| .cse4 v_arrayElimArr_28))) (let ((.cse9 (store .cse11 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse6 (store .cse10 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse7 (select (select .cse6 .cse4) 0)) (.cse8 (select (select .cse9 .cse4) 0)) (.cse1 (store .cse11 v_prenex_9 v_prenex_7)) (.cse5 (store .cse10 v_prenex_9 v_prenex_8))) (let ((.cse2 (select (select .cse5 .cse4) 0)) (.cse3 (select (select .cse1 .cse4) 0)) (.cse0 (select (select .cse9 .cse7) .cse8))) (or (= .cse0 (select (select .cse1 .cse2) .cse3)) (= .cse4 (select (select .cse5 .cse2) .cse3)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse4 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse0 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse4) 0)) (= (select (select .cse6 .cse7) .cse8) .cse4) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse14 (select v_prenex_8 0))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse14 v_arrayElimArr_27)) (.cse15 (store |c_#memory_$Pointer$.offset| .cse14 v_arrayElimArr_28))) (let ((.cse16 (store .cse15 v_prenex_9 v_prenex_7)) (.cse19 (store .cse13 v_prenex_9 v_prenex_8))) (let ((.cse17 (select (select .cse19 .cse14) 0)) (.cse18 (select (select .cse16 .cse14) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (let ((.cse12 (store .cse15 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse12 (select (select (store .cse13 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse14) 0)) (select (select .cse12 .cse14) 0))) 0) (not (= (select |c_#valid| .cse14) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse16 .cse17) .cse18) 0) (= (select (select .cse19 .cse17) .cse18) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse14 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_25 0))) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse20 v_arrayElimArr_27)) (.cse23 (store |c_#memory_$Pointer$.offset| .cse20 v_arrayElimArr_28))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse20 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (let ((.cse21 (store .cse23 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse21 (select (select (store .cse22 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse20) 0)) (select (select .cse21 .cse20) 0))) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse20) 0)) (= (let ((.cse24 (store .cse23 v_prenex_9 v_prenex_7))) (select (select .cse24 (select (select (store .cse22 v_prenex_9 v_prenex_8) .cse20) 0)) (select (select .cse24 .cse20) 0))) 0) (not (= (select v_arrayElimArr_26 0) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_25 0))) (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse25 v_arrayElimArr_27)) (.cse28 (store |c_#memory_$Pointer$.offset| .cse25 v_arrayElimArr_28))) (or (= .cse25 (select (let ((.cse26 (store .cse27 v_prenex_9 v_prenex_8))) (select .cse26 (select (select .cse26 .cse25) 0))) (select (select (store .cse28 v_prenex_9 v_prenex_7) .cse25) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse25 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (let ((.cse29 (store .cse28 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse29 (select (select (store .cse27 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse25) 0)) (select (select .cse29 .cse25) 0))) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse25) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse32 (select v_arrayElimArr_25 0))) (let ((.cse38 (store |c_#memory_$Pointer$.base| .cse32 v_arrayElimArr_27)) (.cse39 (store |c_#memory_$Pointer$.offset| .cse32 v_arrayElimArr_28))) (let ((.cse33 (store .cse39 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse36 (store .cse38 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse34 (select (select .cse36 .cse32) 0)) (.cse35 (select (select .cse33 .cse32) 0))) (let ((.cse31 (select (let ((.cse37 (store .cse38 v_prenex_9 v_prenex_8))) (select .cse37 (select (select .cse37 .cse32) 0))) (select (select (store .cse39 v_prenex_9 v_prenex_7) .cse32) 0))) (.cse30 (select (select .cse36 .cse34) .cse35))) (or (= .cse30 .cse31) (= .cse32 .cse31) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse32 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse33 .cse34) .cse35) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse32) 0)) (= .cse30 .cse32) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse40 (select v_prenex_8 0))) (let ((.cse43 (store |c_#memory_$Pointer$.base| .cse40 v_arrayElimArr_27)) (.cse44 (store |c_#memory_$Pointer$.offset| .cse40 v_arrayElimArr_28))) (let ((.cse41 (select (let ((.cse45 (store .cse43 v_prenex_9 v_prenex_8))) (select .cse45 (select (select .cse45 .cse40) 0))) (select (select (store .cse44 v_prenex_9 v_prenex_7) .cse40) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse40 .cse41) (not (= (select |c_#valid| .cse40) 0)) (= (select (let ((.cse42 (store .cse43 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse42 (select (select .cse42 .cse40) 0))) (select (select (store .cse44 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse40) 0)) .cse41) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse41 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse40 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse47 (select v_prenex_8 0))) (let ((.cse46 (select (let ((.cse48 (store (store |c_#memory_$Pointer$.base| .cse47 v_arrayElimArr_27) v_prenex_9 v_prenex_8))) (select .cse48 (select (select .cse48 .cse47) 0))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse47 v_arrayElimArr_28) v_prenex_9 v_prenex_7) .cse47) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_prenex_9 .cse46)) (not (= (select |c_#valid| .cse47) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse46 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse47 1) v_prenex_9) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse52 (select v_prenex_8 0))) (let ((.cse56 (store |c_#memory_$Pointer$.base| .cse52 v_arrayElimArr_27)) (.cse57 (store |c_#memory_$Pointer$.offset| .cse52 v_arrayElimArr_28))) (let ((.cse49 (store .cse57 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse54 (store .cse56 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse50 (select (select .cse54 .cse52) 0)) (.cse51 (select (select .cse49 .cse52) 0)) (.cse53 (select (let ((.cse55 (store .cse56 v_prenex_9 v_prenex_8))) (select .cse55 (select (select .cse55 .cse52) 0))) (select (select (store .cse57 v_prenex_9 v_prenex_7) .cse52) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse49 .cse50) .cse51) 0) (= .cse52 .cse53) (not (= (select |c_#valid| .cse52) 0)) (= (select (select .cse54 .cse50) .cse51) .cse53) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse53 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse52 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse58 (select v_prenex_8 0))) (let ((.cse63 (store |c_#memory_$Pointer$.base| .cse58 v_arrayElimArr_27)) (.cse64 (store |c_#memory_$Pointer$.offset| .cse58 v_arrayElimArr_28))) (let ((.cse59 (store .cse64 v_prenex_9 v_prenex_7)) (.cse65 (store .cse63 v_prenex_9 v_prenex_8))) (let ((.cse60 (select (select .cse65 .cse58) 0)) (.cse61 (select (select .cse59 .cse58) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse58) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse59 .cse60) .cse61) 0) (= (select (let ((.cse62 (store .cse63 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse62 (select (select .cse62 .cse58) 0))) (select (select (store .cse64 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse58) 0)) .cse58) (= (select (select .cse65 .cse60) .cse61) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse58 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse69 (select v_arrayElimArr_25 0))) (let ((.cse68 (store |c_#memory_$Pointer$.base| .cse69 v_arrayElimArr_27)) (.cse70 (store |c_#memory_$Pointer$.offset| .cse69 v_arrayElimArr_28))) (let ((.cse74 (store .cse70 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse71 (store .cse68 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse72 (select (select .cse71 .cse69) 0)) (.cse73 (select (select .cse74 .cse69) 0))) (let ((.cse66 (select (select .cse74 .cse72) .cse73))) (or (= .cse66 (let ((.cse67 (store .cse70 v_prenex_9 v_prenex_7))) (select (select .cse67 (select (select (store .cse68 v_prenex_9 v_prenex_8) .cse69) 0)) (select (select .cse67 .cse69) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse69 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse66 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse69) 0)) (not (= (select (select .cse71 .cse72) .cse73) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse79 (select v_arrayElimArr_25 0))) (let ((.cse80 (store |c_#memory_$Pointer$.base| .cse79 v_arrayElimArr_27)) (.cse81 (store |c_#memory_$Pointer$.offset| .cse79 v_arrayElimArr_28))) (let ((.cse82 (store .cse81 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse75 (store .cse80 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse76 (select (select .cse75 .cse79) 0)) (.cse77 (select (select .cse82 .cse79) 0))) (or (= (select (select .cse75 .cse76) .cse77) (select (let ((.cse78 (store .cse80 v_prenex_9 v_prenex_8))) (select .cse78 (select (select .cse78 .cse79) 0))) (select (select (store .cse81 v_prenex_9 v_prenex_7) .cse79) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse79 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse82 .cse76) .cse77) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse79) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse83 (select v_arrayElimArr_25 0))) (let ((.cse85 (store |c_#memory_$Pointer$.base| .cse83 v_arrayElimArr_27)) (.cse86 (store |c_#memory_$Pointer$.offset| .cse83 v_arrayElimArr_28))) (let ((.cse87 (store .cse86 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse90 (store .cse85 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse88 (select (select .cse90 .cse83) 0)) (.cse89 (select (select .cse87 .cse83) 0))) (or (= .cse83 (select (let ((.cse84 (store .cse85 v_prenex_9 v_prenex_8))) (select .cse84 (select (select .cse84 .cse83) 0))) (select (select (store .cse86 v_prenex_9 v_prenex_7) .cse83) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse83 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse87 .cse88) .cse89) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse83) 0)) (= (select (select .cse90 .cse88) .cse89) .cse83) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse91 (select v_prenex_8 0))) (let ((.cse97 (store |c_#memory_$Pointer$.base| .cse91 v_arrayElimArr_27)) (.cse98 (store |c_#memory_$Pointer$.offset| .cse91 v_arrayElimArr_28))) (let ((.cse93 (store .cse98 v_prenex_9 v_prenex_7)) (.cse99 (store .cse97 v_prenex_9 v_prenex_8))) (let ((.cse94 (select (select .cse99 .cse91) 0)) (.cse95 (select (select .cse93 .cse91) 0))) (let ((.cse92 (select (select .cse99 .cse94) .cse95))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse91 .cse92) (not (= (select |c_#valid| .cse91) 0)) (= (select (select .cse93 .cse94) .cse95) (let ((.cse96 (store .cse98 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse96 (select (select (store .cse97 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse91) 0)) (select (select .cse96 .cse91) 0)))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse92 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse91 1) v_prenex_9) 0))))))))) (forall ((v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int)) (let ((.cse100 (select v_arrayElimArr_25 0))) (let ((.cse101 (store (store |c_#memory_$Pointer$.offset| .cse100 v_arrayElimArr_28) |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse104 (store (store |c_#memory_$Pointer$.base| .cse100 v_arrayElimArr_27) |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse102 (select (select .cse104 .cse100) 0)) (.cse103 (select (select .cse101 .cse100) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse100 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse101 .cse102) .cse103) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse100) 0)) (not (= (select (select .cse104 .cse102) .cse103) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse108 (select v_prenex_8 0))) (let ((.cse115 (store |c_#memory_$Pointer$.base| .cse108 v_arrayElimArr_27)) (.cse116 (store |c_#memory_$Pointer$.offset| .cse108 v_arrayElimArr_28))) (let ((.cse111 (store .cse116 v_prenex_9 v_prenex_7)) (.cse114 (store .cse115 v_prenex_9 v_prenex_8))) (let ((.cse112 (select (select .cse114 .cse108) 0)) (.cse113 (select (select .cse111 .cse108) 0)) (.cse105 (store .cse116 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse109 (store .cse115 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse106 (select (select .cse109 .cse108) 0)) (.cse107 (select (select .cse105 .cse108) 0)) (.cse110 (select (select .cse114 .cse112) .cse113))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse105 .cse106) .cse107) 0) (not (= (select |c_#valid| .cse108) 0)) (= (select (select .cse109 .cse106) .cse107) .cse110) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse111 .cse112) .cse113) 0) (= .cse110 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse108 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse121 (select v_arrayElimArr_25 0))) (let ((.cse127 (store |c_#memory_$Pointer$.base| .cse121 v_arrayElimArr_27)) (.cse128 (store |c_#memory_$Pointer$.offset| .cse121 v_arrayElimArr_28))) (let ((.cse126 (store .cse128 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse123 (store .cse127 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse124 (select (select .cse123 .cse121) 0)) (.cse125 (select (select .cse126 .cse121) 0)) (.cse118 (store .cse128 v_prenex_9 v_prenex_7)) (.cse122 (store .cse127 v_prenex_9 v_prenex_8))) (let ((.cse119 (select (select .cse122 .cse121) 0)) (.cse120 (select (select .cse118 .cse121) 0)) (.cse117 (select (select .cse126 .cse124) .cse125))) (or (= .cse117 (select (select .cse118 .cse119) .cse120)) (= .cse121 (select (select .cse122 .cse119) .cse120)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse121 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse117 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse121) 0)) (not (= (select (select .cse123 .cse124) .cse125) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse131 (select v_arrayElimArr_25 0))) (let ((.cse137 (store |c_#memory_$Pointer$.base| .cse131 v_arrayElimArr_27)) (.cse138 (store |c_#memory_$Pointer$.offset| .cse131 v_arrayElimArr_28))) (let ((.cse132 (store .cse138 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse135 (store .cse137 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse133 (select (select .cse135 .cse131) 0)) (.cse134 (select (select .cse132 .cse131) 0))) (let ((.cse130 (select (let ((.cse136 (store .cse137 v_prenex_9 v_prenex_8))) (select .cse136 (select (select .cse136 .cse131) 0))) (select (select (store .cse138 v_prenex_9 v_prenex_7) .cse131) 0))) (.cse129 (select (select .cse135 .cse133) .cse134))) (or (= .cse129 .cse130) (= .cse131 .cse130) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse131 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse132 .cse133) .cse134) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse131) 0)) (not (= .cse129 |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse140 (select v_prenex_8 0))) (let ((.cse141 (store (store |c_#memory_$Pointer$.offset| .cse140 v_arrayElimArr_28) v_prenex_9 v_prenex_7)) (.cse144 (store (store |c_#memory_$Pointer$.base| .cse140 v_arrayElimArr_27) v_prenex_9 v_prenex_8))) (let ((.cse142 (select (select .cse144 .cse140) 0)) (.cse143 (select (select .cse141 .cse140) 0))) (let ((.cse139 (select (select .cse144 .cse142) .cse143))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_prenex_9 .cse139)) (not (= (select |c_#valid| .cse140) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse141 .cse142) .cse143) 0) (= .cse139 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse140 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse145 (select v_prenex_8 0))) (let ((.cse155 (store |c_#memory_$Pointer$.base| .cse145 v_arrayElimArr_27)) (.cse156 (store |c_#memory_$Pointer$.offset| .cse145 v_arrayElimArr_28))) (let ((.cse147 (store .cse156 v_prenex_9 v_prenex_7)) (.cse154 (store .cse155 v_prenex_9 v_prenex_8))) (let ((.cse148 (select (select .cse154 .cse145) 0)) (.cse149 (select (select .cse147 .cse145) 0)) (.cse150 (store .cse156 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse153 (store .cse155 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse151 (select (select .cse153 .cse145) 0)) (.cse152 (select (select .cse150 .cse145) 0)) (.cse146 (select (select .cse154 .cse148) .cse149))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse145 .cse146) (not (= (select |c_#valid| .cse145) 0)) (= (select (select .cse147 .cse148) .cse149) (select (select .cse150 .cse151) .cse152)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse153 .cse151) .cse152) .cse145) (= .cse146 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse145 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse160 (select v_arrayElimArr_25 0))) (let ((.cse159 (store |c_#memory_$Pointer$.base| .cse160 v_arrayElimArr_27)) (.cse161 (store |c_#memory_$Pointer$.offset| .cse160 v_arrayElimArr_28))) (let ((.cse157 (let ((.cse162 (store .cse161 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse162 (select (select (store .cse159 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse160) 0)) (select (select .cse162 .cse160) 0))))) (or (= .cse157 (let ((.cse158 (store .cse161 v_prenex_9 v_prenex_7))) (select (select .cse158 (select (select (store .cse159 v_prenex_9 v_prenex_8) .cse160) 0)) (select (select .cse158 .cse160) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse160 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse157 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse160) 0)) (not (= (select v_arrayElimArr_26 0) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse167 (select v_arrayElimArr_25 0))) (let ((.cse170 (store |c_#memory_$Pointer$.base| .cse167 v_arrayElimArr_27)) (.cse171 (store |c_#memory_$Pointer$.offset| .cse167 v_arrayElimArr_28))) (let ((.cse164 (store .cse171 v_prenex_9 v_prenex_7)) (.cse168 (store .cse170 v_prenex_9 v_prenex_8))) (let ((.cse165 (select (select .cse168 .cse167) 0)) (.cse166 (select (select .cse164 .cse167) 0)) (.cse163 (let ((.cse169 (store .cse171 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse169 (select (select (store .cse170 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse167) 0)) (select (select .cse169 .cse167) 0))))) (or (= .cse163 (select (select .cse164 .cse165) .cse166)) (= .cse167 (select (select .cse168 .cse165) .cse166)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse167 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse163 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse167) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse176 (select v_arrayElimArr_25 0))) (let ((.cse179 (store |c_#memory_$Pointer$.base| .cse176 v_arrayElimArr_27)) (.cse180 (store |c_#memory_$Pointer$.offset| .cse176 v_arrayElimArr_28))) (let ((.cse177 (store .cse180 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse172 (store .cse179 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse175 (select (let ((.cse178 (store .cse179 v_prenex_9 v_prenex_8))) (select .cse178 (select (select .cse178 .cse176) 0))) (select (select (store .cse180 v_prenex_9 v_prenex_7) .cse176) 0))) (.cse173 (select (select .cse172 .cse176) 0)) (.cse174 (select (select .cse177 .cse176) 0))) (or (= (select (select .cse172 .cse173) .cse174) .cse175) (= .cse176 .cse175) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse176 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse177 .cse173) .cse174) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse176) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse181 (select v_prenex_8 0))) (let ((.cse183 (store |c_#memory_$Pointer$.base| .cse181 v_arrayElimArr_27)) (.cse184 (store |c_#memory_$Pointer$.offset| .cse181 v_arrayElimArr_28))) (let ((.cse186 (store .cse184 v_prenex_9 v_prenex_7)) (.cse189 (store .cse183 v_prenex_9 v_prenex_8))) (let ((.cse187 (select (select .cse189 .cse181) 0)) (.cse188 (select (select .cse186 .cse181) 0))) (let ((.cse185 (select (select .cse189 .cse187) .cse188))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse181) 0)) (= (select (let ((.cse182 (store .cse183 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse182 (select (select .cse182 .cse181) 0))) (select (select (store .cse184 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse181) 0)) .cse185) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse186 .cse187) .cse188) 0) (= .cse185 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse181 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse190 (select v_prenex_8 0))) (let ((.cse200 (store |c_#memory_$Pointer$.base| .cse190 v_arrayElimArr_27)) (.cse201 (store |c_#memory_$Pointer$.offset| .cse190 v_arrayElimArr_28))) (let ((.cse199 (store .cse201 v_prenex_9 v_prenex_7)) (.cse196 (store .cse200 v_prenex_9 v_prenex_8))) (let ((.cse192 (store .cse201 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse195 (store .cse200 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25)) (.cse197 (select (select .cse196 .cse190) 0)) (.cse198 (select (select .cse199 .cse190) 0))) (let ((.cse191 (select (select .cse199 .cse197) .cse198)) (.cse193 (select (select .cse195 .cse190) 0)) (.cse194 (select (select .cse192 .cse190) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse190) 0)) (= .cse191 (select (select .cse192 .cse193) .cse194)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse191 0) (= (select (select .cse195 .cse193) .cse194) .cse190) (= (select (select .cse196 .cse197) .cse198) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse190 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse202 (select v_prenex_8 0))) (let ((.cse205 (store |c_#memory_$Pointer$.base| .cse202 v_arrayElimArr_27)) (.cse206 (store |c_#memory_$Pointer$.offset| .cse202 v_arrayElimArr_28))) (let ((.cse203 (select (let ((.cse207 (store .cse205 v_prenex_9 v_prenex_8))) (select .cse207 (select (select .cse207 .cse202) 0))) (select (select (store .cse206 v_prenex_9 v_prenex_7) .cse202) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse202 .cse203) (not (= (select |c_#valid| .cse202) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (let ((.cse204 (store .cse205 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse204 (select (select .cse204 .cse202) 0))) (select (select (store .cse206 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse202) 0)) .cse202) (= .cse203 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse202 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse208 (select v_prenex_8 0))) (let ((.cse212 (store |c_#memory_$Pointer$.base| .cse208 v_arrayElimArr_27)) (.cse213 (store |c_#memory_$Pointer$.offset| .cse208 v_arrayElimArr_28))) (let ((.cse210 (select (let ((.cse214 (store .cse212 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse214 (select (select .cse214 .cse208) 0))) (select (select (store .cse213 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse208) 0))) (.cse209 (select (let ((.cse211 (store .cse212 v_prenex_9 v_prenex_8))) (select .cse211 (select (select .cse211 .cse208) 0))) (select (select (store .cse213 v_prenex_9 v_prenex_7) .cse208) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse208 .cse209) (not (= (select |c_#valid| .cse208) 0)) (= .cse210 .cse209) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse210 .cse208) (= .cse209 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse208 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse215 (select v_prenex_8 0))) (let ((.cse218 (store |c_#memory_$Pointer$.base| .cse215 v_arrayElimArr_27)) (.cse219 (store |c_#memory_$Pointer$.offset| .cse215 v_arrayElimArr_28))) (let ((.cse223 (store .cse219 v_prenex_9 v_prenex_7)) (.cse220 (store .cse218 v_prenex_9 v_prenex_8))) (let ((.cse221 (select (select .cse220 .cse215) 0)) (.cse222 (select (select .cse223 .cse215) 0))) (let ((.cse216 (select (select .cse223 .cse221) .cse222))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse215) 0)) (= .cse216 (let ((.cse217 (store .cse219 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse217 (select (select (store .cse218 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse215) 0)) (select (select .cse217 .cse215) 0)))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse216 0) (= (select (select .cse220 .cse221) .cse222) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse215 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse224 (select v_arrayElimArr_25 0))) (let ((.cse230 (store |c_#memory_$Pointer$.base| .cse224 v_arrayElimArr_27)) (.cse231 (store |c_#memory_$Pointer$.offset| .cse224 v_arrayElimArr_28))) (let ((.cse225 (store .cse231 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse228 (store .cse230 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse226 (select (select .cse228 .cse224) 0)) (.cse227 (select (select .cse225 .cse224) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse224 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse225 .cse226) .cse227) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse224) 0)) (= (select (select .cse228 .cse226) .cse227) .cse224) (= (let ((.cse229 (store .cse231 v_prenex_9 v_prenex_7))) (select (select .cse229 (select (select (store .cse230 v_prenex_9 v_prenex_8) .cse224) 0)) (select (select .cse229 .cse224) 0))) 0) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse234 (select v_prenex_8 0))) (let ((.cse233 (store |c_#memory_$Pointer$.base| .cse234 v_arrayElimArr_27)) (.cse235 (store |c_#memory_$Pointer$.offset| .cse234 v_arrayElimArr_28))) (let ((.cse236 (select (let ((.cse237 (store .cse233 v_prenex_9 v_prenex_8))) (select .cse237 (select (select .cse237 .cse234) 0))) (select (select (store .cse235 v_prenex_9 v_prenex_7) .cse234) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (let ((.cse232 (store .cse235 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse232 (select (select (store .cse233 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse234) 0)) (select (select .cse232 .cse234) 0))) 0) (= .cse234 .cse236) (not (= (select |c_#valid| .cse234) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse236 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse234 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse241 (select v_arrayElimArr_25 0))) (let ((.cse240 (store |c_#memory_$Pointer$.base| .cse241 v_arrayElimArr_27)) (.cse242 (store |c_#memory_$Pointer$.offset| .cse241 v_arrayElimArr_28))) (let ((.cse246 (store .cse242 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse243 (store .cse240 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse244 (select (select .cse243 .cse241) 0)) (.cse245 (select (select .cse246 .cse241) 0))) (let ((.cse238 (select (select .cse246 .cse244) .cse245))) (or (= .cse238 (let ((.cse239 (store .cse242 v_prenex_9 v_prenex_7))) (select (select .cse239 (select (select (store .cse240 v_prenex_9 v_prenex_8) .cse241) 0)) (select (select .cse239 .cse241) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse241 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse238 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse241) 0)) (= (select (select .cse243 .cse244) .cse245) .cse241) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse249 (select v_arrayElimArr_25 0))) (let ((.cse250 (store |c_#memory_$Pointer$.base| .cse249 v_arrayElimArr_27)) (.cse251 (store |c_#memory_$Pointer$.offset| .cse249 v_arrayElimArr_28))) (let ((.cse252 (store .cse251 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse255 (store .cse250 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse253 (select (select .cse255 .cse249) 0)) (.cse254 (select (select .cse252 .cse249) 0))) (let ((.cse247 (select (select .cse255 .cse253) .cse254))) (or (= .cse247 (select (let ((.cse248 (store .cse250 v_prenex_9 v_prenex_8))) (select .cse248 (select (select .cse248 .cse249) 0))) (select (select (store .cse251 v_prenex_9 v_prenex_7) .cse249) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse249 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse252 .cse253) .cse254) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse249) 0)) (not (= .cse247 |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse258 (select v_arrayElimArr_25 0))) (let ((.cse259 (store |c_#memory_$Pointer$.base| .cse258 v_arrayElimArr_27)) (.cse260 (store |c_#memory_$Pointer$.offset| .cse258 v_arrayElimArr_28))) (let ((.cse261 (store .cse260 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse264 (store .cse259 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse262 (select (select .cse264 .cse258) 0)) (.cse263 (select (select .cse261 .cse258) 0))) (let ((.cse256 (select (select .cse264 .cse262) .cse263))) (or (= .cse256 (select (let ((.cse257 (store .cse259 v_prenex_9 v_prenex_8))) (select .cse257 (select (select .cse257 .cse258) 0))) (select (select (store .cse260 v_prenex_9 v_prenex_7) .cse258) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse258 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse261 .cse262) .cse263) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse258) 0)) (= .cse256 .cse258) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse265 (select v_prenex_8 0))) (let ((.cse273 (store |c_#memory_$Pointer$.base| .cse265 v_arrayElimArr_27)) (.cse274 (store |c_#memory_$Pointer$.offset| .cse265 v_arrayElimArr_28))) (let ((.cse268 (store .cse274 v_prenex_9 v_prenex_7)) (.cse271 (store .cse273 v_prenex_9 v_prenex_8))) (let ((.cse269 (select (select .cse271 .cse265) 0)) (.cse270 (select (select .cse268 .cse265) 0))) (let ((.cse266 (select (let ((.cse272 (store .cse273 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse272 (select (select .cse272 .cse265) 0))) (select (select (store .cse274 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse265) 0))) (.cse267 (select (select .cse271 .cse269) .cse270))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse265) 0)) (= .cse266 .cse267) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse268 .cse269) .cse270) 0) (= .cse266 .cse265) (= .cse267 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse265 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse276 (select v_prenex_8 0))) (let ((.cse283 (store |c_#memory_$Pointer$.base| .cse276 v_arrayElimArr_27)) (.cse284 (store |c_#memory_$Pointer$.offset| .cse276 v_arrayElimArr_28))) (let ((.cse281 (store .cse284 v_prenex_9 v_prenex_7)) (.cse278 (store .cse283 v_prenex_9 v_prenex_8))) (let ((.cse279 (select (select .cse278 .cse276) 0)) (.cse280 (select (select .cse281 .cse276) 0))) (let ((.cse275 (let ((.cse282 (store .cse284 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse282 (select (select (store .cse283 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse276) 0)) (select (select .cse282 .cse276) 0)))) (.cse277 (select (select .cse281 .cse279) .cse280))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse275 0) (not (= (select |c_#valid| .cse276) 0)) (= .cse277 .cse275) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse277 0) (= (select (select .cse278 .cse279) .cse280) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse276 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse286 (select v_prenex_8 0))) (let ((.cse293 (store |c_#memory_$Pointer$.base| .cse286 v_arrayElimArr_27)) (.cse294 (store |c_#memory_$Pointer$.offset| .cse286 v_arrayElimArr_28))) (let ((.cse288 (store .cse294 v_prenex_9 v_prenex_7)) (.cse291 (store .cse293 v_prenex_9 v_prenex_8))) (let ((.cse289 (select (select .cse291 .cse286) 0)) (.cse290 (select (select .cse288 .cse286) 0))) (let ((.cse285 (let ((.cse292 (store .cse294 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse292 (select (select (store .cse293 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse286) 0)) (select (select .cse292 .cse286) 0)))) (.cse287 (select (select .cse291 .cse289) .cse290))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse285 0) (= .cse286 .cse287) (not (= (select |c_#valid| .cse286) 0)) (= (select (select .cse288 .cse289) .cse290) .cse285) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse287 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse286 1) v_prenex_9) 0)))))))))) is different from false [2022-11-21 16:25:00,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:00,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 216 [2022-11-21 16:25:00,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:00,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 144 [2022-11-21 16:25:00,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:00,434 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2022-11-21 16:25:00,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 863 treesize of output 785 [2022-11-21 16:25:00,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 657 treesize of output 651 [2022-11-21 16:25:00,491 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 670 treesize of output 491 [2022-11-21 16:25:00,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:00,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 365 treesize of output 315 [2022-11-21 16:25:00,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:00,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 210 treesize of output 192 [2022-11-21 16:25:00,583 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2022-11-21 16:25:00,602 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-11-21 16:25:00,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,624 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:25:00,624 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2022-11-21 16:25:00,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:00,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 197 [2022-11-21 16:25:00,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:00,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 137 [2022-11-21 16:25:00,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:00,899 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2022-11-21 16:25:00,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 871 treesize of output 633 [2022-11-21 16:25:00,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:00,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 650 treesize of output 636 [2022-11-21 16:25:00,950 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 652 treesize of output 526 [2022-11-21 16:25:00,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:00,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 521 treesize of output 483 [2022-11-21 16:25:01,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:01,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 450 treesize of output 400 [2022-11-21 16:25:01,023 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:25:01,023 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-21 16:25:01,056 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-11-21 16:25:01,070 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2022-11-21 16:25:01,492 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 1 [2022-11-21 16:25:01,505 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 1 [2022-11-21 16:25:01,517 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2022-11-21 16:25:01,529 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2022-11-21 16:25:01,541 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2022-11-21 16:25:01,553 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 1 [2022-11-21 16:25:01,564 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2022-11-21 16:25:01,575 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2022-11-21 16:25:01,585 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2022-11-21 16:25:01,597 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2022-11-21 16:25:01,608 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-11-21 16:25:01,631 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2022-11-21 16:25:01,643 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2022-11-21 16:25:01,655 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2022-11-21 16:25:01,666 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2022-11-21 16:25:01,677 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-11-21 16:25:01,690 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-11-21 16:25:01,703 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 1 [2022-11-21 16:25:01,715 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2022-11-21 16:25:01,726 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 1 [2022-11-21 16:25:01,738 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-11-21 16:25:01,751 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 1 [2022-11-21 16:25:01,763 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 1 [2022-11-21 16:25:01,774 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2022-11-21 16:25:01,789 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 1 [2022-11-21 16:25:01,800 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 1 [2022-11-21 16:25:01,812 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-11-21 16:25:01,824 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 1 [2022-11-21 16:25:01,835 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2022-11-21 16:25:01,847 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-11-21 16:25:01,857 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2022-11-21 16:25:01,869 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2022-11-21 16:25:01,883 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:25:01,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 1 [2022-11-21 16:25:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-21 16:25:01,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310027568] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:25:01,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:25:01,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 36 [2022-11-21 16:25:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050698195] [2022-11-21 16:25:01,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:25:01,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-21 16:25:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-21 16:25:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1067, Unknown=1, NotChecked=66, Total=1260 [2022-11-21 16:25:01,914 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:07,675 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2022-11-21 16:25:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-21 16:25:07,676 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-21 16:25:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:07,677 INFO L225 Difference]: With dead ends: 200 [2022-11-21 16:25:07,677 INFO L226 Difference]: Without dead ends: 129 [2022-11-21 16:25:07,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=523, Invalid=4172, Unknown=1, NotChecked=134, Total=4830 [2022-11-21 16:25:07,680 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 159 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:07,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1212 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 934 Invalid, 0 Unknown, 82 Unchecked, 1.9s Time] [2022-11-21 16:25:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-21 16:25:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2022-11-21 16:25:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-11-21 16:25:07,697 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 51 [2022-11-21 16:25:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:07,697 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-11-21 16:25:07,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-11-21 16:25:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 16:25:07,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:07,698 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:25:07,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:25:07,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 16:25:07,912 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1013477057, now seen corresponding path program 6 times [2022-11-21 16:25:07,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:07,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421687955] [2022-11-21 16:25:07,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:07,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:11,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:11,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421687955] [2022-11-21 16:25:11,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421687955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:25:11,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469047349] [2022-11-21 16:25:11,696 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 16:25:11,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:11,699 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:25:11,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:25:12,308 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-21 16:25:12,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:25:12,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-21 16:25:12,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:25:12,329 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:25:12,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:12,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:12,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:25:12,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:25:12,506 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 16:25:12,506 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-21 16:25:12,521 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2022-11-21 16:25:12,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:25:12,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:25:12,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:25:12,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:12,778 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 49 [2022-11-21 16:25:12,806 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 16:25:12,807 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 40 treesize of output 44 [2022-11-21 16:25:12,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:12,857 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-21 16:25:12,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-11-21 16:25:12,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:12,883 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-21 16:25:13,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:25:13,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:25:13,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:13,221 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 16:25:13,222 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2022-11-21 16:25:13,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:13,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:13,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:13,234 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 38 [2022-11-21 16:25:13,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:13,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:13,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:13,262 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-21 16:25:13,262 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-11-21 16:25:13,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 36 [2022-11-21 16:25:15,861 INFO L321 Elim1Store]: treesize reduction 236, result has 45.0 percent of original size [2022-11-21 16:25:15,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 297 treesize of output 321 [2022-11-21 16:25:16,261 INFO L321 Elim1Store]: treesize reduction 224, result has 38.6 percent of original size [2022-11-21 16:25:16,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 193 treesize of output 275 [2022-11-21 16:25:25,085 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-21 16:25:25,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-11-21 16:25:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:25,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:25:25,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:25,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 135 [2022-11-21 16:25:25,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:25,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2022-11-21 16:25:26,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:26,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 251 [2022-11-21 16:25:26,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:26,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 221 [2022-11-21 16:25:26,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_40| Int) (v_ArrVal_921 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (v_arrayElimArr_71 (Array Int Int)) (v_arrayElimArr_73 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (v_arrayElimArr_74 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_71 0))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_74) |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_72)) (.cse7 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_73) |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_71)) (.cse1 (select v_arrayElimArr_72 0))) (let ((.cse5 (select (select .cse7 .cse0) .cse1)) (.cse6 (select (select .cse4 .cse0) .cse1))) (let ((.cse2 (select (store (store |c_#memory_int| .cse0 v_ArrVal_914) |v_ULTIMATE.start_main_~l~0#1.base_40| v_ArrVal_921) (select (select .cse7 .cse5) .cse6))) (.cse3 (select (select .cse4 .cse5) .cse6))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_74 .cse1))) (not (= (select v_arrayElimArr_73 .cse1) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= .cse1 0)) (not (= (select .cse2 (+ .cse3 8)) 3)) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_40|) 0)) (not (= (select .cse2 (+ .cse3 4)) 1)))))))) is different from false [2022-11-21 16:25:26,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:26,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 467 treesize of output 363 [2022-11-21 16:25:26,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:25:26,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 243 [2022-11-21 16:25:26,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:26,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:26,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:26,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:25:26,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 119 [2022-11-21 16:25:26,442 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 142 [2022-11-21 16:25:26,449 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2022-11-21 16:25:26,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:26,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:26,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:25:26,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2022-11-21 16:25:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-21 16:25:26,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469047349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:25:26,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:25:26,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 39 [2022-11-21 16:25:26,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719867809] [2022-11-21 16:25:26,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:25:26,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-21 16:25:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-21 16:25:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1302, Unknown=3, NotChecked=72, Total=1482 [2022-11-21 16:25:26,767 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:09,919 INFO L93 Difference]: Finished difference Result 351 states and 426 transitions. [2022-11-21 16:26:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-11-21 16:26:09,920 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-21 16:26:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:09,921 INFO L225 Difference]: With dead ends: 351 [2022-11-21 16:26:09,921 INFO L226 Difference]: Without dead ends: 311 [2022-11-21 16:26:09,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5121 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=3925, Invalid=13898, Unknown=3, NotChecked=264, Total=18090 [2022-11-21 16:26:09,925 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2629 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2629 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:09,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2629 Valid, 804 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 691 Invalid, 0 Unknown, 135 Unchecked, 2.0s Time] [2022-11-21 16:26:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-21 16:26:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 95. [2022-11-21 16:26:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-11-21 16:26:09,947 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 56 [2022-11-21 16:26:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:09,948 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-11-21 16:26:09,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-11-21 16:26:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 16:26:09,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:09,949 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:09,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:10,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 16:26:10,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:26:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1512229753, now seen corresponding path program 3 times [2022-11-21 16:26:10,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:26:10,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859311911] [2022-11-21 16:26:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:26:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:26:12,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:26:12,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859311911] [2022-11-21 16:26:12,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859311911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:26:12,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711667200] [2022-11-21 16:26:12,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:26:12,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:26:12,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:26:12,294 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:26:12,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:26:12,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-21 16:26:12,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:26:12,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-21 16:26:12,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:13,001 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:26:13,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:26:13,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:26:13,126 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 16:26:13,126 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-21 16:26:13,139 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2022-11-21 16:26:13,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:26:13,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:13,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:13,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,358 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 49 [2022-11-21 16:26:13,381 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 16:26:13,381 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 40 treesize of output 44 [2022-11-21 16:26:13,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,428 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-21 16:26:13,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-11-21 16:26:13,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,447 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-21 16:26:13,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:13,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:13,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,744 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 34 [2022-11-21 16:26:13,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,766 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 16:26:13,767 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2022-11-21 16:26:13,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:13,809 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-21 16:26:13,809 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-11-21 16:26:13,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 36 [2022-11-21 16:26:16,312 INFO L321 Elim1Store]: treesize reduction 252, result has 41.3 percent of original size [2022-11-21 16:26:16,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 297 treesize of output 305 [2022-11-21 16:26:16,812 INFO L321 Elim1Store]: treesize reduction 196, result has 46.3 percent of original size [2022-11-21 16:26:16,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 177 treesize of output 291 [2022-11-21 16:26:24,618 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-21 16:26:24,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-11-21 16:26:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:26:24,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:26:25,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:25,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 135 [2022-11-21 16:26:25,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:25,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2022-11-21 16:26:25,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:25,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 221 [2022-11-21 16:26:25,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:25,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 203 [2022-11-21 16:26:25,535 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_82 (Array Int Int)) (v_arrayElimArr_81 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_47| Int) (v_ArrVal_1087 (Array Int Int)) (v_arrayElimArr_84 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_arrayElimArr_83 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_81 0))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_83) |v_ULTIMATE.start_main_~l~0#1.base_47| v_arrayElimArr_82)) (.cse6 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_84) |v_ULTIMATE.start_main_~l~0#1.base_47| v_arrayElimArr_81))) (let ((.cse4 (select (select .cse6 .cse0) 0)) (.cse5 (select (select .cse3 .cse0) 0))) (let ((.cse1 (select (store (store |c_#memory_int| .cse0 v_ArrVal_1087) |v_ULTIMATE.start_main_~l~0#1.base_47| v_ArrVal_1097) (select (select .cse6 .cse4) .cse5))) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (not (= (select v_arrayElimArr_83 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select v_arrayElimArr_84 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_82 0) 0)) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_47|) 0)) (not (= (select .cse1 (+ .cse2 4)) 0)) (not (= 2 (select .cse1 (+ .cse2 8)))))))))) is different from false [2022-11-21 16:26:25,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:25,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 303 [2022-11-21 16:26:25,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:25,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 219 [2022-11-21 16:26:25,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:26:25,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:26:25,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:26:25,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:25,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 107 [2022-11-21 16:26:25,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:26:25,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 689 treesize of output 649 [2022-11-21 16:26:25,817 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 682 treesize of output 572 [2022-11-21 16:26:25,827 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 466 [2022-11-21 16:26:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-21 16:26:26,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711667200] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:26:26,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:26:26,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 32 [2022-11-21 16:26:26,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616109010] [2022-11-21 16:26:26,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:26:26,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 16:26:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:26:26,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 16:26:26,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=4, NotChecked=58, Total=992 [2022-11-21 16:26:26,372 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:53,181 INFO L93 Difference]: Finished difference Result 251 states and 302 transitions. [2022-11-21 16:26:53,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-21 16:26:53,181 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-21 16:26:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:53,182 INFO L225 Difference]: With dead ends: 251 [2022-11-21 16:26:53,182 INFO L226 Difference]: Without dead ends: 249 [2022-11-21 16:26:53,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3033 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=2464, Invalid=8248, Unknown=4, NotChecked=204, Total=10920 [2022-11-21 16:26:53,186 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1250 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:53,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 579 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 619 Invalid, 0 Unknown, 114 Unchecked, 1.7s Time] [2022-11-21 16:26:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-21 16:26:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 106. [2022-11-21 16:26:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2022-11-21 16:26:53,210 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 58 [2022-11-21 16:26:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:53,211 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2022-11-21 16:26:53,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2022-11-21 16:26:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-21 16:26:53,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:53,212 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:53,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:53,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 16:26:53,419 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:26:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1492842773, now seen corresponding path program 7 times [2022-11-21 16:26:53,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:26:53,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105577738] [2022-11-21 16:26:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:26:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:26:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:26:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105577738] [2022-11-21 16:26:55,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105577738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:26:55,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725356439] [2022-11-21 16:26:55,335 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 16:26:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:26:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:26:55,336 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:26:55,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 16:26:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:55,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-21 16:26:55,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:55,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:26:55,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:26:55,606 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:26:55,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:55,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:55,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:55,729 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-21 16:26:55,753 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 16:26:55,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-21 16:26:55,797 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 16:26:55,797 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-21 16:26:55,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:55,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:55,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,004 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 16:26:56,004 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2022-11-21 16:26:56,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,030 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 16:26:56,031 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 33 treesize of output 50 [2022-11-21 16:26:56,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,078 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-21 16:26:56,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-11-21 16:26:56,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:56,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:26:56,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,388 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-11-21 16:26:56,388 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 86 [2022-11-21 16:26:56,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,421 INFO L321 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2022-11-21 16:26:56,421 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 52 treesize of output 76 [2022-11-21 16:26:56,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:56,469 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-21 16:26:56,470 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-11-21 16:26:58,389 INFO L321 Elim1Store]: treesize reduction 194, result has 10.2 percent of original size [2022-11-21 16:26:58,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 251 treesize of output 121 [2022-11-21 16:26:58,433 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-11-21 16:26:58,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2022-11-21 16:26:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:26:58,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:26:58,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:58,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 133 [2022-11-21 16:26:58,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:58,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 112 [2022-11-21 16:26:59,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:59,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 219 [2022-11-21 16:26:59,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:59,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 198 [2022-11-21 16:26:59,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:59,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 363 treesize of output 349 [2022-11-21 16:26:59,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:26:59,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 328 [2022-11-21 16:27:00,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:27:00,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 177 [2022-11-21 16:27:00,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:00,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:00,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:00,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:00,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,032 INFO L321 Elim1Store]: treesize reduction 769, result has 2.7 percent of original size [2022-11-21 16:27:01,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 39134 treesize of output 35744 [2022-11-21 16:27:01,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:27:01,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35716 treesize of output 23846 [2022-11-21 16:27:01,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3560 treesize of output 3554 [2022-11-21 16:27:01,170 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 3602 treesize of output 2636 [2022-11-21 16:27:01,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,212 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-21 16:27:01,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2596 treesize of output 2410 [2022-11-21 16:27:01,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,302 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:27:01,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2276 treesize of output 1898 [2022-11-21 16:27:01,377 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1228 treesize of output 1098 [2022-11-21 16:27:01,390 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1089 treesize of output 977 [2022-11-21 16:27:01,434 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 16:27:01,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 956 treesize of output 874 [2022-11-21 16:27:01,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,474 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-21 16:27:01,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-11-21 16:27:01,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:27:01,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 189 [2022-11-21 16:27:01,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,520 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-21 16:27:01,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2760 treesize of output 2680 [2022-11-21 16:27:01,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:27:01,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2676 treesize of output 1750 [2022-11-21 16:27:01,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:27:01,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3820 treesize of output 3622 [2022-11-21 16:27:01,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3670 treesize of output 2608 [2022-11-21 16:27:01,620 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2568 treesize of output 2374 [2022-11-21 16:27:01,651 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2376 treesize of output 2278 [2022-11-21 16:27:01,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,680 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2320 treesize of output 2158 [2022-11-21 16:27:01,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:01,699 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2149 treesize of output 1681 [2022-11-21 16:27:01,744 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-21 16:27:01,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2022-11-21 16:27:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:27:01,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725356439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:27:01,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:27:01,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2022-11-21 16:27:01,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499587320] [2022-11-21 16:27:01,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:27:01,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 16:27:01,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:27:01,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 16:27:01,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2022-11-21 16:27:01,829 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:27:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:27:04,923 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2022-11-21 16:27:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:27:04,923 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-11-21 16:27:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:27:04,924 INFO L225 Difference]: With dead ends: 213 [2022-11-21 16:27:04,924 INFO L226 Difference]: Without dead ends: 121 [2022-11-21 16:27:04,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2022-11-21 16:27:04,925 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 130 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:27:04,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1197 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-21 16:27:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-21 16:27:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2022-11-21 16:27:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3) internal successors, (143), 110 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:27:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2022-11-21 16:27:04,944 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 64 [2022-11-21 16:27:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:27:04,944 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2022-11-21 16:27:04,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:27:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2022-11-21 16:27:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 16:27:04,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:27:04,946 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:27:04,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 16:27:05,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 16:27:05,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:27:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:27:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash -377962859, now seen corresponding path program 8 times [2022-11-21 16:27:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:27:05,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396810890] [2022-11-21 16:27:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:27:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:27:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:27:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 23 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:27:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:27:07,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396810890] [2022-11-21 16:27:07,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396810890] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:27:07,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701762843] [2022-11-21 16:27:07,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:27:07,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:27:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:27:07,909 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:27:07,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 16:27:08,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:27:08,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:27:08,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-21 16:27:08,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:27:08,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:08,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:08,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:27:08,165 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:27:08,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:27:08,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:27:08,334 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 16:27:08,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-21 16:27:08,382 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 16:27:08,382 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-21 16:27:08,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:27:08,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:27:08,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:08,601 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 49 [2022-11-21 16:27:08,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:08,608 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-21 16:27:08,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:08,647 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-21 16:27:08,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-11-21 16:27:08,666 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-11-21 16:27:08,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:27:08,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:27:08,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:08,983 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 16:27:08,983 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2022-11-21 16:27:08,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:08,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:08,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,023 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2022-11-21 16:27:09,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 73 [2022-11-21 16:27:09,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,051 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 38 [2022-11-21 16:27:09,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 36 [2022-11-21 16:27:09,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:27:09,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:27:09,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,534 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-11-21 16:27:09,534 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 117 [2022-11-21 16:27:09,571 INFO L321 Elim1Store]: treesize reduction 43, result has 48.8 percent of original size [2022-11-21 16:27:09,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-11-21 16:27:09,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,603 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 60 [2022-11-21 16:27:09,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:09,652 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-11-21 16:27:09,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 36 [2022-11-21 16:27:14,987 INFO L321 Elim1Store]: treesize reduction 416, result has 54.4 percent of original size [2022-11-21 16:27:14,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 23 new quantified variables, introduced 78 case distinctions, treesize of input 495 treesize of output 689 [2022-11-21 16:27:16,422 INFO L321 Elim1Store]: treesize reduction 376, result has 54.0 percent of original size [2022-11-21 16:27:16,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 78 case distinctions, treesize of input 575 treesize of output 799 [2022-11-21 16:32:13,615 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-21 16:32:13,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-11-21 16:32:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:32:13,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:32:14,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:14,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 271 [2022-11-21 16:32:14,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:14,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 229 [2022-11-21 16:32:15,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:15,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 521 treesize of output 485 [2022-11-21 16:32:15,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:15,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 479 treesize of output 443 [2022-11-21 16:32:15,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_109 (Array Int Int)) (v_arrayElimArr_110 (Array Int Int)) (v_arrayElimArr_112 (Array Int Int)) (v_arrayElimArr_111 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_64| Int) (v_ArrVal_1490 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_109 0))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse2 v_arrayElimArr_112) |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_110)) (.cse7 (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_111) |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_109)) (.cse3 (select v_arrayElimArr_110 0))) (let ((.cse8 (select (select .cse7 .cse2) .cse3)) (.cse9 (select (select .cse4 .cse2) .cse3))) (let ((.cse5 (select (select .cse7 .cse8) .cse9)) (.cse6 (select (select .cse4 .cse8) .cse9))) (let ((.cse0 (select (store (store |c_#memory_int| .cse2 v_ArrVal_1483) |v_ULTIMATE.start_main_~l~0#1.base_64| v_ArrVal_1490) (select (select .cse7 .cse5) .cse6))) (.cse1 (select (select .cse4 .cse5) .cse6))) (or (not (= 1 (select .cse0 (+ .cse1 4)))) (not (= 0 (select (store |c_#valid| .cse2 1) |v_ULTIMATE.start_main_~l~0#1.base_64|))) (not (= (select v_arrayElimArr_111 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_112 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select .cse0 (+ 8 .cse1)) 3)) (not (= .cse3 0)) (not (= (select |c_#valid| .cse2) 0))))))))) is different from false [2022-11-21 16:32:15,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:15,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 671 treesize of output 635 [2022-11-21 16:32:15,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:15,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 629 treesize of output 593 [2022-11-21 16:32:15,417 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_109 (Array Int Int)) (v_arrayElimArr_110 (Array Int Int)) (v_arrayElimArr_114 (Array Int Int)) (v_arrayElimArr_113 (Array Int Int)) (v_arrayElimArr_112 (Array Int Int)) (v_arrayElimArr_111 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_64| Int) (v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_111 0)) (.cse3 (select v_arrayElimArr_109 0))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_arrayElimArr_113) .cse3 v_arrayElimArr_112) |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_110)) (.cse9 (store (store (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_114) .cse3 v_arrayElimArr_111) |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_109)) (.cse4 (select v_arrayElimArr_110 0))) (let ((.cse10 (select (select .cse9 .cse3) .cse4)) (.cse11 (select (select .cse6 .cse3) .cse4))) (let ((.cse7 (select (select .cse9 .cse10) .cse11)) (.cse8 (select (select .cse6 .cse10) .cse11))) (let ((.cse0 (select (store (store (store |c_#memory_int| .cse5 v_ArrVal_1471) .cse3 v_ArrVal_1483) |v_ULTIMATE.start_main_~l~0#1.base_64| v_ArrVal_1490) (select (select .cse9 .cse7) .cse8))) (.cse1 (select (select .cse6 .cse7) .cse8)) (.cse2 (store |c_#valid| .cse5 1))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_114 0))) (not (= (select v_arrayElimArr_113 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= 3 (select .cse0 (+ .cse1 8)))) (not (= (select .cse2 .cse3) 0)) (not (= (select v_arrayElimArr_112 0) 0)) (not (= (select .cse0 (+ .cse1 4)) 1)) (not (= .cse4 0)) (not (= (select (store .cse2 .cse3 1) |v_ULTIMATE.start_main_~l~0#1.base_64|) 0)) (not (= (select |c_#valid| .cse5) 0))))))))) is different from false [2022-11-21 16:32:15,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:15,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 989 treesize of output 805 [2022-11-21 16:32:15,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:15,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 793 treesize of output 609 [2022-11-21 16:32:15,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:15,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:15,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:15,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 191 [2022-11-21 16:32:15,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:15,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:15,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:15,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:15,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:15,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:15,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 71169 treesize of output 66087 [2022-11-21 16:32:16,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:16,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:16,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66111 treesize of output 64177 [2022-11-21 16:32:16,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:16,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:16,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64177 treesize of output 21157 [2022-11-21 16:32:17,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:17,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:17,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20114 treesize of output 11696 [2022-11-21 16:32:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-21 16:32:19,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701762843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:32:19,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:32:19,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 41 [2022-11-21 16:32:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974248046] [2022-11-21 16:32:19,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:32:19,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 16:32:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:32:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 16:32:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1380, Unknown=4, NotChecked=150, Total=1640 [2022-11-21 16:32:19,014 INFO L87 Difference]: Start difference. First operand 111 states and 143 transitions. Second operand has 41 states, 41 states have (on average 4.585365853658536) internal successors, (188), 41 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:08,497 INFO L93 Difference]: Finished difference Result 312 states and 381 transitions. [2022-11-21 16:33:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-21 16:33:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.585365853658536) internal successors, (188), 41 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-21 16:33:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:08,498 INFO L225 Difference]: With dead ends: 312 [2022-11-21 16:33:08,498 INFO L226 Difference]: Without dead ends: 272 [2022-11-21 16:33:08,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 123 SyntacticMatches, 8 SemanticMatches, 115 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=3061, Invalid=10053, Unknown=4, NotChecked=454, Total=13572 [2022-11-21 16:33:08,501 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2055 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:08,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1133 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 852 Invalid, 0 Unknown, 256 Unchecked, 3.5s Time] [2022-11-21 16:33:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-21 16:33:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 111. [2022-11-21 16:33:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3) internal successors, (143), 110 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2022-11-21 16:33:08,529 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 69 [2022-11-21 16:33:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:08,529 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2022-11-21 16:33:08,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.585365853658536) internal successors, (188), 41 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2022-11-21 16:33:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:33:08,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:08,531 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:08,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:08,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 16:33:08,732 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:33:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash -668441507, now seen corresponding path program 4 times [2022-11-21 16:33:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191968520] [2022-11-21 16:33:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 23 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:14,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:14,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191968520] [2022-11-21 16:33:14,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191968520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:14,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665411865] [2022-11-21 16:33:14,220 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:33:14,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:14,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:14,221 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:14,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a577f01-bceb-4c4f-9d7b-9d16ca1aa9b0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 16:33:14,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:33:14,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:33:14,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-21 16:33:14,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:14,487 INFO L350 Elim1Store]: Elim1 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 [2022-11-21 16:33:14,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 26 [2022-11-21 16:33:14,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:33:14,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:33:14,623 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 16:33:14,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-21 16:33:14,664 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 16:33:14,664 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-21 16:33:14,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:33:14,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:33:14,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,905 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 49 [2022-11-21 16:33:14,945 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 16:33:14,946 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 40 treesize of output 44 [2022-11-21 16:33:14,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,990 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-21 16:33:14,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-11-21 16:33:15,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,013 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-21 16:33:15,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:33:15,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:33:15,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,347 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 16:33:15,347 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2022-11-21 16:33:15,375 INFO L321 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2022-11-21 16:33:15,375 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-21 16:33:15,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,426 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2022-11-21 16:33:15,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 73 [2022-11-21 16:33:15,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,460 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 38 [2022-11-21 16:33:15,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:33:15,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-21 16:33:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,915 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-11-21 16:33:15,915 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 117 [2022-11-21 16:33:15,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:15,934 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 60 [2022-11-21 16:33:15,986 INFO L321 Elim1Store]: treesize reduction 43, result has 48.8 percent of original size [2022-11-21 16:33:15,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-11-21 16:33:16,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:16,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:16,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:16,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:16,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:16,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:16,035 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-11-21 16:33:16,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 36 [2022-11-21 16:33:21,496 INFO L321 Elim1Store]: treesize reduction 424, result has 53.6 percent of original size [2022-11-21 16:33:21,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 23 new quantified variables, introduced 78 case distinctions, treesize of input 495 treesize of output 681 [2022-11-21 16:33:22,952 INFO L321 Elim1Store]: treesize reduction 384, result has 53.0 percent of original size [2022-11-21 16:33:22,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 78 case distinctions, treesize of input 551 treesize of output 767