./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/calendar.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 18:02:05,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:02:05,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:02:05,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:02:05,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:02:05,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:02:05,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:02:05,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:02:05,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:02:05,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:02:05,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:02:05,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:02:05,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:02:05,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:02:05,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:02:05,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:02:05,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:02:05,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:02:05,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:02:05,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:02:05,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:02:05,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:02:05,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:02:05,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:02:05,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:02:05,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:02:05,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:02:05,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:02:05,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:02:05,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:02:05,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:02:05,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:02:05,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:02:05,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:02:05,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:02:05,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:02:05,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:02:05,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:02:05,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:02:05,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:02:05,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:02:05,678 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:02:05,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:02:05,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:02:05,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:02:05,723 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:02:05,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:02:05,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:02:05,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:02:05,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:02:05,725 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:02:05,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:02:05,727 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:02:05,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:02:05,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:02:05,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:02:05,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:02:05,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:02:05,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:02:05,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:02:05,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:02:05,729 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:02:05,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:02:05,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:02:05,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:02:05,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:02:05,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:02:05,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:02:05,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:02:05,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:02:05,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:02:05,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:02:05,731 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:02:05,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:02:05,732 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:02:05,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:02:05,732 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/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_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R 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-25 18:02:06,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:02:06,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:02:06,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:02:06,088 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:02:06,089 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:02:06,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/heap-data/calendar.i [2022-11-25 18:02:09,158 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:02:09,525 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:02:09,526 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/sv-benchmarks/c/heap-data/calendar.i [2022-11-25 18:02:09,536 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/data/b814fc383/a7d259b32e7340bf801091cdee451083/FLAGa51d941e5 [2022-11-25 18:02:09,555 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/data/b814fc383/a7d259b32e7340bf801091cdee451083 [2022-11-25 18:02:09,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:02:09,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:02:09,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:02:09,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:02:09,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:02:09,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:02:09" (1/1) ... [2022-11-25 18:02:09,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4428954e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:09, skipping insertion in model container [2022-11-25 18:02:09,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:02:09" (1/1) ... [2022-11-25 18:02:09,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:02:09,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:02:09,992 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_09608545-a801-4315-b567-127ed5e4d6ec/sv-benchmarks/c/heap-data/calendar.i[23742,23755] [2022-11-25 18:02:09,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:02:10,007 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:02:10,043 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_09608545-a801-4315-b567-127ed5e4d6ec/sv-benchmarks/c/heap-data/calendar.i[23742,23755] [2022-11-25 18:02:10,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:02:10,071 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:02:10,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10 WrapperNode [2022-11-25 18:02:10,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:02:10,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:02:10,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:02:10,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:02:10,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,114 INFO L138 Inliner]: procedures = 121, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2022-11-25 18:02:10,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:02:10,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:02:10,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:02:10,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:02:10,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,139 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:02:10,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:02:10,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:02:10,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:02:10,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (1/1) ... [2022-11-25 18:02:10,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:02:10,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:02:10,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:02:10,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:02:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:02:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:02:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:02:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:02:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:02:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:02:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:02:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:02:10,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:02:10,334 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:02:10,336 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:02:10,586 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:02:10,597 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:02:10,598 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:02:10,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:02:10 BoogieIcfgContainer [2022-11-25 18:02:10,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:02:10,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:02:10,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:02:10,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:02:10,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:02:09" (1/3) ... [2022-11-25 18:02:10,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3f67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:02:10, skipping insertion in model container [2022-11-25 18:02:10,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:02:10" (2/3) ... [2022-11-25 18:02:10,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3f67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:02:10, skipping insertion in model container [2022-11-25 18:02:10,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:02:10" (3/3) ... [2022-11-25 18:02:10,609 INFO L112 eAbstractionObserver]: Analyzing ICFG calendar.i [2022-11-25 18:02:10,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:02:10,633 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:02:10,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:02:10,712 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;@3dd66e6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:02:10,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:02:10,717 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-25 18:02:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 18:02:10,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:10,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:02:10,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash 399551724, now seen corresponding path program 1 times [2022-11-25 18:02:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:10,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25884211] [2022-11-25 18:02:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:10,889 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-25 18:02:10,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:10,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25884211] [2022-11-25 18:02:10,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25884211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:02:10,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:02:10,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:02:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071345901] [2022-11-25 18:02:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:02:10,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:02:10,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:10,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:02:10,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:02:10,949 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-25 18:02:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:10,974 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-11-25 18:02:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:02:10,976 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-25 18:02:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:10,986 INFO L225 Difference]: With dead ends: 35 [2022-11-25 18:02:10,986 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 18:02:10,990 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-25 18:02:11,015 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-25 18:02:11,016 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-25 18:02:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 18:02:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 18:02:11,076 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-25 18:02:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-11-25 18:02:11,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2022-11-25 18:02:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:11,081 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-11-25 18:02:11,081 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-25 18:02:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-11-25 18:02:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:02:11,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:11,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:02:11,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:02:11,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:11,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1946762309, now seen corresponding path program 1 times [2022-11-25 18:02:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:11,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11343344] [2022-11-25 18:02:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:11,261 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-25 18:02:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:11,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11343344] [2022-11-25 18:02:11,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11343344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:02:11,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:02:11,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:02:11,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865092565] [2022-11-25 18:02:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:02:11,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:02:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:02:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:02:11,265 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-25 18:02:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:11,325 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-11-25 18:02:11,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:02:11,325 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-25 18:02:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:11,326 INFO L225 Difference]: With dead ends: 35 [2022-11-25 18:02:11,326 INFO L226 Difference]: Without dead ends: 23 [2022-11-25 18:02:11,327 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-25 18:02:11,328 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.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:11,329 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.0s Time] [2022-11-25 18:02:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-25 18:02:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-25 18:02:11,334 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-25 18:02:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-11-25 18:02:11,335 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-11-25 18:02:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:11,336 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-11-25 18:02:11,336 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-25 18:02:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-11-25 18:02:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:02:11,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:11,337 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:02:11,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:02:11,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:11,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1070818203, now seen corresponding path program 1 times [2022-11-25 18:02:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:11,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739111001] [2022-11-25 18:02:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:12,047 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-25 18:02:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739111001] [2022-11-25 18:02:12,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739111001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:02:12,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:02:12,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:02:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939896617] [2022-11-25 18:02:12,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:02:12,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:02:12,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:02:12,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:02:12,050 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-25 18:02:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:12,681 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2022-11-25 18:02:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:02:12,681 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-25 18:02:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:12,686 INFO L225 Difference]: With dead ends: 78 [2022-11-25 18:02:12,687 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 18:02:12,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:02:12,696 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 140 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:12,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 114 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:02:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 18:02:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 27. [2022-11-25 18:02:12,709 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-25 18:02:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-11-25 18:02:12,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-11-25 18:02:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:12,712 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-11-25 18:02:12,713 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-25 18:02:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-11-25 18:02:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:02:12,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:12,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:02:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:02:12,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1737463723, now seen corresponding path program 1 times [2022-11-25 18:02:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:12,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487080969] [2022-11-25 18:02:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:12,827 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-25 18:02:12,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:12,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487080969] [2022-11-25 18:02:12,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487080969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:02:12,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:02:12,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:02:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458514032] [2022-11-25 18:02:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:02:12,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:02:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:02:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:02:12,831 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-25 18:02:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:12,913 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-11-25 18:02:12,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:02:12,914 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-25 18:02:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:12,916 INFO L225 Difference]: With dead ends: 50 [2022-11-25 18:02:12,916 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 18:02:12,916 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-25 18:02:12,918 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:12,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:02:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 18:02:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-11-25 18:02:12,924 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-25 18:02:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-11-25 18:02:12,925 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2022-11-25 18:02:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:12,925 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-11-25 18:02:12,926 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-25 18:02:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-11-25 18:02:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:02:12,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:12,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:02:12,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:02:12,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1737523305, now seen corresponding path program 1 times [2022-11-25 18:02:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:12,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391606828] [2022-11-25 18:02:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:12,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:12,975 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-25 18:02:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:12,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391606828] [2022-11-25 18:02:12,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391606828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:02:12,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:02:12,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:02:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376401461] [2022-11-25 18:02:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:02:12,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:02:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:02:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:02:12,978 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-25 18:02:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:13,006 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-11-25 18:02:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:02:13,006 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-25 18:02:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:13,007 INFO L225 Difference]: With dead ends: 34 [2022-11-25 18:02:13,007 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 18:02:13,008 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-25 18:02:13,009 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-25 18:02:13,009 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-25 18:02:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 18:02:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-25 18:02:13,024 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-25 18:02:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-11-25 18:02:13,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2022-11-25 18:02:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:13,025 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-11-25 18:02:13,025 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-25 18:02:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-11-25 18:02:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:02:13,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:13,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:02:13,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:02:13,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:13,027 INFO L85 PathProgramCache]: Analyzing trace with hash -782496211, now seen corresponding path program 1 times [2022-11-25 18:02:13,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:13,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039444934] [2022-11-25 18:02:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:13,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:13,442 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-25 18:02:13,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:13,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039444934] [2022-11-25 18:02:13,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039444934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:02:13,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:02:13,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:02:13,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957492710] [2022-11-25 18:02:13,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:02:13,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:02:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:02:13,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:02:13,447 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-25 18:02:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:13,834 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-11-25 18:02:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:02:13,834 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-25 18:02:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:13,835 INFO L225 Difference]: With dead ends: 76 [2022-11-25 18:02:13,835 INFO L226 Difference]: Without dead ends: 74 [2022-11-25 18:02:13,836 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-25 18:02:13,836 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 109 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 108 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:13,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 108 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:02:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-25 18:02:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 35. [2022-11-25 18:02:13,847 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-25 18:02:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-11-25 18:02:13,850 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 19 [2022-11-25 18:02:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:13,851 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-11-25 18:02:13,851 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-25 18:02:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-11-25 18:02:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:02:13,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:13,853 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-25 18:02:13,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:02:13,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash 830966801, now seen corresponding path program 1 times [2022-11-25 18:02:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:13,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651688708] [2022-11-25 18:02:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:14,167 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-25 18:02:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651688708] [2022-11-25 18:02:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651688708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:02:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490771433] [2022-11-25 18:02:14,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:14,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:14,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:02:14,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:02:14,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:02:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:14,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 18:02:14,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:02:14,409 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-25 18:02:14,431 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-25 18:02:14,608 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-25 18:02:14,612 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-25 18:02:14,621 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-25 18:02:14,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:14,718 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-25 18:02:14,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490771433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:02:14,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:02:14,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-11-25 18:02:14,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880187928] [2022-11-25 18:02:14,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:02:14,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:02:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:02:14,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:02:14,725 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-25 18:02:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:14,863 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-11-25 18:02:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:02:14,864 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-25 18:02:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:14,865 INFO L225 Difference]: With dead ends: 68 [2022-11-25 18:02:14,865 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 18:02:14,866 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-25 18:02:14,867 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-25 18:02:14,867 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-25 18:02:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 18:02:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-25 18:02:14,874 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-25 18:02:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-11-25 18:02:14,875 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 25 [2022-11-25 18:02:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:14,875 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-11-25 18:02:14,875 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-25 18:02:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-11-25 18:02:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:02:14,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:14,876 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-25 18:02:14,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:02:15,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 18:02:15,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:15,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1524144039, now seen corresponding path program 2 times [2022-11-25 18:02:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:15,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558193150] [2022-11-25 18:02:15,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:15,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:15,785 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-25 18:02:15,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:15,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558193150] [2022-11-25 18:02:15,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558193150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:02:15,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543864394] [2022-11-25 18:02:15,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:02:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:15,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:02:15,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:02:15,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:02:15,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:02:15,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:02:15,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-25 18:02:15,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:02:15,933 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-25 18:02:15,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:15,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:15,943 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-25 18:02:16,058 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-25 18:02:16,066 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-25 18:02:16,078 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:02:16,078 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-25 18:02:16,088 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-25 18:02:16,344 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-25 18:02:16,349 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-25 18:02:16,467 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-25 18:02:16,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:16,863 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-25 18:02:16,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543864394] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:02:16,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:02:16,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 23 [2022-11-25 18:02:16,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803135900] [2022-11-25 18:02:16,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:02:16,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 18:02:16,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:16,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 18:02:16,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:02:16,866 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-25 18:02:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:20,746 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2022-11-25 18:02:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-25 18:02:20,747 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-25 18:02:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:20,748 INFO L225 Difference]: With dead ends: 136 [2022-11-25 18:02:20,748 INFO L226 Difference]: Without dead ends: 121 [2022-11-25 18:02:20,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=883, Invalid=2309, Unknown=0, NotChecked=0, Total=3192 [2022-11-25 18:02:20,750 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 606 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:20,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 297 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:02:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-25 18:02:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 48. [2022-11-25 18:02:20,769 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-25 18:02:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2022-11-25 18:02:20,770 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 30 [2022-11-25 18:02:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:20,771 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2022-11-25 18:02:20,771 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-25 18:02:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-11-25 18:02:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 18:02:20,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:20,772 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-25 18:02:20,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:02:20,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 18:02:20,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1895186671, now seen corresponding path program 1 times [2022-11-25 18:02:20,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:20,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361915156] [2022-11-25 18:02:20,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:21,713 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-25 18:02:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:21,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361915156] [2022-11-25 18:02:21,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361915156] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:02:21,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506563464] [2022-11-25 18:02:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:21,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:02:21,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:02:21,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:02:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:21,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-25 18:02:21,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:02:21,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:21,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:21,870 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-25 18:02:21,877 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-25 18:02:21,958 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-25 18:02:21,966 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-25 18:02:21,974 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:02:21,974 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-25 18:02:21,990 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-25 18:02:22,206 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-25 18:02:22,211 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-25 18:02:22,342 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-25 18:02:22,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:22,566 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-25 18:02:22,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506563464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:02:22,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:02:22,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 18 [2022-11-25 18:02:22,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65671694] [2022-11-25 18:02:22,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:02:22,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 18:02:22,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:22,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 18:02:22,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=255, Unknown=1, NotChecked=0, Total=306 [2022-11-25 18:02:22,569 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-25 18:02:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:23,833 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-11-25 18:02:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 18:02:23,833 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-25 18:02:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:23,834 INFO L225 Difference]: With dead ends: 67 [2022-11-25 18:02:23,834 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 18:02:23,835 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-25 18:02:23,836 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 221 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:23,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 221 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:02:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 18:02:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2022-11-25 18:02:23,844 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-25 18:02:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-11-25 18:02:23,845 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 32 [2022-11-25 18:02:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:23,845 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-11-25 18:02:23,845 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-25 18:02:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-11-25 18:02:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 18:02:23,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:23,846 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-25 18:02:23,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:02:24,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:24,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1135420755, now seen corresponding path program 3 times [2022-11-25 18:02:24,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:24,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732355594] [2022-11-25 18:02:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:24,680 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-25 18:02:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:24,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732355594] [2022-11-25 18:02:24,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732355594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:02:24,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038580354] [2022-11-25 18:02:24,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:02:24,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:02:24,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:02:24,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:02:24,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:02:24,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:02:24,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-25 18:02:24,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:02:24,856 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-25 18:02:24,863 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-25 18:02:24,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:02:24,945 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-25 18:02:24,951 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-25 18:02:24,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:24,964 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-25 18:02:24,976 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:02:24,976 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-25 18:02:24,982 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-25 18:02:25,360 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-25 18:02:25,361 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-25 18:02:25,375 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:02:25,376 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-25 18:02:25,380 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-25 18:02:25,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:25,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:25,488 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-25 18:02:25,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:25,494 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-25 18:02:25,513 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-25 18:02:25,526 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-25 18:02:25,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:25,705 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-25 18:02:25,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:02:25,711 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-25 18:02:25,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:25,725 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-25 18:02:25,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:02:25,730 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-25 18:02:25,747 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-25 18:02:25,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038580354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:02:25,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:02:25,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2022-11-25 18:02:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544821396] [2022-11-25 18:02:25,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:02:25,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 18:02:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:25,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 18:02:25,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:02:25,750 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-25 18:02:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:26,174 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-11-25 18:02:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:02:26,174 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-25 18:02:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:26,175 INFO L225 Difference]: With dead ends: 102 [2022-11-25 18:02:26,175 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 18:02:26,176 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-25 18:02:26,176 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:26,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 321 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:02:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 18:02:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-25 18:02:26,185 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-25 18:02:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-11-25 18:02:26,186 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 38 [2022-11-25 18:02:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:26,186 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-11-25 18:02:26,187 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-25 18:02:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-11-25 18:02:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 18:02:26,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:26,188 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-25 18:02:26,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 18:02:26,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:26,394 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1704598909, now seen corresponding path program 4 times [2022-11-25 18:02:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:26,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712854867] [2022-11-25 18:02:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:27,550 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-25 18:02:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:27,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712854867] [2022-11-25 18:02:27,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712854867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:02:27,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388917753] [2022-11-25 18:02:27,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:02:27,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:02:27,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:02:27,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:02:27,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:02:27,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:02:27,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-25 18:02:27,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:02:27,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:27,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:27,725 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-25 18:02:27,735 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-25 18:02:27,816 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-25 18:02:27,823 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-25 18:02:27,837 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:02:27,838 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-25 18:02:27,865 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:02:27,866 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-25 18:02:28,015 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-25 18:02:28,023 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-25 18:02:28,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:28,041 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-25 18:02:28,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:28,052 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-25 18:02:28,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:28,065 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-11-25 18:02:28,065 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-25 18:02:28,072 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-25 18:02:28,870 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-11-25 18:02:28,870 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-25 18:02:28,949 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-11-25 18:02:28,949 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-25 18:02:30,414 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-25 18:02:30,415 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-25 18:02:30,421 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-25 18:02:30,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:30,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:30,757 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-25 18:02:30,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:30,764 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-25 18:02:30,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:30,956 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-25 18:02:30,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:02:30,967 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-25 18:02:30,973 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-25 18:02:30,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:30,997 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-25 18:02:31,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:02:31,004 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-25 18:02:31,185 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 18:02:31,186 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-25 18:02:31,187 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-25 18:02:31,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388917753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:02:31,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:02:31,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 29 [2022-11-25 18:02:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642763441] [2022-11-25 18:02:31,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:02:31,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:02:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:02:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:02:31,194 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-25 18:02:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:40,661 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2022-11-25 18:02:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-25 18:02:40,661 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-25 18:02:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:40,662 INFO L225 Difference]: With dead ends: 169 [2022-11-25 18:02:40,662 INFO L226 Difference]: Without dead ends: 154 [2022-11-25 18:02:40,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1518, Invalid=4334, Unknown=0, NotChecked=0, Total=5852 [2022-11-25 18:02:40,665 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 913 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:40,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 517 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:02:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-25 18:02:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 64. [2022-11-25 18:02:40,676 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-25 18:02:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-11-25 18:02:40,677 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 43 [2022-11-25 18:02:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:40,677 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-11-25 18:02:40,678 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-25 18:02:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-11-25 18:02:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 18:02:40,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:40,679 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-25 18:02:40,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 18:02:40,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 18:02:40,885 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash -781342395, now seen corresponding path program 2 times [2022-11-25 18:02:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:40,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197427607] [2022-11-25 18:02:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:42,308 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-25 18:02:42,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:42,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197427607] [2022-11-25 18:02:42,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197427607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:02:42,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077565179] [2022-11-25 18:02:42,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:02:42,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:42,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:02:42,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:02:42,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:02:42,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:02:42,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:02:42,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-25 18:02:42,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:02:42,477 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-25 18:02:42,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:42,487 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-25 18:02:42,550 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-25 18:02:42,563 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:02:42,563 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-25 18:02:42,589 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:02:42,590 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-25 18:02:42,601 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-25 18:02:42,736 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-25 18:02:42,743 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-25 18:02:42,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:42,750 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-25 18:02:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:42,757 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-25 18:02:42,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:42,768 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-11-25 18:02:42,769 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-25 18:02:42,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:42,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 18 treesize of output 20 [2022-11-25 18:02:43,600 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-11-25 18:02:43,600 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-25 18:02:43,684 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-11-25 18:02:43,684 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-25 18:02:45,080 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-25 18:02:45,081 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-25 18:02:45,089 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-25 18:02:45,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:45,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:45,304 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-25 18:02:45,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:45,312 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-25 18:02:45,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:45,479 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-25 18:02:45,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:02:45,486 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-25 18:02:45,490 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-25 18:02:45,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:45,497 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-25 18:02:45,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:02:45,503 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-25 18:02:45,654 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 18:02:45,654 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-25 18:02:45,656 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-25 18:02:45,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077565179] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:02:45,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:02:45,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 25 [2022-11-25 18:02:45,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069154726] [2022-11-25 18:02:45,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:02:45,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 18:02:45,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:02:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 18:02:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=524, Unknown=5, NotChecked=0, Total=600 [2022-11-25 18:02:45,658 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-25 18:02:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:54,708 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2022-11-25 18:02:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:02:54,708 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-25 18:02:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:54,709 INFO L225 Difference]: With dead ends: 160 [2022-11-25 18:02:54,709 INFO L226 Difference]: Without dead ends: 158 [2022-11-25 18:02:54,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1573, Invalid=4742, Unknown=5, NotChecked=0, Total=6320 [2022-11-25 18:02:54,712 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 725 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:54,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 462 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 18:02:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-25 18:02:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 67. [2022-11-25 18:02:54,727 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-25 18:02:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-11-25 18:02:54,727 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 45 [2022-11-25 18:02:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:54,728 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-11-25 18:02:54,728 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-25 18:02:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-11-25 18:02:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:02:54,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:54,729 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-25 18:02:54,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:02:54,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:02:54,935 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2085516585, now seen corresponding path program 5 times [2022-11-25 18:02:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:02:54,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067130912] [2022-11-25 18:02:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:02:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:02:56,077 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-25 18:02:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:02:56,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067130912] [2022-11-25 18:02:56,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067130912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:02:56,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491602002] [2022-11-25 18:02:56,078 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:02:56,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:02:56,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:02:56,080 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:02:56,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:02:56,599 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-25 18:02:56,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:02:56,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-25 18:02:56,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:02:56,631 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-25 18:02:56,635 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-25 18:02:56,639 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-25 18:02:56,706 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-25 18:02:56,711 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-25 18:02:56,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:56,717 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-25 18:02:56,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:56,725 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-25 18:02:56,746 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:02:56,746 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-25 18:02:56,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:56,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:56,760 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-25 18:02:56,872 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-25 18:02:56,878 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-25 18:02:56,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:56,893 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:02:56,893 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-25 18:02:56,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:56,927 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:02:56,927 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-25 18:02:56,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:02:56,953 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-11-25 18:02:56,954 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-25 18:02:56,963 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-25 18:02:58,008 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-11-25 18:02:58,008 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-25 18:02:58,024 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-25 18:02:58,024 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-25 18:02:58,069 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-25 18:02:58,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:58,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:58,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 141 treesize of output 129 [2022-11-25 18:02:58,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:58,807 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-25 18:02:59,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:59,503 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-25 18:02:59,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:59,517 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-25 18:02:59,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:59,540 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-25 18:02:59,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:59,600 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-25 18:02:59,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:59,625 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-25 18:02:59,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:02:59,658 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-25 18:03:07,247 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-25 18:03:15,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:15,170 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-25 18:03:15,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:15,181 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-25 18:03:15,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:15,260 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2022-11-25 18:03:15,261 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-25 18:03:15,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,289 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-25 18:03:15,321 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-25 18:03:15,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:15,358 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-25 18:03:15,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:15,393 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-25 18:03:15,426 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-25 18:03:15,450 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-25 18:03:15,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,477 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:03:15,477 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-25 18:03:15,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:15,679 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-25 18:03:15,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:15,692 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-25 18:03:15,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:15,745 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2022-11-25 18:03:15,746 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-25 18:03:15,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:15,771 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-25 18:03:15,799 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-25 18:03:15,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:15,823 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-25 18:03:15,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:15,848 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-25 18:03:15,871 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:03:15,872 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-25 18:03:15,903 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-25 18:03:15,917 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-25 18:03:16,336 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,336 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-25 18:03:16,349 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,350 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-25 18:03:16,362 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,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 397 treesize of output 1 [2022-11-25 18:03:16,376 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,376 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-25 18:03:16,388 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,389 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-25 18:03:16,401 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,401 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-25 18:03:16,412 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,413 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-25 18:03:16,422 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,423 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-25 18:03:16,431 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,432 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-25 18:03:16,442 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,442 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-25 18:03:16,452 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,453 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-25 18:03:16,463 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,463 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-25 18:03:16,473 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,474 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-25 18:03:16,485 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,486 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-25 18:03:16,496 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,496 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-25 18:03:16,506 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,506 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-25 18:03:16,518 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,519 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-25 18:03:16,530 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,531 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-25 18:03:16,541 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,542 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-25 18:03:16,551 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,551 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-25 18:03:16,562 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,563 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-25 18:03:16,574 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,574 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-25 18:03:16,585 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,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 159 treesize of output 1 [2022-11-25 18:03:16,597 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,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 240 treesize of output 1 [2022-11-25 18:03:16,610 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,610 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-25 18:03:16,620 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,621 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-25 18:03:16,631 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,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 316 treesize of output 1 [2022-11-25 18:03:16,642 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,643 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-25 18:03:16,652 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,653 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-25 18:03:16,664 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,664 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-25 18:03:16,674 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,675 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-25 18:03:16,685 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,685 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-25 18:03:16,698 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:03:16,699 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-25 18:03:16,727 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-25 18:03:16,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491602002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:03:16,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:03:16,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 36 [2022-11-25 18:03:16,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469195899] [2022-11-25 18:03:16,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:03:16,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 18:03:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:03:16,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 18:03:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1067, Unknown=1, NotChecked=66, Total=1260 [2022-11-25 18:03:16,730 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-25 18:03:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:22,697 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2022-11-25 18:03:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 18:03:22,698 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-25 18:03:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:22,699 INFO L225 Difference]: With dead ends: 200 [2022-11-25 18:03:22,699 INFO L226 Difference]: Without dead ends: 129 [2022-11-25 18:03:22,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=523, Invalid=4172, Unknown=1, NotChecked=134, Total=4830 [2022-11-25 18:03:22,701 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 124 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:22,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1212 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 934 Invalid, 0 Unknown, 90 Unchecked, 1.9s Time] [2022-11-25 18:03:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-25 18:03:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2022-11-25 18:03:22,730 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-25 18:03:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-11-25 18:03:22,732 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 51 [2022-11-25 18:03:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:22,733 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-11-25 18:03:22,733 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-25 18:03:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-11-25 18:03:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:03:22,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:22,741 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-25 18:03:22,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:03:22,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:03:22,948 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:03:22,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1013477057, now seen corresponding path program 6 times [2022-11-25 18:03:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:03:22,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664766420] [2022-11-25 18:03:22,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:03:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:26,907 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-25 18:03:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:03:26,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664766420] [2022-11-25 18:03:26,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664766420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:03:26,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061961583] [2022-11-25 18:03:26,908 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 18:03:26,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:03:26,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:03:26,911 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:03:26,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:03:27,450 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-25 18:03:27,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:03:27,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-25 18:03:27,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:27,470 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-25 18:03:27,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:27,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:27,481 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-25 18:03:27,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-25 18:03:27,626 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:03:27,627 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-25 18:03:27,640 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-25 18:03:27,652 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-25 18:03:27,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-25 18:03:27,898 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-25 18:03:27,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:27,908 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-25 18:03:27,936 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:03:27,937 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-25 18:03:27,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:27,986 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-25 18:03:27,986 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-25 18:03:28,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:28,022 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-25 18:03:28,272 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-25 18:03:28,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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-25 18:03:28,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:28,302 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:03:28,303 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-25 18:03:28,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:28,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:28,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:28,314 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-25 18:03:28,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:28,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:28,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:28,340 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-25 18:03:28,340 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-25 18:03:28,349 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-25 18:03:30,966 INFO L321 Elim1Store]: treesize reduction 236, result has 45.0 percent of original size [2022-11-25 18:03:30,967 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-25 18:03:31,407 INFO L321 Elim1Store]: treesize reduction 224, result has 38.6 percent of original size [2022-11-25 18:03:31,407 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-25 18:03:39,926 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-25 18:03:39,926 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-25 18:03:39,934 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-25 18:03:39,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:03:40,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:40,716 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-25 18:03:40,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:40,725 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-25 18:03:40,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:40,986 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-25 18:03:40,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:40,998 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-25 18:03:41,036 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-25 18:03:41,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:41,227 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-25 18:03:41,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:41,250 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-25 18:03:41,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:41,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:41,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:41,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:41,264 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-25 18:03:41,272 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-25 18:03:41,279 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-25 18:03:41,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:41,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:41,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:41,288 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-25 18:03:41,585 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-25 18:03:41,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061961583] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:03:41,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:03:41,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 39 [2022-11-25 18:03:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200715825] [2022-11-25 18:03:41,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:03:41,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 18:03:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:03:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 18:03:41,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1302, Unknown=3, NotChecked=72, Total=1482 [2022-11-25 18:03:41,589 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-25 18:04:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:25,101 INFO L93 Difference]: Finished difference Result 351 states and 426 transitions. [2022-11-25 18:04:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-11-25 18:04:25,102 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-25 18:04:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:25,103 INFO L225 Difference]: With dead ends: 351 [2022-11-25 18:04:25,103 INFO L226 Difference]: Without dead ends: 311 [2022-11-25 18:04:25,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5121 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=3925, Invalid=13898, Unknown=3, NotChecked=264, Total=18090 [2022-11-25 18:04:25,108 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2559 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:25,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 804 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 691 Invalid, 0 Unknown, 133 Unchecked, 2.0s Time] [2022-11-25 18:04:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-25 18:04:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 95. [2022-11-25 18:04:25,127 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-25 18:04:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-11-25 18:04:25,128 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 56 [2022-11-25 18:04:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:25,128 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-11-25 18:04:25,128 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-25 18:04:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-11-25 18:04:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 18:04:25,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:25,130 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-25 18:04:25,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:04:25,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 18:04:25,347 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:04:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1512229753, now seen corresponding path program 3 times [2022-11-25 18:04:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:04:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965582629] [2022-11-25 18:04:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:04:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:27,755 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-25 18:04:27,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:27,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965582629] [2022-11-25 18:04:27,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965582629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:04:27,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428922500] [2022-11-25 18:04:27,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:04:27,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:04:27,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:04:27,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:04:27,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:04:28,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 18:04:28,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:04:28,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-25 18:04:28,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:28,512 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-25 18:04:28,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:28,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:28,526 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-25 18:04:28,610 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-25 18:04:28,640 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:04:28,640 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-25 18:04:28,653 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-25 18:04:28,668 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-25 18:04:28,862 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-25 18:04:28,870 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-25 18:04:28,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:28,879 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-25 18:04:28,905 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:04:28,906 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-25 18:04:28,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:28,955 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-25 18:04:28,955 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-25 18:04:28,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:28,977 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-25 18:04:29,269 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-25 18:04:29,278 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-25 18:04:29,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:29,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:29,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:29,295 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-25 18:04:29,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:29,320 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:04:29,320 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-25 18:04:29,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:29,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:29,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:29,342 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-25 18:04:29,343 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-25 18:04:29,355 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-25 18:04:32,043 INFO L321 Elim1Store]: treesize reduction 252, result has 41.3 percent of original size [2022-11-25 18:04:32,043 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-25 18:04:32,549 INFO L321 Elim1Store]: treesize reduction 196, result has 46.3 percent of original size [2022-11-25 18:04:32,550 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-25 18:04:40,261 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-25 18:04:40,261 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-25 18:04:40,269 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-25 18:04:40,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:04:40,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:40,792 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-25 18:04:40,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:40,800 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-25 18:04:41,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:41,037 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-25 18:04:41,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:41,047 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-25 18:04:41,087 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-25 18:04:41,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:41,270 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-25 18:04:41,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:41,283 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-25 18:04:41,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:41,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:41,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:41,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:04:41,296 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-25 18:04:41,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:04:41,308 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-25 18:04:41,319 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-25 18:04:41,330 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-25 18:04:41,860 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-25 18:04:41,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428922500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:04:41,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:04:41,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 32 [2022-11-25 18:04:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149189351] [2022-11-25 18:04:41,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:04:41,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 18:04:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 18:04:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=836, Unknown=8, NotChecked=58, Total=992 [2022-11-25 18:04:41,863 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-25 18:05:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:08,152 INFO L93 Difference]: Finished difference Result 251 states and 302 transitions. [2022-11-25 18:05:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-25 18:05:08,152 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-25 18:05:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:08,154 INFO L225 Difference]: With dead ends: 251 [2022-11-25 18:05:08,154 INFO L226 Difference]: Without dead ends: 249 [2022-11-25 18:05:08,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3033 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=2464, Invalid=8244, Unknown=8, NotChecked=204, Total=10920 [2022-11-25 18:05:08,157 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1206 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:08,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 579 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 619 Invalid, 0 Unknown, 117 Unchecked, 1.7s Time] [2022-11-25 18:05:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-25 18:05:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 106. [2022-11-25 18:05:08,191 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-25 18:05:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2022-11-25 18:05:08,191 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 58 [2022-11-25 18:05:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:08,192 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2022-11-25 18:05:08,192 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-25 18:05:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2022-11-25 18:05:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 18:05:08,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:08,193 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-25 18:05:08,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:05:08,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 18:05:08,395 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:05:08,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:08,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1492842773, now seen corresponding path program 7 times [2022-11-25 18:05:08,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:08,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117456557] [2022-11-25 18:05:08,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:10,327 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-25 18:05:10,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:10,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117456557] [2022-11-25 18:05:10,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117456557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:10,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096675030] [2022-11-25 18:05:10,328 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 18:05:10,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:10,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:10,331 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:10,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:05:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:10,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-25 18:05:10,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:10,607 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-25 18:05:10,613 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-25 18:05:10,620 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-25 18:05:10,734 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-25 18:05:10,740 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-25 18:05:10,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:10,748 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-25 18:05:10,773 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:05:10,773 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-25 18:05:10,817 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:05:10,817 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-25 18:05:11,012 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-25 18:05:11,022 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-25 18:05:11,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,044 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:05:11,044 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-25 18:05:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,074 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:05:11,074 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-25 18:05:11,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,124 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-25 18:05:11,125 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-25 18:05:11,397 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-25 18:05:11,405 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-25 18:05:11,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,443 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-11-25 18:05:11,443 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-25 18:05:11,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,478 INFO L321 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2022-11-25 18:05:11,478 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-25 18:05:11,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:11,527 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-25 18:05:11,527 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-25 18:05:13,454 INFO L321 Elim1Store]: treesize reduction 194, result has 10.2 percent of original size [2022-11-25 18:05:13,454 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-25 18:05:13,503 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-11-25 18:05:13,503 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-25 18:05:13,510 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-25 18:05:13,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:05:13,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:13,776 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-25 18:05:13,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:13,784 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-25 18:05:14,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:14,160 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-25 18:05:14,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:14,173 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-25 18:05:14,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:14,888 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-25 18:05:14,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:14,903 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-25 18:05:15,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:15,833 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-25 18:05:15,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:15,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:15,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:15,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:15,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:15,929 INFO L321 Elim1Store]: treesize reduction 769, result has 2.7 percent of original size [2022-11-25 18:05:15,930 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-25 18:05:15,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:15,994 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-25 18:05:16,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,030 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-25 18:05:16,064 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-25 18:05:16,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,106 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 18:05:16,106 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-25 18:05:16,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,194 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:05:16,194 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-25 18:05:16,259 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-25 18:05:16,270 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-25 18:05:16,304 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:05:16,305 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-25 18:05:16,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,341 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 18:05:16,341 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-25 18:05:16,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:16,364 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-25 18:05:16,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,381 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-25 18:05:16,381 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-25 18:05:16,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:16,402 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-25 18:05:16,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:05:16,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,430 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-25 18:05:16,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,482 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-25 18:05:16,503 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-25 18:05:16,540 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-25 18:05:16,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,567 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-25 18:05:16,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:16,588 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-25 18:05:16,632 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 18:05:16,633 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-25 18:05:16,727 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-25 18:05:16,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096675030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:05:16,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:05:16,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2022-11-25 18:05:16,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202672650] [2022-11-25 18:05:16,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:16,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:05:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:16,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:05:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:05:16,730 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-25 18:05:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:05:19,696 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2022-11-25 18:05:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:05:19,697 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-25 18:05:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:05:19,698 INFO L225 Difference]: With dead ends: 213 [2022-11-25 18:05:19,698 INFO L226 Difference]: Without dead ends: 121 [2022-11-25 18:05:19,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:05:19,700 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 117 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:05:19,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1197 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 18:05:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-25 18:05:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2022-11-25 18:05:19,725 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-25 18:05:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2022-11-25 18:05:19,726 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 64 [2022-11-25 18:05:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:05:19,726 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2022-11-25 18:05:19,726 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-25 18:05:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2022-11-25 18:05:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:05:19,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:05:19,727 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-25 18:05:19,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:05:19,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:19,930 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:05:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -377962859, now seen corresponding path program 8 times [2022-11-25 18:05:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:19,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755459718] [2022-11-25 18:05:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:22,766 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-25 18:05:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:22,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755459718] [2022-11-25 18:05:22,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755459718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:05:22,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592437969] [2022-11-25 18:05:22,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:05:22,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:05:22,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:22,768 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:05:22,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:05:22,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:05:22,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:05:23,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-25 18:05:23,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:05:23,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,019 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-25 18:05:23,032 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-25 18:05:23,160 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-25 18:05:23,169 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-25 18:05:23,190 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:05:23,191 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-25 18:05:23,235 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:05:23,235 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-25 18:05:23,454 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-25 18:05:23,463 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-25 18:05:23,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,472 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-25 18:05:23,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,480 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-25 18:05:23,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,521 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-25 18:05:23,521 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-25 18:05:23,541 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-25 18:05:23,848 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-25 18:05:23,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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-25 18:05:23,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,884 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:05:23,884 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-25 18:05:23,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,926 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2022-11-25 18:05:23,927 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-25 18:05:23,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:23,956 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-25 18:05:23,985 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-25 18:05:24,423 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-25 18:05:24,434 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-25 18:05:24,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,481 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-11-25 18:05:24,481 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-25 18:05:24,521 INFO L321 Elim1Store]: treesize reduction 43, result has 48.8 percent of original size [2022-11-25 18:05:24,521 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-25 18:05:24,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,557 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-25 18:05:24,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:05:24,612 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-11-25 18:05:24,612 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-25 18:05:30,030 INFO L321 Elim1Store]: treesize reduction 416, result has 54.4 percent of original size [2022-11-25 18:05:30,030 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-25 18:05:31,514 INFO L321 Elim1Store]: treesize reduction 376, result has 54.0 percent of original size [2022-11-25 18:05:31,515 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-25 18:10:21,273 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-11-25 18:10:21,273 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-25 18:10:21,283 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-25 18:10:21,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:10:22,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:22,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 271 [2022-11-25 18:10:22,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:22,288 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-25 18:10:22,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_109 (Array Int Int)) (v_arrayElimArr_110 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_64| Int) (v_ArrVal_1490 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_110)) (.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_109))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse7 (select (select .cse2 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse3 (select (select .cse5 .cse6) .cse7)) (.cse4 (select (select .cse2 .cse6) .cse7))) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_64| v_ArrVal_1490) (select (select .cse5 .cse3) .cse4))) (.cse1 (select (select .cse2 .cse3) .cse4))) (or (not (= (select .cse0 (+ .cse1 4)) 1)) (not (= (select v_arrayElimArr_109 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select .cse0 (+ .cse1 8)) 3)) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_110 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_64|) 0)))))))) is different from false [2022-11-25 18:10:22,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:22,481 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-25 18:10:22,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:22,504 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-25 18:10:22,552 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-25 18:10:22,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:22,749 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-25 18:10:22,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:22,760 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-25 18:10:22,816 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-25 18:10:23,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:23,077 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-25 18:10:23,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:23,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 793 treesize of output 609 [2022-11-25 18:10:23,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,118 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-25 18:10:23,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:23,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:10:23,208 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-25 18:10:23,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,566 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-25 18:10:23,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:23,741 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-25 18:10:24,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:24,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:24,333 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-25 18:10:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-11-25 18:10:26,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592437969] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:10:26,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:10:26,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 41 [2022-11-25 18:10:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053408142] [2022-11-25 18:10:26,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:10:26,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 18:10:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:26,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 18:10:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1311, Unknown=3, NotChecked=222, Total=1640 [2022-11-25 18:10:26,265 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-25 18:11:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:14,328 INFO L93 Difference]: Finished difference Result 312 states and 381 transitions. [2022-11-25 18:11:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-25 18:11:14,328 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-25 18:11:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:14,329 INFO L225 Difference]: With dead ends: 312 [2022-11-25 18:11:14,329 INFO L226 Difference]: Without dead ends: 272 [2022-11-25 18:11:14,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 123 SyntacticMatches, 8 SemanticMatches, 115 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2944 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=2989, Invalid=9902, Unknown=3, NotChecked=678, Total=13572 [2022-11-25 18:11:14,336 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2029 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:14,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 1138 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 852 Invalid, 0 Unknown, 401 Unchecked, 3.3s Time] [2022-11-25 18:11:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-25 18:11:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 111. [2022-11-25 18:11:14,361 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-25 18:11:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2022-11-25 18:11:14,362 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 69 [2022-11-25 18:11:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:14,362 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2022-11-25 18:11:14,363 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-25 18:11:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2022-11-25 18:11:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 18:11:14,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:14,363 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-25 18:11:14,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:14,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:14,564 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash -668441507, now seen corresponding path program 4 times [2022-11-25 18:11:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:14,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382493558] [2022-11-25 18:11:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:19,912 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-25 18:11:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:19,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382493558] [2022-11-25 18:11:19,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382493558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:19,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852161199] [2022-11-25 18:11:19,913 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:11:19,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:19,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:19,915 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:19,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09608545-a801-4315-b567-127ed5e4d6ec/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:11:20,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:11:20,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:11:20,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-25 18:11:20,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:20,193 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-25 18:11:20,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:20,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:20,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-25 18:11:20,279 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-25 18:11:20,290 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-25 18:11:20,314 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:11:20,314 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-25 18:11:20,357 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:11:20,358 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-25 18:11:20,600 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-25 18:11:20,609 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-25 18:11:20,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:20,624 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-25 18:11:20,664 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:11:20,664 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-25 18:11:20,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:20,713 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-11-25 18:11:20,713 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-25 18:11:20,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:20,737 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-25 18:11:21,004 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-25 18:11:21,013 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-25 18:11:21,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,034 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:11:21,035 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-25 18:11:21,057 INFO L321 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2022-11-25 18:11:21,057 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-25 18:11:21,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,120 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2022-11-25 18:11:21,120 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-25 18:11:21,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,147 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-25 18:11:21,478 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-25 18:11:21,486 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-25 18:11:21,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,524 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-11-25 18:11:21,524 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-25 18:11:21,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,539 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-25 18:11:21,577 INFO L321 Elim1Store]: treesize reduction 43, result has 48.8 percent of original size [2022-11-25 18:11:21,577 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-25 18:11:21,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:21,617 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-11-25 18:11:21,617 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-25 18:11:26,795 INFO L321 Elim1Store]: treesize reduction 424, result has 53.6 percent of original size [2022-11-25 18:11:26,796 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-25 18:11:28,229 INFO L321 Elim1Store]: treesize reduction 384, result has 53.0 percent of original size [2022-11-25 18:11:28,230 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