./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:47:05,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:47:05,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:47:05,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:47:05,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:47:05,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:47:05,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:47:05,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:47:05,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:47:05,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:47:05,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:47:05,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:47:05,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:47:05,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:47:05,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:47:05,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:47:05,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:47:05,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:47:05,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:47:05,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:47:05,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:47:05,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:47:05,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:47:05,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:47:05,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:47:05,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:47:05,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:47:05,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:47:05,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:47:05,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:47:05,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:47:05,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:47:05,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:47:05,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:47:05,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:47:05,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:47:05,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:47:05,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:47:05,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:47:05,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:47:05,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:47:05,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 13:47:05,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:47:05,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:47:05,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:47:05,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:47:05,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:47:05,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:47:05,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:47:05,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:47:05,871 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:47:05,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:47:05,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:47:05,871 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:47:05,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:47:05,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:47:05,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:47:05,872 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:47:05,872 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:47:05,873 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:47:05,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:47:05,873 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:47:05,873 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:47:05,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:47:05,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:47:05,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:47:05,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:47:05,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:47:05,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:47:05,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:47:05,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:47:05,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:47:05,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2022-11-21 13:47:06,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:47:06,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:47:06,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:47:06,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:47:06,172 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:47:06,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-11-21 13:47:09,225 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:47:09,458 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:47:09,459 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-11-21 13:47:09,473 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/data/a8a330bdd/a5d7c130b22d459981794a7998509737/FLAGc5027c91b [2022-11-21 13:47:09,489 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/data/a8a330bdd/a5d7c130b22d459981794a7998509737 [2022-11-21 13:47:09,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:47:09,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:47:09,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:47:09,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:47:09,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:47:09,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:47:09" (1/1) ... [2022-11-21 13:47:09,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7561f75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:09, skipping insertion in model container [2022-11-21 13:47:09,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:47:09" (1/1) ... [2022-11-21 13:47:09,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:47:09,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:47:09,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:47:09,907 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:47:09,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:47:10,006 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:47:10,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10 WrapperNode [2022-11-21 13:47:10,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:47:10,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:47:10,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:47:10,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:47:10,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,088 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2022-11-21 13:47:10,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:47:10,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:47:10,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:47:10,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:47:10,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,142 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:47:10,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:47:10,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:47:10,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:47:10,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (1/1) ... [2022-11-21 13:47:10,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:47:10,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:10,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:47:10,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:47:10,240 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-21 13:47:10,241 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-21 13:47:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:47:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:47:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:47:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:47:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:47:10,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:47:10,354 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:47:10,356 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:47:10,419 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-21 13:47:10,817 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:47:10,825 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:47:10,826 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 13:47:10,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:47:10 BoogieIcfgContainer [2022-11-21 13:47:10,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:47:10,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:47:10,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:47:10,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:47:10,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:47:09" (1/3) ... [2022-11-21 13:47:10,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20199daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:47:10, skipping insertion in model container [2022-11-21 13:47:10,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:47:10" (2/3) ... [2022-11-21 13:47:10,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20199daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:47:10, skipping insertion in model container [2022-11-21 13:47:10,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:47:10" (3/3) ... [2022-11-21 13:47:10,841 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2022-11-21 13:47:10,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:47:10,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-21 13:47:10,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:47:10,917 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3e1a5e85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:47:10,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-11-21 13:47:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:47:10,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:10,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:47:10,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:10,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-11-21 13:47:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:10,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085621187] [2022-11-21 13:47:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:11,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085621187] [2022-11-21 13:47:11,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085621187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:11,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:11,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:47:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923031602] [2022-11-21 13:47:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:47:11,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:47:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:11,309 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:11,496 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2022-11-21 13:47:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:47:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-11-21 13:47:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:11,516 INFO L225 Difference]: With dead ends: 136 [2022-11-21 13:47:11,517 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 13:47:11,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:11,525 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:11,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 13:47:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-21 13:47:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2022-11-21 13:47:11,594 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2022-11-21 13:47:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:11,594 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2022-11-21 13:47:11,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2022-11-21 13:47:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:47:11,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:11,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:47:11,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:47:11,597 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-11-21 13:47:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:11,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925250683] [2022-11-21 13:47:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:11,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:11,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925250683] [2022-11-21 13:47:11,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925250683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:11,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:11,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:47:11,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511984743] [2022-11-21 13:47:11,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:11,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:47:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:11,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:47:11,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:11,722 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:11,777 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-21 13:47:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:47:11,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-11-21 13:47:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:11,783 INFO L225 Difference]: With dead ends: 127 [2022-11-21 13:47:11,783 INFO L226 Difference]: Without dead ends: 127 [2022-11-21 13:47:11,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:11,785 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:11,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:47:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-21 13:47:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-21 13:47:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-21 13:47:11,793 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2022-11-21 13:47:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:11,793 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-21 13:47:11,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-21 13:47:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:47:11,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:11,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:11,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:47:11,803 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:11,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-11-21 13:47:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:11,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185939898] [2022-11-21 13:47:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:11,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:11,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185939898] [2022-11-21 13:47:11,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185939898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:11,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:11,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:47:11,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272215003] [2022-11-21 13:47:11,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:11,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:47:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:11,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:47:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:11,970 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:11,990 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-11-21 13:47:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:47:11,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-21 13:47:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:11,992 INFO L225 Difference]: With dead ends: 136 [2022-11-21 13:47:11,992 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 13:47:11,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:11,994 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:11,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:47:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 13:47:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2022-11-21 13:47:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-11-21 13:47:12,003 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2022-11-21 13:47:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:12,004 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-11-21 13:47:12,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-11-21 13:47:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:47:12,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:12,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:12,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:47:12,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-11-21 13:47:12,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:12,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370059163] [2022-11-21 13:47:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:12,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:12,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370059163] [2022-11-21 13:47:12,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370059163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:12,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:12,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:47:12,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011230133] [2022-11-21 13:47:12,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:12,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:47:12,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:12,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:47:12,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:12,074 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:12,143 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-21 13:47:12,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:47:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-21 13:47:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:12,146 INFO L225 Difference]: With dead ends: 127 [2022-11-21 13:47:12,146 INFO L226 Difference]: Without dead ends: 127 [2022-11-21 13:47:12,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:12,148 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:12,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-21 13:47:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-21 13:47:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-21 13:47:12,157 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2022-11-21 13:47:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:12,157 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-21 13:47:12,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-21 13:47:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:47:12,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:12,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:12,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:47:12,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-11-21 13:47:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:12,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569697337] [2022-11-21 13:47:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:12,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:12,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569697337] [2022-11-21 13:47:12,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569697337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:12,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:12,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:47:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145077521] [2022-11-21 13:47:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:12,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:47:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:12,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:47:12,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:12,266 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:12,302 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2022-11-21 13:47:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:47:12,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-21 13:47:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:12,304 INFO L225 Difference]: With dead ends: 126 [2022-11-21 13:47:12,304 INFO L226 Difference]: Without dead ends: 126 [2022-11-21 13:47:12,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:47:12,305 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:12,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:47:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-21 13:47:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-21 13:47:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-11-21 13:47:12,311 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2022-11-21 13:47:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:12,312 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-11-21 13:47:12,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-11-21 13:47:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:47:12,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:12,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:12,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:47:12,313 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-11-21 13:47:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:12,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433105311] [2022-11-21 13:47:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:12,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433105311] [2022-11-21 13:47:12,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433105311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:12,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:12,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:47:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128191817] [2022-11-21 13:47:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:47:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:47:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:47:12,455 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:12,609 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-11-21 13:47:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:47:12,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 13:47:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:12,610 INFO L225 Difference]: With dead ends: 130 [2022-11-21 13:47:12,611 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 13:47:12,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:47:12,615 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:12,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 217 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 13:47:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-21 13:47:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2022-11-21 13:47:12,627 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2022-11-21 13:47:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:12,627 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2022-11-21 13:47:12,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-11-21 13:47:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:47:12,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:12,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:12,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:47:12,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-11-21 13:47:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:12,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768279102] [2022-11-21 13:47:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:12,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768279102] [2022-11-21 13:47:12,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768279102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:12,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:12,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:47:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584707908] [2022-11-21 13:47:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:12,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:12,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:12,839 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:12,951 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-11-21 13:47:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:47:12,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 13:47:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:12,953 INFO L225 Difference]: With dead ends: 130 [2022-11-21 13:47:12,953 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 13:47:12,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:47:12,954 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 135 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:12,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 263 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 13:47:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-21 13:47:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-11-21 13:47:12,979 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2022-11-21 13:47:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:12,980 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-11-21 13:47:12,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-11-21 13:47:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:47:12,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:12,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:12,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:47:12,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-11-21 13:47:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354371978] [2022-11-21 13:47:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:12,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:13,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354371978] [2022-11-21 13:47:13,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354371978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591582144] [2022-11-21 13:47:13,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:13,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:13,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:13,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:13,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:47:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:13,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:47:13,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:13,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:13,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591582144] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:13,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:13,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-21 13:47:13,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140979305] [2022-11-21 13:47:13,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:13,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:47:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:13,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:47:13,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:47:13,275 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:13,291 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2022-11-21 13:47:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:47:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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) Word has length 14 [2022-11-21 13:47:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:13,293 INFO L225 Difference]: With dead ends: 131 [2022-11-21 13:47:13,293 INFO L226 Difference]: Without dead ends: 131 [2022-11-21 13:47:13,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:47:13,294 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 14 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:13,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 489 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:47:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-21 13:47:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-21 13:47:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-11-21 13:47:13,298 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 14 [2022-11-21 13:47:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:13,298 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-11-21 13:47:13,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-11-21 13:47:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:47:13,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:13,299 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:13,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 13:47:13,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:13,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:13,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-11-21 13:47:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:13,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657882685] [2022-11-21 13:47:13,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:13,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:13,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657882685] [2022-11-21 13:47:13,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657882685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:13,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11117958] [2022-11-21 13:47:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:13,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:13,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:47:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:13,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 13:47:13,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:13,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:13,828 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:47:13,828 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 17 treesize of output 21 [2022-11-21 13:47:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:13,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:13,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11117958] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:13,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:13,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-21 13:47:13,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23379465] [2022-11-21 13:47:13,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:13,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:47:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:13,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:47:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:47:13,952 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:14,108 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-11-21 13:47:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:47:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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 15 [2022-11-21 13:47:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:14,109 INFO L225 Difference]: With dead ends: 129 [2022-11-21 13:47:14,109 INFO L226 Difference]: Without dead ends: 129 [2022-11-21 13:47:14,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:47:14,110 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 141 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:14,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 278 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-21 13:47:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-21 13:47:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-11-21 13:47:14,113 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 15 [2022-11-21 13:47:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:14,114 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-11-21 13:47:14,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-11-21 13:47:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:47:14,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:14,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:14,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:14,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:14,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-11-21 13:47:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:14,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372089633] [2022-11-21 13:47:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:14,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:14,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:14,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372089633] [2022-11-21 13:47:14,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372089633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:14,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649719944] [2022-11-21 13:47:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:14,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:14,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:14,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:14,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:47:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:14,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:47:14,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:14,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:14,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:14,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:14,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:47:14,749 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:14,749 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 11 treesize of output 11 [2022-11-21 13:47:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:14,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:19,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649719944] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:19,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:19,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-11-21 13:47:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491543848] [2022-11-21 13:47:19,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:19,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 13:47:19,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:19,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 13:47:19,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:47:19,140 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:19,508 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-21 13:47:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:47:19,509 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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) Word has length 15 [2022-11-21 13:47:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:19,510 INFO L225 Difference]: With dead ends: 127 [2022-11-21 13:47:19,510 INFO L226 Difference]: Without dead ends: 127 [2022-11-21 13:47:19,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:47:19,511 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 527 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:19,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 325 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:47:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-21 13:47:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-21 13:47:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-21 13:47:19,514 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2022-11-21 13:47:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:19,514 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-21 13:47:19,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-21 13:47:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:47:19,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:19,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:19,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 13:47:19,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 13:47:19,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-11-21 13:47:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:19,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406617979] [2022-11-21 13:47:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:47:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:19,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406617979] [2022-11-21 13:47:19,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406617979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:19,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:19,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:47:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905673146] [2022-11-21 13:47:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:19,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:19,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:19,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:19,829 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:20,013 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-11-21 13:47:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:47:20,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 22 [2022-11-21 13:47:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:20,015 INFO L225 Difference]: With dead ends: 124 [2022-11-21 13:47:20,015 INFO L226 Difference]: Without dead ends: 124 [2022-11-21 13:47:20,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:47:20,015 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 108 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:20,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 325 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-21 13:47:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-11-21 13:47:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-11-21 13:47:20,018 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2022-11-21 13:47:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:20,019 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-11-21 13:47:20,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-11-21 13:47:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:47:20,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:20,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:47:20,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-11-21 13:47:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:20,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433028419] [2022-11-21 13:47:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:20,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:47:20,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:20,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433028419] [2022-11-21 13:47:20,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433028419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:20,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:20,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:47:20,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766318161] [2022-11-21 13:47:20,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:20,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:20,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:20,248 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:20,390 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-11-21 13:47:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:47:20,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-11-21 13:47:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:20,392 INFO L225 Difference]: With dead ends: 117 [2022-11-21 13:47:20,392 INFO L226 Difference]: Without dead ends: 117 [2022-11-21 13:47:20,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:47:20,392 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:20,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 95 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-21 13:47:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-21 13:47:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2022-11-21 13:47:20,395 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2022-11-21 13:47:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:20,396 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2022-11-21 13:47:20,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-11-21 13:47:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:47:20,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:20,397 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, 1, 1, 1] [2022-11-21 13:47:20,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:47:20,397 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-11-21 13:47:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:20,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859599484] [2022-11-21 13:47:20,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:20,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:47:20,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:20,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859599484] [2022-11-21 13:47:20,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859599484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:20,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:20,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:47:20,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573877757] [2022-11-21 13:47:20,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:20,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:20,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:20,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:20,513 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:20,643 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-11-21 13:47:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:47:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2022-11-21 13:47:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:20,644 INFO L225 Difference]: With dead ends: 112 [2022-11-21 13:47:20,644 INFO L226 Difference]: Without dead ends: 112 [2022-11-21 13:47:20,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:47:20,645 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 387 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:20,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 84 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-21 13:47:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-21 13:47:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-11-21 13:47:20,648 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2022-11-21 13:47:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:20,648 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-11-21 13:47:20,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-11-21 13:47:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:47:20,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:20,649 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, 1, 1, 1] [2022-11-21 13:47:20,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:47:20,650 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-11-21 13:47:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:20,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384241227] [2022-11-21 13:47:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:20,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:47:21,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:21,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384241227] [2022-11-21 13:47:21,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384241227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:21,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:21,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:47:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734321208] [2022-11-21 13:47:21,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:21,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:47:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:21,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:47:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:47:21,089 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:21,346 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-11-21 13:47:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:47:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 28 [2022-11-21 13:47:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:21,347 INFO L225 Difference]: With dead ends: 107 [2022-11-21 13:47:21,347 INFO L226 Difference]: Without dead ends: 107 [2022-11-21 13:47:21,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:47:21,348 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 556 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:21,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 161 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-21 13:47:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-21 13:47:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-11-21 13:47:21,351 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2022-11-21 13:47:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:21,351 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-11-21 13:47:21,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-11-21 13:47:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:47:21,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:21,352 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, 1, 1, 1] [2022-11-21 13:47:21,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 13:47:21,352 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:21,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-11-21 13:47:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:21,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367622211] [2022-11-21 13:47:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:21,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:21,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367622211] [2022-11-21 13:47:21,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367622211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:21,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689977731] [2022-11-21 13:47:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:21,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:21,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:21,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:21,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:47:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:21,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-21 13:47:21,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:22,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:22,201 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 13:47:22,201 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 16 treesize of output 18 [2022-11-21 13:47:22,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:47:22,326 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 14 treesize of output 16 [2022-11-21 13:47:22,427 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 14 treesize of output 16 [2022-11-21 13:47:22,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:22,475 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 21 treesize of output 20 [2022-11-21 13:47:22,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:22,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-21 13:47:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:22,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:24,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:24,909 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 21 treesize of output 22 [2022-11-21 13:47:24,917 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 60 treesize of output 52 [2022-11-21 13:47:24,931 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 44 [2022-11-21 13:47:24,936 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 22 treesize of output 20 [2022-11-21 13:47:25,270 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:47:25,271 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 25 treesize of output 24 [2022-11-21 13:47:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:25,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689977731] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:25,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:25,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2022-11-21 13:47:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28819186] [2022-11-21 13:47:25,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:25,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-21 13:47:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-21 13:47:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1112, Unknown=27, NotChecked=0, Total=1260 [2022-11-21 13:47:25,282 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:26,555 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-11-21 13:47:26,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 13:47:26,555 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 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 28 [2022-11-21 13:47:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:26,556 INFO L225 Difference]: With dead ends: 106 [2022-11-21 13:47:26,556 INFO L226 Difference]: Without dead ends: 106 [2022-11-21 13:47:26,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=426, Invalid=1997, Unknown=27, NotChecked=0, Total=2450 [2022-11-21 13:47:26,558 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 998 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:26,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 527 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:47:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-21 13:47:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-11-21 13:47:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-11-21 13:47:26,561 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2022-11-21 13:47:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:26,562 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-11-21 13:47:26,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-11-21 13:47:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:47:26,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:26,563 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, 1, 1, 1, 1] [2022-11-21 13:47:26,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:26,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 13:47:26,769 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-11-21 13:47:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:26,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944521982] [2022-11-21 13:47:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:47:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:27,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944521982] [2022-11-21 13:47:27,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944521982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:27,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:27,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:47:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251751376] [2022-11-21 13:47:27,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:27,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:47:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:27,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:47:27,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:47:27,249 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:27,672 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-11-21 13:47:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:47:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2022-11-21 13:47:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:27,674 INFO L225 Difference]: With dead ends: 97 [2022-11-21 13:47:27,674 INFO L226 Difference]: Without dead ends: 97 [2022-11-21 13:47:27,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:47:27,675 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 567 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:27,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 74 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:47:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-21 13:47:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-21 13:47:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-11-21 13:47:27,678 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2022-11-21 13:47:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:27,679 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-11-21 13:47:27,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-11-21 13:47:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:47:27,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:27,680 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, 1, 1, 1, 1] [2022-11-21 13:47:27,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 13:47:27,681 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-11-21 13:47:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:27,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134633895] [2022-11-21 13:47:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:28,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:28,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134633895] [2022-11-21 13:47:28,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134633895] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:28,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51357513] [2022-11-21 13:47:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:28,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:28,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:28,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:47:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-21 13:47:28,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:28,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:28,457 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 13:47:28,458 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 16 treesize of output 18 [2022-11-21 13:47:28,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:47:28,569 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 14 treesize of output 16 [2022-11-21 13:47:28,730 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 42 treesize of output 40 [2022-11-21 13:47:28,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:28,798 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 49 treesize of output 40 [2022-11-21 13:47:28,991 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 43 treesize of output 27 [2022-11-21 13:47:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:29,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:29,114 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-21 13:47:31,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:31,319 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 23 treesize of output 24 [2022-11-21 13:47:31,323 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 68 treesize of output 60 [2022-11-21 13:47:31,327 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 56 treesize of output 52 [2022-11-21 13:47:31,335 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 26 treesize of output 24 [2022-11-21 13:47:31,653 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:47:31,654 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 25 treesize of output 24 [2022-11-21 13:47:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 13:47:31,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51357513] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:31,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:31,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-11-21 13:47:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317727176] [2022-11-21 13:47:31,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:31,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 13:47:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 13:47:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=665, Unknown=11, NotChecked=52, Total=812 [2022-11-21 13:47:31,664 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:33,793 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-11-21 13:47:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:47:33,794 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 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 29 [2022-11-21 13:47:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:33,794 INFO L225 Difference]: With dead ends: 96 [2022-11-21 13:47:33,794 INFO L226 Difference]: Without dead ends: 96 [2022-11-21 13:47:33,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=280, Invalid=1273, Unknown=11, NotChecked=76, Total=1640 [2022-11-21 13:47:33,796 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 664 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:33,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 286 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 719 Invalid, 0 Unknown, 98 Unchecked, 0.8s Time] [2022-11-21 13:47:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-21 13:47:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-11-21 13:47:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-11-21 13:47:33,798 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 29 [2022-11-21 13:47:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:33,799 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-11-21 13:47:33,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-11-21 13:47:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:47:33,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:33,800 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, 1, 1, 1, 1, 1] [2022-11-21 13:47:33,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-21 13:47:34,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 13:47:34,006 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-11-21 13:47:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:34,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273802012] [2022-11-21 13:47:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:47:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:34,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273802012] [2022-11-21 13:47:34,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273802012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:34,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:34,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 13:47:34,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348729670] [2022-11-21 13:47:34,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:34,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 13:47:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 13:47:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:47:34,393 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:34,882 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-11-21 13:47:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:47:34,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 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) Word has length 30 [2022-11-21 13:47:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:34,884 INFO L225 Difference]: With dead ends: 91 [2022-11-21 13:47:34,884 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 13:47:34,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-11-21 13:47:34,885 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 302 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:34,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 278 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:47:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 13:47:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-21 13:47:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2022-11-21 13:47:34,888 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 30 [2022-11-21 13:47:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:34,888 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2022-11-21 13:47:34,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2022-11-21 13:47:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:47:34,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:34,889 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, 1, 1, 1, 1, 1] [2022-11-21 13:47:34,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:47:34,889 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:34,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-11-21 13:47:34,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:34,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864613941] [2022-11-21 13:47:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:35,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864613941] [2022-11-21 13:47:35,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864613941] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:35,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809456140] [2022-11-21 13:47:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:35,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:35,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:35,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:47:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:35,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-21 13:47:35,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:35,522 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:35,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:47:35,565 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 13:47:35,565 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 16 treesize of output 18 [2022-11-21 13:47:35,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:47:35,613 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:35,614 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:47:35,706 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 24 treesize of output 24 [2022-11-21 13:47:35,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:35,764 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 31 treesize of output 26 [2022-11-21 13:47:35,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:35,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2022-11-21 13:47:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:35,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:36,151 INFO L321 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2022-11-21 13:47:36,152 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 38 [2022-11-21 13:47:36,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:36,238 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 43 treesize of output 35 [2022-11-21 13:47:36,247 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 235 treesize of output 215 [2022-11-21 13:47:36,267 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 195 treesize of output 187 [2022-11-21 13:47:36,275 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 187 treesize of output 171 [2022-11-21 13:47:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:36,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809456140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:36,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:36,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 28 [2022-11-21 13:47:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953065181] [2022-11-21 13:47:36,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:36,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 13:47:36,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:36,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 13:47:36,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=718, Unknown=8, NotChecked=0, Total=812 [2022-11-21 13:47:36,622 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:37,834 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-21 13:47:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:47:37,834 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 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 30 [2022-11-21 13:47:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:37,835 INFO L225 Difference]: With dead ends: 90 [2022-11-21 13:47:37,835 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 13:47:37,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=318, Invalid=1314, Unknown=8, NotChecked=0, Total=1640 [2022-11-21 13:47:37,836 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 211 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:37,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 680 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:47:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 13:47:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-21 13:47:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-21 13:47:37,839 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 30 [2022-11-21 13:47:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:37,839 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-21 13:47:37,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-21 13:47:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 13:47:37,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:37,840 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:37,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:38,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:38,041 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-11-21 13:47:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:38,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147025504] [2022-11-21 13:47:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:38,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147025504] [2022-11-21 13:47:38,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147025504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:38,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121419993] [2022-11-21 13:47:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:38,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:38,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:38,684 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:38,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:47:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:38,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-21 13:47:38,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:38,884 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:38,884 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 11 treesize of output 11 [2022-11-21 13:47:38,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:47:39,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:39,081 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 27 treesize of output 21 [2022-11-21 13:47:39,355 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:39,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:47:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:39,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:39,616 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 13 treesize of output 11 [2022-11-21 13:47:39,619 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 20 treesize of output 18 [2022-11-21 13:47:39,627 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 14 treesize of output 12 [2022-11-21 13:47:39,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:39,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:47:39,699 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:47:39,700 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 13 treesize of output 12 [2022-11-21 13:47:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:39,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121419993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:39,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:39,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2022-11-21 13:47:39,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476205754] [2022-11-21 13:47:39,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:39,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 13:47:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 13:47:39,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-11-21 13:47:39,711 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:40,628 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-11-21 13:47:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:47:40,633 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 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 33 [2022-11-21 13:47:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:40,633 INFO L225 Difference]: With dead ends: 89 [2022-11-21 13:47:40,633 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 13:47:40,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2022-11-21 13:47:40,634 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 450 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:40,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 521 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:47:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 13:47:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-21 13:47:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-11-21 13:47:40,638 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 33 [2022-11-21 13:47:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:40,638 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-11-21 13:47:40,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-11-21 13:47:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 13:47:40,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:40,639 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:40,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:40,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:40,846 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:40,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-11-21 13:47:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:40,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712598841] [2022-11-21 13:47:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:40,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:41,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712598841] [2022-11-21 13:47:41,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712598841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:41,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124709974] [2022-11-21 13:47:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:41,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:41,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:41,471 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:41,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:47:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:41,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-21 13:47:41,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:41,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:41,666 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:41,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:47:41,753 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 13:47:41,754 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 16 treesize of output 18 [2022-11-21 13:47:41,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:47:41,798 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:41,798 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:47:41,867 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 24 treesize of output 24 [2022-11-21 13:47:41,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:41,915 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 31 treesize of output 26 [2022-11-21 13:47:42,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:42,042 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 25 treesize of output 21 [2022-11-21 13:47:42,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:47:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:42,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:42,631 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_881) 0)) 1)) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2022-11-21 13:47:42,665 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|))))) is different from false [2022-11-21 13:47:42,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:42,691 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 57 treesize of output 61 [2022-11-21 13:47:42,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:42,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-21 13:47:42,971 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 171 treesize of output 165 [2022-11-21 13:47:42,979 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 210 treesize of output 202 [2022-11-21 13:47:42,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:42,995 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 235 treesize of output 237 [2022-11-21 13:47:43,006 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 250 treesize of output 246 [2022-11-21 13:47:43,065 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:47:43,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 26 treesize of output 1 [2022-11-21 13:47:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 13:47:43,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124709974] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:43,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:43,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2022-11-21 13:47:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689882432] [2022-11-21 13:47:43,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:43,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-21 13:47:43,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-21 13:47:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=844, Unknown=7, NotChecked=118, Total=1056 [2022-11-21 13:47:43,117 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:44,992 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-11-21 13:47:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 13:47:44,993 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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 33 [2022-11-21 13:47:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:44,993 INFO L225 Difference]: With dead ends: 88 [2022-11-21 13:47:44,993 INFO L226 Difference]: Without dead ends: 88 [2022-11-21 13:47:44,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=271, Invalid=1452, Unknown=7, NotChecked=162, Total=1892 [2022-11-21 13:47:44,994 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 294 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:44,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 840 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1008 Invalid, 0 Unknown, 129 Unchecked, 0.9s Time] [2022-11-21 13:47:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-21 13:47:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-21 13:47:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-11-21 13:47:44,997 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 33 [2022-11-21 13:47:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:44,997 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-11-21 13:47:44,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-11-21 13:47:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:47:44,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:44,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:45,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:45,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:45,199 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-11-21 13:47:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:45,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069523115] [2022-11-21 13:47:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:46,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:46,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069523115] [2022-11-21 13:47:46,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069523115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:46,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708497432] [2022-11-21 13:47:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:46,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:46,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:46,143 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:46,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:47:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:46,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-21 13:47:46,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:46,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:46,374 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:47:46,374 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 17 treesize of output 21 [2022-11-21 13:47:46,535 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 13:47:46,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:47:46,593 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 11 treesize of output 7 [2022-11-21 13:47:46,658 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:46,659 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:47:46,780 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 30 [2022-11-21 13:47:46,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:46,802 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 39 treesize of output 30 [2022-11-21 13:47:47,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:47,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2022-11-21 13:47:47,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:47:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:47,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:47,696 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1))) is different from false [2022-11-21 13:47:47,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:47,711 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 37 treesize of output 41 [2022-11-21 13:47:47,735 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_967) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-11-21 13:47:47,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:47,743 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 22 treesize of output 23 [2022-11-21 13:47:47,746 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 65 treesize of output 57 [2022-11-21 13:47:47,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:47:47,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:47:47,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:47:47,782 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:47:47,782 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 1 case distinctions, treesize of input 21 treesize of output 1 [2022-11-21 13:47:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 13:47:48,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708497432] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:48,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:48,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 50 [2022-11-21 13:47:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526772172] [2022-11-21 13:47:48,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:48,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-21 13:47:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:48,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-21 13:47:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2145, Unknown=18, NotChecked=190, Total=2550 [2022-11-21 13:47:48,287 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:50,568 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-11-21 13:47:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:47:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 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 34 [2022-11-21 13:47:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:50,572 INFO L225 Difference]: With dead ends: 91 [2022-11-21 13:47:50,572 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 13:47:50,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=649, Invalid=3630, Unknown=19, NotChecked=258, Total=4556 [2022-11-21 13:47:50,575 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 599 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:50,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 571 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 989 Invalid, 0 Unknown, 187 Unchecked, 0.8s Time] [2022-11-21 13:47:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 13:47:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2022-11-21 13:47:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2022-11-21 13:47:50,578 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 34 [2022-11-21 13:47:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:50,578 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2022-11-21 13:47:50,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-11-21 13:47:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:47:50,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:50,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:50,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:50,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:50,786 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2022-11-21 13:47:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:50,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256807106] [2022-11-21 13:47:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:51,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:51,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256807106] [2022-11-21 13:47:51,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256807106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:51,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341378171] [2022-11-21 13:47:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:51,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:51,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:51,347 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:51,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 13:47:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:51,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-21 13:47:51,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:51,569 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:51,570 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 11 treesize of output 11 [2022-11-21 13:47:51,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:47:51,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:51,716 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 18 treesize of output 16 [2022-11-21 13:47:51,907 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:47:51,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-21 13:47:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:51,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:52,180 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 32 [2022-11-21 13:47:52,234 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 13 treesize of output 11 [2022-11-21 13:47:52,237 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 20 treesize of output 18 [2022-11-21 13:47:52,294 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:47:52,295 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 13 treesize of output 12 [2022-11-21 13:47:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:52,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341378171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:52,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:52,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 30 [2022-11-21 13:47:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895984791] [2022-11-21 13:47:52,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:52,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 13:47:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:52,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 13:47:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-11-21 13:47:52,304 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:53,276 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-11-21 13:47:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:47:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 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 34 [2022-11-21 13:47:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:53,277 INFO L225 Difference]: With dead ends: 86 [2022-11-21 13:47:53,277 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 13:47:53,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2022-11-21 13:47:53,279 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 559 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:53,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 473 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:47:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 13:47:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-21 13:47:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-21 13:47:53,282 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 34 [2022-11-21 13:47:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:53,282 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-21 13:47:53,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-21 13:47:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:47:53,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:53,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:53,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:53,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-21 13:47:53,490 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:53,490 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-11-21 13:47:53,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:53,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894358878] [2022-11-21 13:47:53,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:53,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:54,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894358878] [2022-11-21 13:47:54,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894358878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:54,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506554119] [2022-11-21 13:47:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:54,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:54,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:54,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:54,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 13:47:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:54,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-21 13:47:54,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:54,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:54,547 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:47:54,547 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 17 treesize of output 21 [2022-11-21 13:47:54,651 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 13:47:54,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:47:54,695 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 11 treesize of output 7 [2022-11-21 13:47:54,745 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:54,746 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-21 13:47:54,852 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 23 treesize of output 23 [2022-11-21 13:47:54,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:54,921 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 30 treesize of output 25 [2022-11-21 13:47:55,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:55,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2022-11-21 13:47:55,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:47:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:55,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:55,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:47:55,724 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-11-21 13:47:55,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:55,732 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 22 treesize of output 23 [2022-11-21 13:47:55,735 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 65 treesize of output 57 [2022-11-21 13:47:55,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:47:55,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:47:55,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:47:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 13:47:56,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506554119] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:56,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:56,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 47 [2022-11-21 13:47:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598352745] [2022-11-21 13:47:56,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:56,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-21 13:47:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-21 13:47:56,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1976, Unknown=11, NotChecked=90, Total=2256 [2022-11-21 13:47:56,098 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:58,628 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-11-21 13:47:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:47:58,629 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 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 34 [2022-11-21 13:47:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:58,629 INFO L225 Difference]: With dead ends: 87 [2022-11-21 13:47:58,629 INFO L226 Difference]: Without dead ends: 87 [2022-11-21 13:47:58,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=659, Invalid=3492, Unknown=13, NotChecked=126, Total=4290 [2022-11-21 13:47:58,631 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 618 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 55 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:58,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 721 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1323 Invalid, 9 Unknown, 89 Unchecked, 1.0s Time] [2022-11-21 13:47:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-21 13:47:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-11-21 13:47:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-21 13:47:58,634 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 34 [2022-11-21 13:47:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:58,634 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-21 13:47:58,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-21 13:47:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:47:58,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:58,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:58,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:58,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 13:47:58,842 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:47:58,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-11-21 13:47:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:58,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880304304] [2022-11-21 13:47:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:58,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:59,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:59,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880304304] [2022-11-21 13:47:59,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880304304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:59,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87278912] [2022-11-21 13:47:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:59,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:59,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:59,425 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:59,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 13:47:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:59,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-21 13:47:59,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:59,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:47:59,626 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:59,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:47:59,665 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 13:47:59,665 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 16 treesize of output 18 [2022-11-21 13:47:59,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:47:59,751 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:59,752 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-21 13:47:59,813 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 15 treesize of output 17 [2022-11-21 13:47:59,834 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-21 13:47:59,834 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 22 treesize of output 27 [2022-11-21 13:47:59,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:59,958 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 16 treesize of output 16 [2022-11-21 13:48:00,127 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:48:00,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-21 13:48:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:00,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:00,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:48:00,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:00,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-21 13:48:00,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:00,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:48:00,558 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 20 treesize of output 18 [2022-11-21 13:48:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:00,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87278912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:00,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:00,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 34 [2022-11-21 13:48:00,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575274876] [2022-11-21 13:48:00,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:00,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-21 13:48:00,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:00,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-21 13:48:00,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=0, NotChecked=0, Total=1190 [2022-11-21 13:48:00,714 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:01,731 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-21 13:48:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 13:48:01,731 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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 34 [2022-11-21 13:48:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:01,732 INFO L225 Difference]: With dead ends: 82 [2022-11-21 13:48:01,732 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 13:48:01,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=324, Invalid=1838, Unknown=0, NotChecked=0, Total=2162 [2022-11-21 13:48:01,733 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 520 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:01,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 521 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:48:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 13:48:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-21 13:48:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.12987012987013) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-21 13:48:01,736 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 34 [2022-11-21 13:48:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:01,737 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-21 13:48:01,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-21 13:48:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 13:48:01,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:01,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:01,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-21 13:48:01,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-21 13:48:01,943 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:48:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-11-21 13:48:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:01,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176457960] [2022-11-21 13:48:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:03,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176457960] [2022-11-21 13:48:03,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176457960] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:03,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010287295] [2022-11-21 13:48:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:03,013 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:03,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 13:48:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:03,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-21 13:48:03,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:03,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:48:03,214 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:48:03,214 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 17 treesize of output 21 [2022-11-21 13:48:03,324 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 13:48:03,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:48:03,381 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 11 treesize of output 7 [2022-11-21 13:48:03,454 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:48:03,455 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:48:03,586 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 30 [2022-11-21 13:48:03,659 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 37 treesize of output 28 [2022-11-21 13:48:03,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:04,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:04,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 53 [2022-11-21 13:48:04,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-21 13:48:04,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-21 13:48:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:04,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:06,494 INFO L321 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2022-11-21 13:48:06,494 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 116 treesize of output 141 [2022-11-21 13:48:06,653 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 v_prenex_12) (select .cse0 (+ v_prenex_12 4))))) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_9))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_9))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (not (<= v_prenex_9 0)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) (not (<= 0 v_prenex_9))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (or (not (let ((.cse4 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse4 v_prenex_12) (select .cse4 (+ v_prenex_12 4))))) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12)))) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1312) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1313) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-11-21 13:48:06,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:06,683 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 105 treesize of output 81 [2022-11-21 13:48:06,689 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 553 treesize of output 535 [2022-11-21 13:48:06,720 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 339 treesize of output 331 [2022-11-21 13:48:06,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:06,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 518 treesize of output 528 [2022-11-21 13:48:06,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 312 [2022-11-21 13:48:06,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 394 [2022-11-21 13:48:06,925 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 415 treesize of output 399 [2022-11-21 13:48:08,419 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:48:08,420 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 1 case distinctions, treesize of input 52 treesize of output 1 [2022-11-21 13:48:08,428 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:48:08,428 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 1 case distinctions, treesize of input 27 treesize of output 1 [2022-11-21 13:48:08,437 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:48:08,438 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 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-21 13:48:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 13:48:08,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010287295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:08,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:08,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 53 [2022-11-21 13:48:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586192822] [2022-11-21 13:48:08,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:08,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-21 13:48:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:08,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-21 13:48:08,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2583, Unknown=1, NotChecked=102, Total=2862 [2022-11-21 13:48:08,862 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 54 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 54 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:13,635 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-11-21 13:48:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 13:48:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 54 states have internal predecessors, (93), 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 36 [2022-11-21 13:48:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:13,636 INFO L225 Difference]: With dead ends: 83 [2022-11-21 13:48:13,636 INFO L226 Difference]: Without dead ends: 83 [2022-11-21 13:48:13,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=629, Invalid=4485, Unknown=2, NotChecked=140, Total=5256 [2022-11-21 13:48:13,638 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 547 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 66 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:13,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 776 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1431 Invalid, 1 Unknown, 58 Unchecked, 1.3s Time] [2022-11-21 13:48:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-21 13:48:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-11-21 13:48:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.103896103896104) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-21 13:48:13,642 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 36 [2022-11-21 13:48:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:13,642 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-21 13:48:13,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 54 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-21 13:48:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 13:48:13,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:13,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:13,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 13:48:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 13:48:13,849 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:48:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1472889600, now seen corresponding path program 1 times [2022-11-21 13:48:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:13,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722240617] [2022-11-21 13:48:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:14,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:14,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722240617] [2022-11-21 13:48:14,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722240617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:14,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280842245] [2022-11-21 13:48:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:14,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:14,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:14,815 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:14,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 13:48:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:14,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-21 13:48:14,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:14,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:48:15,009 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:48:15,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:48:15,104 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 13:48:15,104 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 16 treesize of output 18 [2022-11-21 13:48:15,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:48:15,211 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:48:15,211 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-21 13:48:15,294 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 15 treesize of output 17 [2022-11-21 13:48:15,304 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 20 treesize of output 19 [2022-11-21 13:48:15,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:15,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:15,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 39 [2022-11-21 13:48:15,861 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:48:15,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-21 13:48:16,042 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:48:16,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-21 13:48:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:16,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:16,475 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 176 treesize of output 170 [2022-11-21 13:48:16,647 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1403 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1403 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))))) is different from false [2022-11-21 13:48:16,664 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1403 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1403 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-21 13:48:16,674 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1402 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1402) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1402 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1402) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-21 13:48:16,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:16,682 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 27 treesize of output 28 [2022-11-21 13:48:16,684 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 85 treesize of output 81 [2022-11-21 13:48:16,689 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 83 treesize of output 81 [2022-11-21 13:48:16,694 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 99 treesize of output 95 [2022-11-21 13:48:16,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:16,703 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 111 treesize of output 115 [2022-11-21 13:48:16,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:16,750 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 27 treesize of output 28 [2022-11-21 13:48:16,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:16,755 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 43 treesize of output 39 [2022-11-21 13:48:16,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:16,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:16,767 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 34 treesize of output 38 [2022-11-21 13:48:16,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:16,772 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 20 treesize of output 18 [2022-11-21 13:48:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-21 13:48:16,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280842245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:16,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:16,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 50 [2022-11-21 13:48:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595300084] [2022-11-21 13:48:16,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:16,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-21 13:48:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:16,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-21 13:48:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2061, Unknown=3, NotChecked=282, Total=2550 [2022-11-21 13:48:16,988 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:19,473 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-11-21 13:48:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 13:48:19,474 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 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 37 [2022-11-21 13:48:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:19,474 INFO L225 Difference]: With dead ends: 78 [2022-11-21 13:48:19,475 INFO L226 Difference]: Without dead ends: 78 [2022-11-21 13:48:19,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=616, Invalid=3553, Unknown=3, NotChecked=384, Total=4556 [2022-11-21 13:48:19,476 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 818 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:19,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 552 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 922 Invalid, 0 Unknown, 236 Unchecked, 0.7s Time] [2022-11-21 13:48:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-21 13:48:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-21 13:48:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.077922077922078) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-21 13:48:19,479 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 37 [2022-11-21 13:48:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:19,480 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-21 13:48:19,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-21 13:48:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 13:48:19,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:19,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:19,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 13:48:19,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-21 13:48:19,687 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:48:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash -882633249, now seen corresponding path program 1 times [2022-11-21 13:48:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:19,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481657611] [2022-11-21 13:48:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:21,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:21,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481657611] [2022-11-21 13:48:21,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481657611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:21,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087745617] [2022-11-21 13:48:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:21,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:21,086 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:21,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 13:48:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:21,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-21 13:48:21,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:21,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:48:21,631 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:48:21,632 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-21 13:48:21,833 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:48:21,833 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 50 treesize of output 48 [2022-11-21 13:48:21,853 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 55 treesize of output 46 [2022-11-21 13:48:22,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:22,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:22,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 67 [2022-11-21 13:48:23,932 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 1))) (let ((.cse1 (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 0) (= |c_#valid| (store (store (store .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 0) (= (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 0))))) is different from true [2022-11-21 13:48:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:23,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:24,510 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-21 13:48:24,529 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-21 13:48:24,543 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-21 13:48:24,566 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-21 13:48:24,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1498 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1498) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-21 13:48:24,614 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1498 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1498) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-11-21 13:48:24,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1497) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1498) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-21 13:48:24,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:24,641 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 64 treesize of output 57 [2022-11-21 13:48:24,648 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 170 treesize of output 164 [2022-11-21 13:48:24,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:24,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 165 [2022-11-21 13:48:24,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 371 treesize of output 347 [2022-11-21 13:48:24,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 204 [2022-11-21 13:48:40,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse44 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse5 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse204 (< (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 3) 0)) (.cse425 (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1))) (.cse333 (< 3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse439 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)) (.cse440 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse10 (store .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (let ((.cse24 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse478 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse479 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse478 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse478 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse478 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse478 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse478 (select (store .cse479 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse478 (select (store .cse479 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse25 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse476 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse477 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse476 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse476 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse476 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse476 (select (store .cse477 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse476 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse476 (select (store .cse477 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse27 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse475 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse475 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse475 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse475 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse30 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse474 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse474 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse474 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse474 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse474 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse474 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse33 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse473 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse473 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse473 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse473 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse473 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse34 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse472 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse472 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse472 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse472 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse472 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse472 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse96 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (< .cse440 0)) (.cse23 (< 0 .cse440)) (.cse426 (or .cse333 .cse439)) (.cse334 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 5)) (.cse427 (or .cse204 .cse425)) (.cse205 (< 0 (+ 5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse67 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse60 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse471 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse471 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse471 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse61 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse14 (not .cse5))) (let ((.cse17 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse470 (store .cse3 v_arrayElimCell_195 0)) (.cse469 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse469 (select (store .cse470 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse470 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse62 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse467 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse468 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse467 (select (store .cse468 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse467 (select (store .cse468 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse98 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse466 (store .cse3 v_arrayElimCell_197 0)) (.cse465 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse465 (select (store .cse466 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse465 (select (store .cse466 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse465 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (.cse93 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (.cse117 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse464 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse464 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse464 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (.cse26 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse463 (store .cse3 v_arrayElimCell_195 0)) (.cse462 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse462 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse462 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse463 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse463 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse28 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse460 (store .cse3 v_arrayElimCell_195 0)) (.cse459 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse461 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse459 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse459 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse459 (select (store .cse460 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store .cse460 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store .cse461 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store .cse461 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse31 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse458 (store .cse3 v_arrayElimCell_195 0)) (.cse457 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse457 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse457 (select (store .cse458 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse457 (select (store .cse458 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse457 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse457 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse457 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse32 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse455 (store .cse3 v_arrayElimCell_195 0)) (.cse454 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse456 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse454 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse455 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse455 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse456 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse454 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse454 (select (store .cse456 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse35 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse453 (store .cse3 v_arrayElimCell_195 0)) (.cse452 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse452 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse452 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse453 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse453 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse36 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse451 (store .cse3 v_arrayElimCell_195 0)) (.cse450 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse450 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse450 (select (store .cse451 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store .cse451 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse450 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse157 (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (.cse185 (or .cse61 .cse14)) (.cse189 (or .cse60 .cse14)) (.cse214 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse449 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse449 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14)) (.cse54 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse447 (store .cse3 v_arrayElimCell_197 0)) (.cse446 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse446 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse446 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse447 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse447 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse448 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse446 (select (store .cse448 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse448 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse446 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse211 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse445 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse445 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14)) (.cse55 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse444 (store .cse3 v_arrayElimCell_197 0)) (.cse443 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse443 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse443 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse444 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse444 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse443 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse443 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse56 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse442 (store .cse3 v_arrayElimCell_197 0)) (.cse441 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse441 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse441 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse441 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse441 (select (store .cse442 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse441 (select (store .cse442 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse441 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse170 (not (<= .cse440 0))) (.cse171 (not (<= 0 .cse440))) (.cse146 (and .cse439 .cse425)) (.cse71 (store .cse67 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse63 (and .cse439 .cse427 .cse205)) (.cse223 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse437 (store .cse3 v_arrayElimCell_197 0)) (.cse436 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse436 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse436 (select (store .cse437 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse436 (select (store .cse437 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse438 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse436 (select (store .cse438 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse436 (select (store .cse438 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse224 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse434 (store .cse3 v_arrayElimCell_197 0)) (.cse433 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse433 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse433 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse434 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse434 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse435 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse433 (select (store .cse435 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse435 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse225 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse431 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse432 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse431 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse431 (select (store .cse432 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse431 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse431 (select (store .cse432 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse159 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse429 (store .cse3 v_arrayElimCell_195 0)) (.cse428 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse430 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse428 (select (store .cse429 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse429 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse430 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse430 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse297 (and .cse426 .cse427 .cse205 .cse334)) (.cse279 (and .cse425 .cse426 .cse334)) (.cse329 (or (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse420 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse421 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse420 (select (store .cse421 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse421 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse420 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse96) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse422 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (let ((.cse423 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse422 (select (store .cse423 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse422 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse422 (select (store .cse423 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse422 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse424 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (= .cse424 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse424 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse0 .cse23)) (.cse37 (and .cse24 .cse25 .cse27 .cse30 .cse33 .cse34)) (.cse29 (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse418 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse418 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse418 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse419 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse419 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse419 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse419 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse14)) (.cse38 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse39 (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse57 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse417 (store .cse3 v_arrayElimCell_197 0)) (.cse416 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse416 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store .cse417 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse416 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse416 (select (store .cse417 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse58 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse414 (store .cse3 v_arrayElimCell_197 0)) (.cse413 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse413 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse413 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse413 (select (store .cse414 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse413 (select (store .cse414 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse415 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse413 (select (store .cse415 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse413 (select (store .cse415 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse413 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse59 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse411 (store .cse3 v_arrayElimCell_197 0)) (.cse410 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse410 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse411 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse411 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse412 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse410 (select (store .cse412 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse412 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse410 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (and (or .cse0 (let ((.cse6 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse22 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse22 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse22 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse7 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse20 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse20 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse20 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse21 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse20 (select (store .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse20 (select (store .cse21 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse8 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse18 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse18 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse18 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse18 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse19 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse18 (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse18 (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse2 (store .cse3 v_arrayElimCell_195 0)) (.cse1 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse1 (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store .cse2 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse4 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse1 (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse5 (and .cse6 .cse7 .cse8)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse11 (store .cse3 v_arrayElimCell_195 0)) (.cse9 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse9 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse11 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse12 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse9 (select (store .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse6 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse13 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse13 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse14) .cse7 .cse8 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse16 (store .cse3 v_arrayElimCell_195 0)) (.cse15 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse15 (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse15 (select (store .cse16 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse15 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse15 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse17 .cse14))) .cse23) (or (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (or .cse37 .cse5)) .cse38 .cse39) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse41 (store .cse3 v_arrayElimCell_195 0)) (.cse42 (store .cse3 v_arrayElimCell_197 0)) (.cse40 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse40 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse41 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse42 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse42 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse43 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse40 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse40 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse46 (store .cse3 v_arrayElimCell_195 0)) (.cse45 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse45 (select (store .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse46 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse48 (store .cse3 v_arrayElimCell_195 0)) (.cse49 (store .cse3 v_arrayElimCell_197 0)) (.cse47 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse47 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse48 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse49 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse50 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse47 (select (store .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse50 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse47 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse52 (store .cse3 v_arrayElimCell_195 0)) (.cse53 (store .cse3 v_arrayElimCell_197 0)) (.cse51 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse51 (select (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse51 (select (store .cse52 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse51 (select (store .cse53 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse51 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse51 (select (store .cse53 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse51 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse0 .cse23) (or .cse5 (and (or .cse38 (and .cse54 .cse55 .cse56) .cse39) (or (and .cse57 .cse58 .cse59) .cse0 .cse23))) (or (and (or .cse60 .cse38 .cse39) (or .cse61 .cse0 .cse23) (or .cse62 .cse0 .cse23)) .cse14) (or .cse63 (and (or (and .cse62 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse64 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse64 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse64 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse65 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse65 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse65 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse66 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse69 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse66 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse66 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse68 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse66 (select (store .cse68 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse68 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse66 (select (store .cse69 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse69 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse70 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse70 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse70 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse70 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse72 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse70 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse72 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse70 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse73 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse73 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse73 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse73 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse73 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse74 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse74 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse74 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse74 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse77 (store .cse3 v_arrayElimCell_197 0)) (.cse75 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse75 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse75 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse76 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse75 (select (store .cse76 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse75 (select (store .cse76 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse75 (select (store .cse77 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse75 (select (store .cse77 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse75 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse78 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse78 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse78 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= .cse78 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse78 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse79 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (or (= .cse79 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse79 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse79 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse79 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse80 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse81 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse80 (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse81 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse82 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse82 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse82 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse84 (store .cse3 v_arrayElimCell_197 0)) (.cse83 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse83 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse83 (select (store .cse84 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse83 (select (store .cse84 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse83 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse83 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse86 (store .cse3 v_arrayElimCell_197 0)) (.cse85 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse85 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse85 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse85 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse85 (select (store .cse86 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse86 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse87 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse87 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse87 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse88 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse87 (select (store .cse88 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse87 (select (store .cse88 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse89 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse90 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse89 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse89 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse89 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse89 (select (store .cse90 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse91 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse91 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse92 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse91 (select (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse92 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse91 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (and (or .cse93 .cse14) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse94 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse94 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse94 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse94 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse95 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse95 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse95 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) .cse96) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse97 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse97 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse97 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse97 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse97 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse97 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or .cse14 (and .cse98 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse100 (store .cse3 v_arrayElimCell_197 0)) (.cse99 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse99 (select (store .cse100 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse99 (select (store .cse100 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse99 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= .cse99 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse101 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse102 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_196 Int)) (or (= .cse101 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse101 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse101 (select (store .cse102 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store .cse102 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse104 (store .cse3 v_arrayElimCell_197 0)) (.cse103 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse103 (select (store .cse104 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse103 (select (store .cse104 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse105 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse103 (select (store .cse105 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse103 (select (store .cse105 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse106 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse106 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse106 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse106 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse107 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse106 (select (store .cse107 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store .cse107 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse109 (store .cse3 v_arrayElimCell_197 0)) (.cse108 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse108 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse109 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse109 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse110 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse108 (select (store .cse110 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse110 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse111 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse111 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse111 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse112 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse111 (select (store .cse112 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse111 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse113 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse113 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse113 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= .cse113 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse114 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse114 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse115 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse114 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse115 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse116 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (or (= .cse116 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse116 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse116 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse117) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse119 (store .cse3 v_arrayElimCell_197 0)) (.cse118 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse118 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse119 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse119 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse120 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse118 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse120 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse121 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse121 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse121 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse121 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse122 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse121 (select (store .cse122 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse121 (select (store .cse122 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse123 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse123 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse123 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse123 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse123 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse123 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse124 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse124 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse124 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse124 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse125 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse125 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse125 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse125 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse127 (store .cse3 v_arrayElimCell_197 0)) (.cse126 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse126 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse126 (select (store .cse127 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse126 (select (store .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse126 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse128 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse128 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse129 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse128 (select (store .cse129 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse129 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse130 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (or (= .cse130 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse130 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse130 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse131 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse131 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse131 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= .cse131 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse131 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse132 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse132 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse132 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse14))) (or (let ((.cse136 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse206 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse206 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse206 (select .cse44 v_antiDerIndex_entry0_1)))))) (.cse135 (and .cse204 .cse205)) (.cse138 (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (.cse137 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse203 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse203 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse203 (select .cse44 v_antiDerIndex_entry0_1)))))) (.cse141 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse202 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse202 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse202 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse202 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse202 (select .cse44 v_antiDerIndex_entry0_1)))))) (.cse142 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse201 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse201 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse201 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse201 (select .cse44 v_antiDerIndex_entry0_1)))))) (.cse140 (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (and (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (= .cse133 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse133 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse134 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (or (= .cse134 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (= .cse134 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse38 .cse39) (or .cse135 .cse136) .cse137 (or .cse17 .cse0 .cse23) (or .cse138 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse139 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse139 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse139 (select .cse44 v_antiDerIndex_entry0_1))))) .cse140) (or (and .cse141 .cse142) .cse138 .cse140) (or .cse135 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse143 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse63 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse144 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse144 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse144 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse144 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse38 (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse145 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse145 (select .cse44 v_antiDerIndex_entry0_1))))) .cse39) (or .cse146 .cse136) (or .cse63 .cse136) (or .cse63 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse147 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse146 .cse62 .cse14) (or .cse146 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse149 (store .cse3 v_arrayElimCell_197 0)) (.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse148 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse149 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse135 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse150 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse63 (and .cse98 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse152 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (or (= .cse151 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (= .cse151 (select (store .cse152 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse152 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse153 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse153 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (= .cse153 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse153 (select .cse44 v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse154 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse154 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse154 (select .cse44 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse154 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse155 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (= .cse155 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse155 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse155 (select .cse44 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse156 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse156 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse156 (select .cse44 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse156 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (and (or .cse63 .cse93) (or .cse157 .cse38 .cse39) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse158 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse158 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse158 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) .cse135)) .cse14) (or .cse146 .cse159) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse160 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse160 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or .cse146 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse161 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse162 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse161 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse162 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse162 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse5 (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse163 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse163 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse163 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse135) (or .cse138 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse164 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse164 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse164 (select .cse44 v_antiDerIndex_entry0_1))))) .cse140) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) .cse38 .cse39) (or .cse146 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse166 (store .cse3 v_arrayElimCell_197 0)) (.cse165 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse165 (select (store .cse166 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse165 (select (store .cse166 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse165 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse167 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse167 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse167 (select .cse44 v_antiDerIndex_entry0_1))))) (or .cse146 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse168 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse169 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse168 (select (store .cse169 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store .cse169 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse170 .cse171) (or .cse63 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (or .cse138 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse172 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse172 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse172 (select .cse44 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse173 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse173 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse173 (select .cse44 v_antiDerIndex_entry0_1)))))) .cse140))) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse175 (store .cse3 v_arrayElimCell_195 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse174 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse174 (select (store .cse175 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse175 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse177 (store .cse3 v_arrayElimCell_195 0)) (.cse176 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse176 (select (store .cse177 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse176 (select (store .cse177 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse176 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse63) (or .cse170 .cse171 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse178 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse178 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse170 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse180 (store .cse3 v_arrayElimCell_197 0)) (.cse179 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse179 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse180 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse180 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse181 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (= .cse181 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse182 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse182 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse183 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse182 (select (store .cse183 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse182 (select (store .cse183 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse184 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse184 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse184 (select .cse44 v_antiDerIndex_entry0_1))))) .cse185) .cse171) (or .cse138 (and .cse137 .cse141 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse186 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse186 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse187 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse187 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse187 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse187 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (= .cse187 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse187 (select .cse44 v_antiDerIndex_entry0_1))))) .cse142 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse188 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse188 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse188 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) .cse189) .cse140) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse191 (store .cse3 v_arrayElimCell_195 0)) (.cse192 (store .cse3 v_arrayElimCell_197 0)) (.cse190 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse190 (select (store .cse191 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse191 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse192 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse192 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse146) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse194 (store .cse3 v_arrayElimCell_197 0)) (.cse193 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse193 (select (store .cse194 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse193 (select (store .cse194 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse193 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse193 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse196 (store .cse3 v_arrayElimCell_197 0)) (.cse195 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (or (= .cse195 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (= .cse195 (select (store .cse196 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse196 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse63) .cse189 (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse197 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse197 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (= .cse197 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse197 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse197 (select .cse44 v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse198 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse198 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse198 (select .cse44 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse198 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse199 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse199 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or .cse63 (and .cse117 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse200 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (or (= .cse200 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (= .cse200 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))))) (not .cse96)) (or (let ((.cse210 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse222 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse222 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse222 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse222 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse222 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse212 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse220 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse220 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse220 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse221 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse220 (select (store .cse221 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store .cse221 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse220 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse213 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse219 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse219 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse208 (store .cse3 v_arrayElimCell_195 0)) (.cse207 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse207 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse208 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse208 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse209 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse207 (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse207 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse210 .cse211 .cse212 (or (and .cse210 .cse212 .cse213) .cse5) .cse213 .cse214 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse216 (store .cse3 v_arrayElimCell_195 0)) (.cse215 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse215 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse216 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse216 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse215 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse215 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse218 (store .cse3 v_arrayElimCell_195 0)) (.cse217 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse217 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or .cse5 .cse0 .cse23 (and .cse223 .cse224 .cse225)) (or .cse38 (and .cse26 .cse28 .cse29 .cse31 .cse32 .cse35 .cse36) .cse39) (or (let ((.cse231 (or .cse157 .cse14))) (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse226 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse226 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or .cse96 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse227 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse227 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse227 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse228 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse228 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse229 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse229 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse229 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse230 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse229 (select (store .cse230 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse229 (select (store .cse230 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse231)) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse232 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse232 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse232 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse232 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse232 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse233 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse233 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse233 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse233 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse234 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse233 (select (store .cse234 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse233 (select (store .cse234 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse235 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse235 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse235 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse235 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse236 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse237 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse236 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store .cse237 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store .cse237 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse14) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse238 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse238 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse239 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse239 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse239 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse240 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse240 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse242 (store .cse3 v_arrayElimCell_197 0)) (.cse241 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse241 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse242 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse242 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse241 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse243 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse243 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse244 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse243 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse231 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse246 (store .cse3 v_arrayElimCell_197 0)) (.cse245 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse245 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse246 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse246 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse247 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse245 (select (store .cse247 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse247 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse249 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse248 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse249 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse249 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (and (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse250 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse250 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse250 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse251 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse250 (select (store .cse251 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse251 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse252 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse252 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse252 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse185 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse253 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse253 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse254 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse253 (select (store .cse254 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store .cse254 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse0 .cse23) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse255 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse255 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse255 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse256 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse256 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse256 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse256 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse257 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse257 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse258 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse189) .cse38 .cse39)) .cse96) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse260 (store .cse3 v_arrayElimCell_195 0)) (.cse261 (store .cse3 v_arrayElimCell_197 0)) (.cse259 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse259 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse260 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse260 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse261 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse261 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse262 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse259 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse259 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse214 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse264 (store .cse3 v_arrayElimCell_195 0)) (.cse265 (store .cse3 v_arrayElimCell_197 0)) (.cse263 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse263 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse264 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse264 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse265 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse265 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse267 (store .cse3 v_arrayElimCell_195 0)) (.cse268 (store .cse3 v_arrayElimCell_197 0)) (.cse266 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse266 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse267 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse267 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse268 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse268 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse266 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse266 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse38 .cse39) (or (and .cse54 .cse211 .cse55 .cse56) .cse38 .cse39) (or .cse5 (let ((.cse273 (and .cse333 .cse334)) (.cse312 (and (or .cse333 .cse204) .cse205 .cse334))) (and (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse269 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse270 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse269 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse269 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse270 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse270 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse271 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse272 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse271 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse272 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse272 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse96 .cse273) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse274 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse275 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse274 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse274 (select (store .cse275 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse274 (select (store .cse275 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0 .cse23) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse277 (store .cse3 v_arrayElimCell_197 0)) (.cse276 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse278 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse276 (select (store .cse277 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse277 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse278 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse278 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse279) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse281 (store .cse3 v_arrayElimCell_197 0)) (.cse280 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse282 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse280 (select (store .cse281 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store .cse281 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store .cse282 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store .cse282 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse279) (or (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse283 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse284 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse283 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse284 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse284 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse286 (store .cse3 v_arrayElimCell_197 0)) (.cse285 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse287 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse285 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse286 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse286 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse287 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse287 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse273) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse288 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse288 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse288 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse289 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse289 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse289 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse289 (select .cse10 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse290 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse290 (select .cse10 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (let ((.cse291 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse290 (select (store .cse291 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse290 (select (store .cse291 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse10 v_antiDerIndex_entry0_1))) .cse96) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse292 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse292 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse292 (select .cse10 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse293 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse293 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse293 (select .cse10 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (= .cse293 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse294 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse294 (select .cse10 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse294 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse296 (store .cse3 v_arrayElimCell_197 0)) (.cse295 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse295 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse296 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse296 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse297) (or .cse297 (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse298 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse298 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse298 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse299 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse299 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse299 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse300 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse300 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse301 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse300 (select (store .cse301 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse300 (select (store .cse301 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse302 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse302 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (let ((.cse303 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse302 (select (store .cse303 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse302 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse302 (select (store .cse303 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse96 (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse96 .cse279 (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse304 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse305 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse304 (select (store .cse305 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse305 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse297 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse306 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse306 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse306 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse306 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse297 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse307 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse308 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse307 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse307 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse308 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse308 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse310 (store .cse3 v_arrayElimCell_197 0)) (.cse309 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse311 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse309 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse310 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse310 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse311 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse311 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse279) (or .cse312 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse313 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse313 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse313 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse313 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse313 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse312 (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse314 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse314 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse96) (or .cse312 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse316 (store .cse3 v_arrayElimCell_197 0)) (.cse315 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse315 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse315 (select (store .cse316 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse315 (select (store .cse316 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse315 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse315 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse317 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse318 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse317 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse317 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse318 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse318 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse319 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse320 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse319 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse319 (select (store .cse320 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse319 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse319 (select (store .cse320 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse38 .cse39) (or (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse321 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse321 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse321 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse321 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse322 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse322 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse322 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse322 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse323 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse324 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse323 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse323 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse323 (select (store .cse324 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse323 (select (store .cse324 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0 .cse23) (or (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse325 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse326 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse325 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse325 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse325 (select (store .cse326 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse325 (select (store .cse326 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse327 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse328 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse327 (select (store .cse328 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse327 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse327 (select (store .cse328 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse297) .cse329 (or .cse38 (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse330 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse330 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse330 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse330 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse39) (or .cse312 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse331 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse332 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse331 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse331 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store .cse332 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store .cse332 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (or .cse63 .cse5 (and (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse335 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse335 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse335 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse335 (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (or .cse96 (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)))) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse336 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse336 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse336 (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse337 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse338 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse337 (select (store .cse338 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse337 (select (store .cse338 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse337 (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse339 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (let ((.cse340 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse339 (select (store .cse340 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse339 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse339 (select (store .cse340 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse339 (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))))) (or .cse5 (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse341 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse341 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse341 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse170 .cse171) (or .cse96 (and (or .cse170 .cse171 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse71 v_antiDerIndex_entry0_1)))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse342 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse342 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse342 (select .cse67 v_antiDerIndex_entry0_1))))) .cse146))) (or .cse63 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse343 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse343 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (let ((.cse344 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse343 (select (store .cse344 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse343 (select (store .cse344 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse345 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse345 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse345 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse67 v_antiDerIndex_entry0_1))) .cse96) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse346 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse346 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse346 (select .cse67 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse347 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse347 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse348 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse347 (select (store .cse348 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse347 (select (store .cse348 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse349 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse350 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse349 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse350 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse350 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse170 .cse171) (or .cse146 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse351 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse352 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse351 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse352 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse352 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse353 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse353 (select .cse71 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse353 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse353 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse353 (select .cse67 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse354 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse354 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse354 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse354 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse63))) (or (and .cse223 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse355 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse356 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse355 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse355 (select (store .cse356 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse355 (select (store .cse356 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse14) .cse224 .cse225) .cse0 .cse23) (or (and (or .cse159 .cse14) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse358 (store .cse3 v_arrayElimCell_195 0)) (.cse357 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse359 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse357 (select (store .cse358 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse358 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse359 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse357 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse357 (select (store .cse359 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse361 (store .cse3 v_arrayElimCell_195 0)) (.cse362 (store .cse3 v_arrayElimCell_197 0)) (.cse360 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse360 (select (store .cse361 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse361 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse362 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse362 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse363 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse360 (select (store .cse363 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse363 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse365 (store .cse3 v_arrayElimCell_195 0)) (.cse366 (store .cse3 v_arrayElimCell_197 0)) (.cse364 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse364 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse364 (select (store .cse365 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse364 (select (store .cse365 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse364 (select (store .cse366 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse364 (select (store .cse366 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse367 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse364 (select (store .cse367 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse364 (select (store .cse367 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse0 .cse23) (or .cse5 (and (or (and (or .cse96 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse368 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse368 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse368 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse369 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse369 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse369 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse369 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse370 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse370 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse370 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse370 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse370 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse371 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (let ((.cse372 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse371 (select (store .cse372 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse371 (select (store .cse372 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse371 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse373 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse374 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse373 (select (store .cse374 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse373 (select (store .cse374 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse373 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse373 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)))))) .cse297) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse376 (store .cse3 v_arrayElimCell_197 0)) (.cse375 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse377 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse375 (select (store .cse376 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse376 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse377 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse377 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse279) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse378 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse379 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse378 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse378 (select (store .cse379 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse378 (select (store .cse379 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0 .cse23) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse381 (store .cse3 v_arrayElimCell_197 0)) (.cse380 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse382 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse380 (select (store .cse381 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse381 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse382 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse382 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse279) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse384 (store .cse3 v_arrayElimCell_197 0)) (.cse383 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse385 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse383 (select (store .cse384 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse384 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse385 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse385 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse279) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse386 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse387 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse386 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse386 (select (store .cse387 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse386 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse386 (select (store .cse387 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0 .cse23) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse389 (store .cse3 v_arrayElimCell_197 0)) (.cse388 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse390 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse388 (select (store .cse389 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse388 (select (store .cse389 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse388 (select (store .cse390 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse388 (select (store .cse390 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse279) (or (and (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse391 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse392 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse391 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse391 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse391 (select (store .cse392 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse391 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse391 (select (store .cse392 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse393 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse394 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse393 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse393 (select (store .cse394 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse393 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse393 (select (store .cse394 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse297) (or .cse297 (and (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse395 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse396 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse395 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse395 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse395 (select (store .cse396 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse395 (select (store .cse396 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse397 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse398 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse397 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse397 (select (store .cse398 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse398 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse297 (and (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse399 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse399 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse399 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse400 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (let ((.cse401 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse400 (select (store .cse401 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse400 (select (store .cse401 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse400 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (or .cse96 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse402 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse402 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse402 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse402 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse403 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse404 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse403 (select (store .cse404 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse404 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse403 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse405 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse406 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse405 (select (store .cse406 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse405 (select (store .cse406 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse96 .cse279) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse407 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse408 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse407 (select (store .cse408 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store .cse408 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse96 .cse279) .cse329)) (or .cse37 .cse5 .cse38 .cse39) (or (and .cse24 .cse25 .cse27 .cse29 .cse30 .cse33 .cse34) .cse38 .cse39) (or (and .cse57 .cse58 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse409 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse409 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14) .cse59) .cse0 .cse23))))))) is different from false [2022-11-21 13:50:21,363 WARN L233 SmtUtils]: Spent 43.96s on a formula simplification. DAG size of input: 470 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:50:39,899 WARN L233 SmtUtils]: Spent 16.09s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:50:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-21 13:50:42,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087745617] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:50:42,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:50:42,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 20] total 58 [2022-11-21 13:50:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278122952] [2022-11-21 13:50:42,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:42,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-21 13:50:42,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-21 13:50:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2305, Unknown=30, NotChecked=936, Total=3422 [2022-11-21 13:50:42,652 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 59 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 59 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:50:45,287 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse44 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse5 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse204 (< (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 3) 0)) (.cse426 (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1))) (.cse334 (< 3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse440 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)) (.cse441 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse10 (store .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (let ((.cse24 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse479 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse480 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse479 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse479 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse479 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse25 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse477 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse478 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse477 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse477 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse477 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse477 (select (store .cse478 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse477 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse477 (select (store .cse478 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse27 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse476 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse476 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse476 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse476 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse476 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse30 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse475 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse475 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse475 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse475 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse33 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse474 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse474 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse474 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse474 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse474 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse34 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse473 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse473 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse473 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse473 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse473 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse473 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse96 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (< .cse441 0)) (.cse23 (< 0 .cse441)) (.cse427 (or .cse334 .cse440)) (.cse335 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 5)) (.cse428 (or .cse204 .cse426)) (.cse205 (< 0 (+ 5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse67 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse60 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse472 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse472 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse472 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse61 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse14 (not .cse5))) (let ((.cse17 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse471 (store .cse3 v_arrayElimCell_195 0)) (.cse470 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse470 (select (store .cse471 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse470 (select (store .cse471 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse470 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse62 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse468 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse469 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse468 (select (store .cse469 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse468 (select (store .cse469 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse98 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse467 (store .cse3 v_arrayElimCell_197 0)) (.cse466 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse466 (select (store .cse467 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse466 (select (store .cse467 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse466 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (.cse93 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (.cse117 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse465 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse465 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse465 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (.cse26 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse464 (store .cse3 v_arrayElimCell_195 0)) (.cse463 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse463 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse463 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse464 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse464 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (.cse28 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse461 (store .cse3 v_arrayElimCell_195 0)) (.cse460 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse462 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse460 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse460 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse460 (select (store .cse461 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse460 (select (store .cse461 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse460 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse460 (select (store .cse462 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse460 (select (store .cse462 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse31 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse459 (store .cse3 v_arrayElimCell_195 0)) (.cse458 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse458 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse458 (select (store .cse459 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse458 (select (store .cse459 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse458 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse458 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse458 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse32 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse456 (store .cse3 v_arrayElimCell_195 0)) (.cse455 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse457 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse455 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse456 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse456 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse457 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse455 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse455 (select (store .cse457 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse35 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse454 (store .cse3 v_arrayElimCell_195 0)) (.cse453 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse453 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse453 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse454 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse454 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse36 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse452 (store .cse3 v_arrayElimCell_195 0)) (.cse451 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse451 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse452 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse452 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse451 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (.cse157 (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (.cse185 (or .cse61 .cse14)) (.cse189 (or .cse60 .cse14)) (.cse214 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse450 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse450 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14)) (.cse54 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse448 (store .cse3 v_arrayElimCell_197 0)) (.cse447 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse447 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse447 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse448 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse448 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse449 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse447 (select (store .cse449 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse449 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse447 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse211 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse446 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse446 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14)) (.cse55 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse445 (store .cse3 v_arrayElimCell_197 0)) (.cse444 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse444 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse444 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse444 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse444 (select (store .cse445 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse444 (select (store .cse445 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse444 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse444 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse56 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse443 (store .cse3 v_arrayElimCell_197 0)) (.cse442 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse442 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse442 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store .cse443 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store .cse443 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse170 (not (<= .cse441 0))) (.cse171 (not (<= 0 .cse441))) (.cse146 (and .cse440 .cse426)) (.cse71 (store .cse67 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse63 (and .cse440 .cse428 .cse205)) (.cse269 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 1)) (.cse223 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse438 (store .cse3 v_arrayElimCell_197 0)) (.cse437 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse437 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse438 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse438 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse439 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse437 (select (store .cse439 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse439 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse224 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse435 (store .cse3 v_arrayElimCell_197 0)) (.cse434 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse434 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse434 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store .cse435 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store .cse435 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse436 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse434 (select (store .cse436 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store .cse436 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse225 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse432 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse433 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse432 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse432 (select (store .cse433 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse432 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse432 (select (store .cse433 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse159 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse430 (store .cse3 v_arrayElimCell_195 0)) (.cse429 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse431 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse429 (select (store .cse430 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store .cse430 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store .cse431 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store .cse431 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse298 (and .cse427 .cse428 .cse205 .cse335)) (.cse280 (and .cse426 .cse427 .cse335)) (.cse330 (or (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse421 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse422 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse421 (select (store .cse422 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store .cse422 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse421 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse96) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse423 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (let ((.cse424 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse423 (select (store .cse424 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse423 (select (store .cse424 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse423 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse425 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (= .cse425 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse425 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse0 .cse23)) (.cse37 (and .cse24 .cse25 .cse27 .cse30 .cse33 .cse34)) (.cse29 (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse419 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse419 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse419 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse419 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse420 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse420 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse420 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse14)) (.cse38 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse39 (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse57 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse418 (store .cse3 v_arrayElimCell_197 0)) (.cse417 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse417 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse417 (select (store .cse418 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse417 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse417 (select (store .cse418 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse417 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse58 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse415 (store .cse3 v_arrayElimCell_197 0)) (.cse414 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse414 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse414 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse415 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse415 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse416 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse414 (select (store .cse416 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse416 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse414 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse59 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse412 (store .cse3 v_arrayElimCell_197 0)) (.cse411 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse411 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse411 (select (store .cse412 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse411 (select (store .cse412 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse413 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse411 (select (store .cse413 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse411 (select (store .cse413 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse411 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (and (or .cse0 (let ((.cse6 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse22 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse22 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse22 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse7 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse20 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse20 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse20 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse21 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse20 (select (store .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse20 (select (store .cse21 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse8 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse18 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse18 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse18 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse18 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse19 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse18 (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse18 (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse2 (store .cse3 v_arrayElimCell_195 0)) (.cse1 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse1 (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store .cse2 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse4 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse1 (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse5 (and .cse6 .cse7 .cse8)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse11 (store .cse3 v_arrayElimCell_195 0)) (.cse9 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse9 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse11 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse12 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse9 (select (store .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse6 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse13 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse13 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse14) .cse7 .cse8 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse16 (store .cse3 v_arrayElimCell_195 0)) (.cse15 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse15 (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse15 (select (store .cse16 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse15 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse15 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse17 .cse14))) .cse23) (or (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (or .cse37 .cse5)) .cse38 .cse39) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse41 (store .cse3 v_arrayElimCell_195 0)) (.cse42 (store .cse3 v_arrayElimCell_197 0)) (.cse40 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse40 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse41 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse42 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse42 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse43 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse40 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse40 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse46 (store .cse3 v_arrayElimCell_195 0)) (.cse45 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse45 (select (store .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse46 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse48 (store .cse3 v_arrayElimCell_195 0)) (.cse49 (store .cse3 v_arrayElimCell_197 0)) (.cse47 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse47 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse48 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse49 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse50 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse47 (select (store .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse50 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse47 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse52 (store .cse3 v_arrayElimCell_195 0)) (.cse53 (store .cse3 v_arrayElimCell_197 0)) (.cse51 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse51 (select (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse51 (select (store .cse52 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse51 (select (store .cse53 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse51 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse51 (select (store .cse53 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse51 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse0 .cse23) (or .cse5 (and (or .cse38 (and .cse54 .cse55 .cse56) .cse39) (or (and .cse57 .cse58 .cse59) .cse0 .cse23))) (or (and (or .cse60 .cse38 .cse39) (or .cse61 .cse0 .cse23) (or .cse62 .cse0 .cse23)) .cse14) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (or .cse63 (and (or (and .cse62 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse64 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse64 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse64 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse65 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse65 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse65 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse66 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse69 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse66 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse66 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse68 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse66 (select (store .cse68 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse68 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse66 (select (store .cse69 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse69 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse70 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse70 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse70 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse70 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse72 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse70 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse72 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse70 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse73 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse73 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse73 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse73 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse73 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse74 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse74 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse74 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse74 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse77 (store .cse3 v_arrayElimCell_197 0)) (.cse75 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse75 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse75 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse76 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse75 (select (store .cse76 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse75 (select (store .cse76 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse75 (select (store .cse77 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse75 (select (store .cse77 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse75 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse78 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse78 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse78 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= .cse78 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse78 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse79 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (or (= .cse79 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse79 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse79 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse79 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse80 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse81 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse80 (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse81 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse82 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse82 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse82 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse84 (store .cse3 v_arrayElimCell_197 0)) (.cse83 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse83 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse83 (select (store .cse84 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse83 (select (store .cse84 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse83 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse83 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse86 (store .cse3 v_arrayElimCell_197 0)) (.cse85 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse85 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse85 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse85 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse85 (select (store .cse86 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse86 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse87 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse87 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse87 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse88 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse87 (select (store .cse88 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse87 (select (store .cse88 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse89 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse90 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse89 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse89 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse89 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse89 (select (store .cse90 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse91 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse91 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse92 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse91 (select (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse92 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse91 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (and (or .cse93 .cse14) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse94 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse94 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse94 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse94 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse95 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse95 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse95 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) .cse96) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse97 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse97 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse97 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse97 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse97 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse97 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or .cse14 (and .cse98 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse100 (store .cse3 v_arrayElimCell_197 0)) (.cse99 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse99 (select (store .cse100 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse99 (select (store .cse100 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse99 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= .cse99 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse101 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse102 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_196 Int)) (or (= .cse101 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse101 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse101 (select (store .cse102 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store .cse102 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse104 (store .cse3 v_arrayElimCell_197 0)) (.cse103 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse103 (select (store .cse104 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse103 (select (store .cse104 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse105 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse103 (select (store .cse105 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse103 (select (store .cse105 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse106 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse106 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse106 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse106 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse107 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse106 (select (store .cse107 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store .cse107 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse109 (store .cse3 v_arrayElimCell_197 0)) (.cse108 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse108 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse109 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse109 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse110 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse108 (select (store .cse110 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse110 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse111 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse111 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse111 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (let ((.cse112 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse111 (select (store .cse112 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) (= .cse111 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse113 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse113 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse113 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= .cse113 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse114 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse114 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse115 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse114 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse115 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse116 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (or (= .cse116 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse116 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse116 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse117) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse119 (store .cse3 v_arrayElimCell_197 0)) (.cse118 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse118 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse119 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse119 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse120 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse118 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse120 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse121 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse121 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse121 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse121 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse122 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse121 (select (store .cse122 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse121 (select (store .cse122 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse123 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse123 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (or (= .cse123 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse123 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse123 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse123 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse124 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse124 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse124 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse124 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse125 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse125 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse125 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse125 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse127 (store .cse3 v_arrayElimCell_197 0)) (.cse126 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse126 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse126 (select (store .cse127 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse126 (select (store .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse126 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse128 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse128 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse129 (store .cse3 v_arrayElimCell_195 0))) (or (= .cse128 (select (store .cse129 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse129 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse130 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (or (= .cse130 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse130 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (= .cse130 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse131 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse131 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int)) (= .cse131 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_196 Int)) (= .cse131 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse131 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse132 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse132 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse132 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse14))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (or (let ((.cse136 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse206 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse206 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse206 (select .cse44 v_antiDerIndex_entry0_1)))))) (.cse135 (and .cse204 .cse205)) (.cse138 (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (.cse137 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse203 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse203 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse203 (select .cse44 v_antiDerIndex_entry0_1)))))) (.cse141 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse202 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse202 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse202 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse202 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse202 (select .cse44 v_antiDerIndex_entry0_1)))))) (.cse142 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse201 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse201 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse201 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse201 (select .cse44 v_antiDerIndex_entry0_1)))))) (.cse140 (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (and (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (= .cse133 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse133 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse134 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (or (= .cse134 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (= .cse134 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse38 .cse39) (or .cse135 .cse136) .cse137 (or .cse17 .cse0 .cse23) (or .cse138 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse139 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse139 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse139 (select .cse44 v_antiDerIndex_entry0_1))))) .cse140) (or (and .cse141 .cse142) .cse138 .cse140) (or .cse135 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse143 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse63 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse144 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse144 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse144 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse144 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse38 (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse145 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse145 (select .cse44 v_antiDerIndex_entry0_1))))) .cse39) (or .cse146 .cse136) (or .cse63 .cse136) (or .cse63 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse147 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse146 .cse62 .cse14) (or .cse146 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse149 (store .cse3 v_arrayElimCell_197 0)) (.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse148 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse149 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse135 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse150 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse63 (and .cse98 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse152 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (or (= .cse151 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (= .cse151 (select (store .cse152 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse152 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse153 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse153 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (= .cse153 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse153 (select .cse44 v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse154 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse154 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse154 (select .cse44 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse154 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse155 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int)) (= .cse155 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse155 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse155 (select .cse44 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse156 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse156 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse156 (select .cse44 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse156 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (and (or .cse63 .cse93) (or .cse157 .cse38 .cse39) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse158 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse158 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse158 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) .cse135)) .cse14) (or .cse146 .cse159) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse160 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse160 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or .cse146 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse161 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse162 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse161 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse162 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse162 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse5 (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse163 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse163 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse163 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse135) (or .cse138 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse164 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse164 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse164 (select .cse44 v_antiDerIndex_entry0_1))))) .cse140) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) .cse38 .cse39) (or .cse146 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse166 (store .cse3 v_arrayElimCell_197 0)) (.cse165 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse165 (select (store .cse166 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse165 (select (store .cse166 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse165 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse167 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse167 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse167 (select .cse44 v_antiDerIndex_entry0_1))))) (or .cse146 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse168 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse169 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse168 (select (store .cse169 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store .cse169 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse170 .cse171) (or .cse63 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (or .cse138 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse172 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse172 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse172 (select .cse44 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse173 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse173 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse173 (select .cse44 v_antiDerIndex_entry0_1)))))) .cse140))) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse175 (store .cse3 v_arrayElimCell_195 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse174 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse174 (select (store .cse175 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse175 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse177 (store .cse3 v_arrayElimCell_195 0)) (.cse176 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse176 (select (store .cse177 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse176 (select (store .cse177 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse176 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse63) (or .cse170 .cse171 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse178 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse178 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse170 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse180 (store .cse3 v_arrayElimCell_197 0)) (.cse179 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse179 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse180 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse180 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse181 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (= .cse181 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse182 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse182 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse183 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse182 (select (store .cse183 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse182 (select (store .cse183 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse184 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse184 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse184 (select .cse44 v_antiDerIndex_entry0_1))))) .cse185) .cse171) (or .cse138 (and .cse137 .cse141 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse186 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse186 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse187 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse187 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse187 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse187 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (= .cse187 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse187 (select .cse44 v_antiDerIndex_entry0_1))))) .cse142 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse188 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse188 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse188 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) .cse189) .cse140) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse191 (store .cse3 v_arrayElimCell_195 0)) (.cse192 (store .cse3 v_arrayElimCell_197 0)) (.cse190 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse190 (select (store .cse191 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse191 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse192 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse192 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse146) (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse194 (store .cse3 v_arrayElimCell_197 0)) (.cse193 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse193 (select (store .cse194 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse193 (select (store .cse194 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse193 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse193 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse196 (store .cse3 v_arrayElimCell_197 0)) (.cse195 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (or (= .cse195 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (= .cse195 (select (store .cse196 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse196 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse63) .cse189 (or (and (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse197 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse197 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (= .cse197 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse197 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse197 (select .cse44 v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse198 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse198 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse198 (select .cse44 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= .cse198 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse199 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse199 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or .cse63 (and .cse117 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse200 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (or (= .cse200 (select (store (store .cse3 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (= .cse200 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))))) (not .cse96)) (or (let ((.cse210 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse222 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse222 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse222 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse222 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse222 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse212 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse220 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse220 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse220 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse221 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse220 (select (store .cse221 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store .cse221 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse220 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (.cse213 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse219 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse219 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse208 (store .cse3 v_arrayElimCell_195 0)) (.cse207 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse207 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse208 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse208 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse209 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse207 (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse207 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse210 .cse211 .cse212 (or (and .cse210 .cse212 .cse213) .cse5) .cse213 .cse214 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse216 (store .cse3 v_arrayElimCell_195 0)) (.cse215 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse215 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse216 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse216 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse215 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse215 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse218 (store .cse3 v_arrayElimCell_195 0)) (.cse217 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse217 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or .cse5 .cse0 .cse23 (and .cse223 .cse224 .cse225)) (or .cse38 (and .cse26 .cse28 .cse29 .cse31 .cse32 .cse35 .cse36) .cse39) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or (let ((.cse231 (or .cse157 .cse14))) (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse226 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse226 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or .cse96 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse227 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse227 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse227 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse228 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse228 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse229 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse229 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse229 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse230 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse229 (select (store .cse230 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse229 (select (store .cse230 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse231)) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse232 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse232 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse232 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse232 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse232 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse233 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse233 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse233 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse233 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse234 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse233 (select (store .cse234 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse233 (select (store .cse234 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse235 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse235 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse235 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse235 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse236 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse237 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse236 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store .cse237 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store .cse237 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse14) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse238 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse238 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse239 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse239 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse239 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse240 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse240 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse242 (store .cse3 v_arrayElimCell_197 0)) (.cse241 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse241 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse242 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse242 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse241 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse243 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse243 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse244 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse243 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse231 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse246 (store .cse3 v_arrayElimCell_197 0)) (.cse245 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse245 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse246 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse246 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse247 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse245 (select (store .cse247 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse247 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse249 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse248 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse249 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse249 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (and (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse250 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse250 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse250 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse251 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse250 (select (store .cse251 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse251 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse252 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse252 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse252 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse185 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse253 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse253 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse254 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse253 (select (store .cse254 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store .cse254 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse0 .cse23) (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse255 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse255 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse255 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse256 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse256 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse256 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse256 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse257 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse257 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse258 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse189) .cse38 .cse39)) .cse96) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse260 (store .cse3 v_arrayElimCell_195 0)) (.cse261 (store .cse3 v_arrayElimCell_197 0)) (.cse259 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse259 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse260 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse260 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse261 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse261 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse262 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse259 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse259 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse214 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse264 (store .cse3 v_arrayElimCell_195 0)) (.cse265 (store .cse3 v_arrayElimCell_197 0)) (.cse263 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse263 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse264 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse264 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse265 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse265 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse267 (store .cse3 v_arrayElimCell_195 0)) (.cse268 (store .cse3 v_arrayElimCell_197 0)) (.cse266 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse266 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse267 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse267 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse44 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse268 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse268 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse266 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse266 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse38 .cse39) (= |c_#valid| (store .cse269 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (or (and .cse54 .cse211 .cse55 .cse56) .cse38 .cse39) (or .cse5 (let ((.cse274 (and .cse334 .cse335)) (.cse313 (and (or .cse334 .cse204) .cse205 .cse335))) (and (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse270 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse271 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse270 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse270 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store .cse271 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store .cse271 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse272 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse273 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse272 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse272 (select (store .cse273 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store .cse273 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse96 .cse274) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse275 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse276 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse275 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store .cse276 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store .cse276 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0 .cse23) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse278 (store .cse3 v_arrayElimCell_197 0)) (.cse277 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse279 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse277 (select (store .cse278 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse278 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse279 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse279 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse280) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse282 (store .cse3 v_arrayElimCell_197 0)) (.cse281 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse283 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse281 (select (store .cse282 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store .cse282 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store .cse283 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store .cse283 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse280) (or (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse284 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse285 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse284 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse287 (store .cse3 v_arrayElimCell_197 0)) (.cse286 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse288 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse286 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse286 (select (store .cse287 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store .cse287 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store .cse288 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store .cse288 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse274) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse289 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse289 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse289 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse289 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse289 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse38 .cse39) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse290 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse290 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse290 (select .cse10 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse291 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse291 (select .cse10 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (let ((.cse292 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse291 (select (store .cse292 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse291 (select (store .cse292 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse10 v_antiDerIndex_entry0_1))) .cse96) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse293 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse293 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse293 (select .cse10 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse294 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse294 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse294 (select .cse10 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (= .cse294 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse295 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse295 (select .cse10 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse295 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse297 (store .cse3 v_arrayElimCell_197 0)) (.cse296 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse296 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse297 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse297 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse298) (or .cse298 (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse299 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse299 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse299 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse300 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse300 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse300 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse300 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse301 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse301 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse302 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse301 (select (store .cse302 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse301 (select (store .cse302 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse303 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse303 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (let ((.cse304 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse303 (select (store .cse304 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse303 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse303 (select (store .cse304 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse96 (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse96 .cse280 (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse305 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse306 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse305 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse298 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse307 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse307 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse307 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse298 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse308 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse309 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse308 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse308 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse309 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse309 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse311 (store .cse3 v_arrayElimCell_197 0)) (.cse310 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse312 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse310 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse310 (select (store .cse311 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse310 (select (store .cse311 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse310 (select (store .cse312 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse310 (select (store .cse312 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse280) (or .cse313 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse314 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse314 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse313 (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse315 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse315 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse315 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse96) (or .cse313 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse317 (store .cse3 v_arrayElimCell_197 0)) (.cse316 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse316 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse317 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse317 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse318 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse319 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse318 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse318 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse318 (select (store .cse319 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse318 (select (store .cse319 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse320 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse321 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse320 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse320 (select (store .cse321 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse320 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse320 (select (store .cse321 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse38 .cse39) (or (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse322 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse322 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse322 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse322 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse323 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse323 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse323 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse323 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse38 .cse39) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse324 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse325 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse324 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse324 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store .cse325 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store .cse325 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0 .cse23) (or (and (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse326 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse327 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse326 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse326 (select (store .cse327 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse327 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse328 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse329 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse328 (select (store .cse329 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse328 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse328 (select (store .cse329 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse298) .cse330 (or .cse38 (forall ((v_arrayElimCell_192 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse331 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse331 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse331 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse39) (or .cse313 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse332 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse333 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse332 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse332 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse332 (select (store .cse333 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse332 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse332 (select (store .cse333 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (or .cse63 .cse5 (and (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse336 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse336 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse336 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse336 (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (or .cse96 (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)))) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse337 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse337 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse337 (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse338 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse339 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse338 (select (store .cse339 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse339 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse338 (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse340 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (let ((.cse341 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse340 (select (store .cse341 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse340 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse340 (select (store .cse341 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse340 (select (store .cse67 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))))) (or .cse5 (and (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse342 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse342 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse342 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse170 .cse171) (or .cse96 (and (or .cse170 .cse171 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse71 v_antiDerIndex_entry0_1)))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse343 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse343 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse343 (select .cse67 v_antiDerIndex_entry0_1))))) .cse146))) (or .cse63 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse344 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse344 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int)) (let ((.cse345 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse344 (select (store .cse345 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse344 (select (store .cse345 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse346 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse346 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse346 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse67 v_antiDerIndex_entry0_1))) .cse96) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse347 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse347 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse347 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse347 (select .cse67 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse348 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse348 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse349 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse348 (select (store .cse349 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse348 (select (store .cse349 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse350 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse351 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse350 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse350 (select (store .cse351 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse350 (select (store .cse351 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse170 .cse171) (or .cse146 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse352 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse353 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse352 (select .cse67 v_antiDerIndex_entry0_1)) (= .cse352 (select (store .cse353 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse352 (select (store .cse353 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse354 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse354 (select .cse71 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse354 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse354 (select .cse67 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse355 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse355 (select .cse71 v_antiDerIndex_entry0_1)) (= .cse355 (select .cse67 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse355 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))) .cse63))) (= (select .cse269 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (or (and .cse223 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse356 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse357 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse356 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse357 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse357 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse14) .cse224 .cse225) .cse0 .cse23) (or (and (or .cse159 .cse14) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse359 (store .cse3 v_arrayElimCell_195 0)) (.cse358 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse360 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse358 (select (store .cse359 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse358 (select (store .cse359 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse358 (select (store .cse360 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (= .cse358 (select (store (store .cse3 v_arrayElimCell_192 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse358 (select (store .cse360 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse362 (store .cse3 v_arrayElimCell_195 0)) (.cse363 (store .cse3 v_arrayElimCell_197 0)) (.cse361 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse361 (select (store .cse362 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse361 (select (store .cse362 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse361 (select (store .cse363 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse361 (select (store .cse363 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse364 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse361 (select (store .cse364 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse361 (select (store .cse364 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse366 (store .cse3 v_arrayElimCell_195 0)) (.cse367 (store .cse3 v_arrayElimCell_197 0)) (.cse365 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse365 (select .cse10 v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse366 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse366 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse367 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse367 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_192 Int)) (let ((.cse368 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse365 (select (store .cse368 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse368 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse0 .cse23) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (or .cse5 (and (or (and (or .cse96 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse369 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse369 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse369 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse370 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse370 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse370 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse370 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse371 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse371 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse371 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse372 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (let ((.cse373 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse372 (select (store .cse373 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse372 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse372 (select (store .cse373 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse372 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse372 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse374 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse375 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse374 (select (store .cse375 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse374 (select (store .cse375 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse374 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse374 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)))))) .cse298) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse377 (store .cse3 v_arrayElimCell_197 0)) (.cse376 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse378 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse376 (select (store .cse377 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse376 (select (store .cse377 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse376 (select (store .cse378 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse376 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse376 (select (store .cse378 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse280) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse379 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse380 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse379 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse379 (select (store .cse380 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse379 (select (store .cse380 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0 .cse23) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse382 (store .cse3 v_arrayElimCell_197 0)) (.cse381 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse383 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse381 (select (store .cse382 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse381 (select (store .cse382 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse381 (select (store .cse383 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse381 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse381 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse381 (select (store .cse383 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse280) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse385 (store .cse3 v_arrayElimCell_197 0)) (.cse384 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse386 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse384 (select (store .cse385 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse384 (select (store .cse385 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse384 (select (store .cse386 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse384 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse384 (select (store .cse386 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse280) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse387 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse388 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse387 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse387 (select (store .cse388 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse387 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse387 (select (store .cse388 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0 .cse23) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse390 (store .cse3 v_arrayElimCell_197 0)) (.cse389 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse391 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse389 (select (store .cse390 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse389 (select (store .cse390 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse389 (select (store .cse391 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse389 (select (store .cse391 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse280) (or (and (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse392 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse393 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse392 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse392 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse392 (select (store .cse393 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse392 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse392 (select (store .cse393 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse394 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse395 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse394 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse394 (select (store .cse395 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse394 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse394 (select (store .cse395 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse298) (or .cse298 (and (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse396 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse397 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse396 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse396 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse396 (select (store .cse397 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse396 (select (store .cse397 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse398 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse399 (store .cse3 v_arrayElimCell_192 0))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse398 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse398 (select (store .cse399 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse398 (select (store .cse399 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse298 (and (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse400 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (= .cse400 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse400 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse401 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int)) (let ((.cse402 (store .cse3 v_arrayElimCell_197 0))) (or (forall ((v_arrayElimCell_198 Int)) (or (= .cse401 (select (store .cse402 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse401 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse401 (select (store .cse402 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse401 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (or .cse96 (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse403 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (or (= .cse403 (select (store (store .cse3 v_arrayElimCell_197 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse403 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse404 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse405 (store .cse3 v_arrayElimCell_197 0))) (or (= .cse404 (select (store .cse405 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse404 (select (store .cse405 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse404 (select (store (store .cse3 v_arrayElimCell_192 0) v_arrayElimCell_194 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse406 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse407 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse406 (select (store .cse407 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse406 (select (store .cse407 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse96 .cse280) (or (forall ((v_arrayElimCell_192 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse408 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse409 (store .cse3 v_arrayElimCell_192 0))) (or (= .cse408 (select (store .cse409 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse408 (select (store .cse44 v_arrayElimCell_194 0) v_antiDerIndex_entry0_1)) (= .cse408 (select (store .cse409 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse96 .cse280) .cse330)) (or .cse37 .cse5 .cse38 .cse39) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) (or (and .cse24 .cse25 .cse27 .cse29 .cse30 .cse33 .cse34) .cse38 .cse39) .cse14 (or (and .cse57 .cse58 (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse410 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse410 (select (store (store .cse3 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store (store .cse3 v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse44 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse14) .cse59) .cse0 .cse23))))))) is different from true [2022-11-21 13:51:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:59,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2022-11-21 13:51:59,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 117.9s TimeCoverageRelationStatistics Valid=166, Invalid=2495, Unknown=31, NotChecked=1090, Total=3782 [2022-11-21 13:51:59,180 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:59,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 63 Unchecked, 0.3s Time] [2022-11-21 13:51:59,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:59,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:59,381 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 55 more [2022-11-21 13:51:59,385 INFO L158 Benchmark]: Toolchain (without parser) took 289892.06ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 120.9MB in the beginning and 368.6MB in the end (delta: -247.6MB). Peak memory consumption was 248.4MB. Max. memory is 16.1GB. [2022-11-21 13:51:59,385 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:51:59,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.61ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 103.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 13:51:59,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.30ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 102.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:51:59,386 INFO L158 Benchmark]: Boogie Preprocessor took 65.24ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:51:59,386 INFO L158 Benchmark]: RCFGBuilder took 677.08ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 79.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-21 13:51:59,386 INFO L158 Benchmark]: TraceAbstraction took 288550.22ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 79.0MB in the beginning and 368.6MB in the end (delta: -289.6MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. [2022-11-21 13:51:59,387 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.61ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 103.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.30ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 102.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.24ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 677.08ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 79.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 288550.22ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 79.0MB in the beginning and 368.6MB in the end (delta: -289.6MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:52:01,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:52:01,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:52:01,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:52:01,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:52:01,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:52:01,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:52:01,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:52:01,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:52:01,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:52:01,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:52:01,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:52:01,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:52:01,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:52:01,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:52:01,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:52:01,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:52:01,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:52:01,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:52:01,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:52:01,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:52:01,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:52:01,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:52:01,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:52:01,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:52:01,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:52:01,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:52:01,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:52:01,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:52:01,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:52:01,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:52:01,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:52:01,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:52:01,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:52:01,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:52:01,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:52:01,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:52:01,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:52:01,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:52:01,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:52:01,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:52:01,810 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 13:52:01,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:52:01,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:52:01,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:52:01,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:52:01,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:52:01,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:52:01,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:52:01,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:52:01,845 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:52:01,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:52:01,846 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:52:01,846 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:52:01,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:52:01,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:52:01,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:52:01,847 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:52:01,847 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:52:01,847 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:52:01,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:52:01,847 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:52:01,848 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 13:52:01,848 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 13:52:01,848 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:52:01,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:52:01,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:52:01,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:52:01,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:52:01,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:52:01,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:52:01,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:52:01,850 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 13:52:01,850 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 13:52:01,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 13:52:01,851 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2022-11-21 13:52:02,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:52:02,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:52:02,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:52:02,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:52:02,281 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:52:02,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-11-21 13:52:05,498 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:52:05,855 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:52:05,856 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-11-21 13:52:05,885 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/data/304caa025/f687813b900047e4b00b3363757632e0/FLAG2ee9044e3 [2022-11-21 13:52:05,899 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/data/304caa025/f687813b900047e4b00b3363757632e0 [2022-11-21 13:52:05,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:52:05,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:52:05,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:52:05,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:52:05,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:52:05,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:52:05" (1/1) ... [2022-11-21 13:52:05,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c10e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:05, skipping insertion in model container [2022-11-21 13:52:05,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:52:05" (1/1) ... [2022-11-21 13:52:05,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:52:05,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:52:06,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:52:06,246 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:52:06,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:52:06,364 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:52:06,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06 WrapperNode [2022-11-21 13:52:06,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:52:06,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:52:06,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:52:06,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:52:06,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,467 INFO L138 Inliner]: procedures = 117, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2022-11-21 13:52:06,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:52:06,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:52:06,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:52:06,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:52:06,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,572 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:52:06,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:52:06,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:52:06,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:52:06,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (1/1) ... [2022-11-21 13:52:06,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:52:06,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:52:06,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:52:06,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:52:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-21 13:52:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-21 13:52:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:52:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:52:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:52:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:52:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:52:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:52:06,850 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:52:06,852 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:52:06,896 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-21 13:52:07,526 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:52:07,535 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:52:07,543 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 13:52:07,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:52:07 BoogieIcfgContainer [2022-11-21 13:52:07,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:52:07,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:52:07,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:52:07,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:52:07,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:52:05" (1/3) ... [2022-11-21 13:52:07,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34af126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:52:07, skipping insertion in model container [2022-11-21 13:52:07,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:52:06" (2/3) ... [2022-11-21 13:52:07,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34af126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:52:07, skipping insertion in model container [2022-11-21 13:52:07,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:52:07" (3/3) ... [2022-11-21 13:52:07,576 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2022-11-21 13:52:07,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:52:07,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-21 13:52:07,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:52:07,678 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6c05218e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:52:07,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-11-21 13:52:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:52:07,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:07,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:52:07,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:07,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-11-21 13:52:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:07,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649776735] [2022-11-21 13:52:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:07,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:07,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:07,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:07,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-21 13:52:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:07,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 13:52:07,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:07,912 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 7 [2022-11-21 13:52:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:07,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:07,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:07,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649776735] [2022-11-21 13:52:07,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649776735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:07,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:07,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:52:07,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310897871] [2022-11-21 13:52:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:07,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:52:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:07,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:52:07,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:07,975 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:08,207 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2022-11-21 13:52:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:52:08,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-11-21 13:52:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:08,218 INFO L225 Difference]: With dead ends: 136 [2022-11-21 13:52:08,219 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 13:52:08,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:08,224 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:08,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:52:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 13:52:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-21 13:52:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2022-11-21 13:52:08,287 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2022-11-21 13:52:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:08,288 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2022-11-21 13:52:08,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2022-11-21 13:52:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:52:08,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:08,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:52:08,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:08,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:08,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-11-21 13:52:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:08,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348978816] [2022-11-21 13:52:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:08,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:08,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:08,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:08,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-21 13:52:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:08,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:52:08,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:08,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:52:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:08,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:08,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348978816] [2022-11-21 13:52:08,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348978816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:08,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:08,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:52:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365488312] [2022-11-21 13:52:08,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:08,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:52:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:08,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:52:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:08,658 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:08,782 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-21 13:52:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:52:08,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-11-21 13:52:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:08,786 INFO L225 Difference]: With dead ends: 127 [2022-11-21 13:52:08,786 INFO L226 Difference]: Without dead ends: 127 [2022-11-21 13:52:08,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:08,788 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:08,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:52:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-21 13:52:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-21 13:52:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-21 13:52:08,813 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2022-11-21 13:52:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:08,813 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-21 13:52:08,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-21 13:52:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:52:08,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:08,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:08,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:09,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:09,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-11-21 13:52:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:09,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885539718] [2022-11-21 13:52:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:09,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:09,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:09,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-21 13:52:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:09,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:52:09,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:09,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:09,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:09,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885539718] [2022-11-21 13:52:09,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885539718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:09,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:09,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:52:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029096685] [2022-11-21 13:52:09,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:09,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:52:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:09,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:52:09,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:09,151 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:09,185 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-11-21 13:52:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:52:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-21 13:52:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:09,188 INFO L225 Difference]: With dead ends: 136 [2022-11-21 13:52:09,193 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 13:52:09,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:09,195 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:09,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:52:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 13:52:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2022-11-21 13:52:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-11-21 13:52:09,221 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2022-11-21 13:52:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:09,222 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-11-21 13:52:09,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-11-21 13:52:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:52:09,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:09,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:09,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-21 13:52:09,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:09,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-11-21 13:52:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043166592] [2022-11-21 13:52:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:09,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:09,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:09,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:09,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-21 13:52:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:09,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 13:52:09,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:09,546 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 7 [2022-11-21 13:52:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:09,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:09,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:09,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043166592] [2022-11-21 13:52:09,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043166592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:09,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:09,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:52:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770580149] [2022-11-21 13:52:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:09,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:52:09,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:09,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:52:09,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:09,561 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:09,725 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-21 13:52:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:52:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-21 13:52:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:09,727 INFO L225 Difference]: With dead ends: 127 [2022-11-21 13:52:09,728 INFO L226 Difference]: Without dead ends: 127 [2022-11-21 13:52:09,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:09,730 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:09,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:52:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-21 13:52:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-21 13:52:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-21 13:52:09,741 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2022-11-21 13:52:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:09,741 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-21 13:52:09,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-21 13:52:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:52:09,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:09,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:09,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:09,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:09,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-11-21 13:52:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:09,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7802454] [2022-11-21 13:52:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:09,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:09,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:09,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:09,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-21 13:52:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:10,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:52:10,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:10,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:52:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:10,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:10,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:10,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7802454] [2022-11-21 13:52:10,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7802454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:10,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:10,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:52:10,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840858175] [2022-11-21 13:52:10,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:10,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:52:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:52:10,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:10,083 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:10,157 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2022-11-21 13:52:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:52:10,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-21 13:52:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:10,162 INFO L225 Difference]: With dead ends: 126 [2022-11-21 13:52:10,162 INFO L226 Difference]: Without dead ends: 126 [2022-11-21 13:52:10,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:52:10,163 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:10,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:52:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-21 13:52:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-21 13:52:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-11-21 13:52:10,174 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2022-11-21 13:52:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:10,174 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-11-21 13:52:10,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-11-21 13:52:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:52:10,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:10,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:10,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:10,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:10,385 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:10,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-11-21 13:52:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:10,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685618092] [2022-11-21 13:52:10,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:10,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:10,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:10,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:10,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-21 13:52:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:10,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:52:10,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:10,511 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 7 [2022-11-21 13:52:10,604 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 13:52:10,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:52:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:10,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:10,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:10,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685618092] [2022-11-21 13:52:10,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685618092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:10,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:10,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:52:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794556579] [2022-11-21 13:52:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:10,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:52:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:52:10,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:52:10,653 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:10,905 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-11-21 13:52:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:52:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 13:52:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:10,907 INFO L225 Difference]: With dead ends: 130 [2022-11-21 13:52:10,907 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 13:52:10,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:52:10,909 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 76 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:10,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 219 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:52:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 13:52:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-21 13:52:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2022-11-21 13:52:10,931 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2022-11-21 13:52:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:10,932 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2022-11-21 13:52:10,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-11-21 13:52:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:52:10,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:10,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:10,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-21 13:52:11,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:11,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-11-21 13:52:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:11,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538180447] [2022-11-21 13:52:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:11,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:11,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:11,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:11,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-21 13:52:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:11,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:52:11,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:11,263 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 7 [2022-11-21 13:52:11,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:52:11,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:11,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:52:11,401 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:52:11,401 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 13 treesize of output 13 [2022-11-21 13:52:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:11,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:11,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:11,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538180447] [2022-11-21 13:52:11,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538180447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:11,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:11,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:52:11,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144385171] [2022-11-21 13:52:11,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:11,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:52:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:11,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:52:11,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:52:11,457 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:11,767 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-11-21 13:52:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:52:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 13:52:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:11,768 INFO L225 Difference]: With dead ends: 130 [2022-11-21 13:52:11,769 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 13:52:11,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:52:11,770 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 48 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:11,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 338 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:52:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 13:52:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-21 13:52:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-11-21 13:52:11,776 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2022-11-21 13:52:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:11,777 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-11-21 13:52:11,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-11-21 13:52:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:52:11,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:11,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:11,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-21 13:52:11,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:11,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:11,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-11-21 13:52:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:11,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242416153] [2022-11-21 13:52:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:11,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:11,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:11,998 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:12,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-21 13:52:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:12,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:52:12,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:12,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:12,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:12,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242416153] [2022-11-21 13:52:12,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242416153] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:12,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:12,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-21 13:52:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072888974] [2022-11-21 13:52:12,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:12,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:52:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:52:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:52:12,217 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:12,247 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-11-21 13:52:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:52:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 14 [2022-11-21 13:52:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:12,249 INFO L225 Difference]: With dead ends: 137 [2022-11-21 13:52:12,249 INFO L226 Difference]: Without dead ends: 137 [2022-11-21 13:52:12,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:52:12,255 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 25 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:12,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 501 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:52:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-21 13:52:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2022-11-21 13:52:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-11-21 13:52:12,277 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 14 [2022-11-21 13:52:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:12,280 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-11-21 13:52:12,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-11-21 13:52:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:52:12,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:12,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:12,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:12,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:12,493 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-11-21 13:52:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4402387] [2022-11-21 13:52:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:12,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:12,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:12,496 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:12,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-21 13:52:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:12,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:52:12,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:12,627 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 7 [2022-11-21 13:52:12,681 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 13:52:12,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:52:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:12,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:12,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:12,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4402387] [2022-11-21 13:52:12,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4402387] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:12,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:12,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-11-21 13:52:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625233829] [2022-11-21 13:52:12,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:12,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:52:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:52:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:52:12,750 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:12,924 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-11-21 13:52:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:52:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-11-21 13:52:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:12,925 INFO L225 Difference]: With dead ends: 129 [2022-11-21 13:52:12,925 INFO L226 Difference]: Without dead ends: 129 [2022-11-21 13:52:12,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:52:12,926 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:12,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 222 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:52:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-21 13:52:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-21 13:52:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-11-21 13:52:12,930 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 15 [2022-11-21 13:52:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:12,930 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-11-21 13:52:12,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-11-21 13:52:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:52:12,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:12,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:12,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:13,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:13,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:13,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-11-21 13:52:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:13,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110405113] [2022-11-21 13:52:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:13,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:13,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:13,144 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:13,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-21 13:52:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:13,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:52:13,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:13,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:52:13,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-21 13:52:13,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:13,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:52:13,407 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:52:13,408 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 13 treesize of output 13 [2022-11-21 13:52:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:13,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:17,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:17,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110405113] [2022-11-21 13:52:17,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110405113] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:17,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:17,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-11-21 13:52:17,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328014002] [2022-11-21 13:52:17,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:17,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:52:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:52:17,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:52:17,968 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:18,610 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-21 13:52:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:52:18,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 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) Word has length 15 [2022-11-21 13:52:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:18,612 INFO L225 Difference]: With dead ends: 127 [2022-11-21 13:52:18,612 INFO L226 Difference]: Without dead ends: 127 [2022-11-21 13:52:18,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:52:18,613 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 151 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:18,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 337 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:52:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-21 13:52:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-21 13:52:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-21 13:52:18,617 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2022-11-21 13:52:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:18,617 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-21 13:52:18,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-21 13:52:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:52:18,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:18,618 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:18,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:18,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:18,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-11-21 13:52:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:18,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932704107] [2022-11-21 13:52:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:18,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:18,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:18,822 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:18,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-21 13:52:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:18,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 13:52:18,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:18,966 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 7 [2022-11-21 13:52:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:52:19,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:19,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:19,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932704107] [2022-11-21 13:52:19,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932704107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:19,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:19,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:52:19,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12421995] [2022-11-21 13:52:19,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:19,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:52:19,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:52:19,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:52:19,034 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:19,364 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-11-21 13:52:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:52:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-11-21 13:52:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:19,366 INFO L225 Difference]: With dead ends: 124 [2022-11-21 13:52:19,366 INFO L226 Difference]: Without dead ends: 124 [2022-11-21 13:52:19,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:52:19,367 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 107 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:19,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 325 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:52:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-21 13:52:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-11-21 13:52:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-11-21 13:52:19,371 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2022-11-21 13:52:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:19,372 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-11-21 13:52:19,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-11-21 13:52:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:52:19,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:19,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:19,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:19,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:19,582 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:19,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-11-21 13:52:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:19,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224471841] [2022-11-21 13:52:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:19,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:19,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:19,587 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:19,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-21 13:52:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:19,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:52:19,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:19,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:52:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:52:19,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:19,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:19,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224471841] [2022-11-21 13:52:19,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224471841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:19,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:19,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:52:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317718390] [2022-11-21 13:52:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:52:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:52:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:52:19,899 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:20,194 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-11-21 13:52:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:52:20,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-11-21 13:52:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:20,196 INFO L225 Difference]: With dead ends: 117 [2022-11-21 13:52:20,196 INFO L226 Difference]: Without dead ends: 117 [2022-11-21 13:52:20,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:52:20,197 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:20,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 95 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:52:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-21 13:52:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-21 13:52:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2022-11-21 13:52:20,200 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2022-11-21 13:52:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:20,201 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2022-11-21 13:52:20,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-11-21 13:52:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:52:20,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:20,202 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, 1, 1, 1] [2022-11-21 13:52:20,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:20,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:20,402 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:20,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-11-21 13:52:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:20,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941462018] [2022-11-21 13:52:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:20,405 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:20,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-21 13:52:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:20,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 13:52:20,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:52:20,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:20,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:20,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941462018] [2022-11-21 13:52:20,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941462018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:20,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:20,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:52:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89593415] [2022-11-21 13:52:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:20,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:52:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:52:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:52:20,996 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:21,514 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-11-21 13:52:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:52:21,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-11-21 13:52:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:21,516 INFO L225 Difference]: With dead ends: 112 [2022-11-21 13:52:21,516 INFO L226 Difference]: Without dead ends: 112 [2022-11-21 13:52:21,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:52:21,517 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 497 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:21,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 82 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:52:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-21 13:52:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-21 13:52:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-11-21 13:52:21,521 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2022-11-21 13:52:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:21,521 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-11-21 13:52:21,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-11-21 13:52:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:52:21,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:21,522 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, 1, 1, 1] [2022-11-21 13:52:21,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:21,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:21,735 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-11-21 13:52:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:21,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921004656] [2022-11-21 13:52:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:21,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:21,737 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:21,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-21 13:52:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:21,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-21 13:52:21,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:22,004 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 13 treesize of output 9 [2022-11-21 13:52:22,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:52:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:52:22,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:22,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:22,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921004656] [2022-11-21 13:52:22,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921004656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:22,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:22,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:52:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777107690] [2022-11-21 13:52:22,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:22,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:52:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:22,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:52:22,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:52:22,109 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:22,518 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-11-21 13:52:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:52:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 28 [2022-11-21 13:52:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:22,519 INFO L225 Difference]: With dead ends: 107 [2022-11-21 13:52:22,519 INFO L226 Difference]: Without dead ends: 107 [2022-11-21 13:52:22,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:52:22,520 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 552 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:22,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 156 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:52:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-21 13:52:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-21 13:52:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-11-21 13:52:22,524 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2022-11-21 13:52:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:22,524 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-11-21 13:52:22,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-11-21 13:52:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:52:22,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:22,525 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, 1, 1, 1] [2022-11-21 13:52:22,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:22,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:22,726 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:22,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-11-21 13:52:22,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:22,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112401906] [2022-11-21 13:52:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:22,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:22,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:22,729 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:22,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-21 13:52:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:22,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 13:52:22,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:22,928 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 7 [2022-11-21 13:52:23,054 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-21 13:52:23,054 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 20 treesize of output 22 [2022-11-21 13:52:23,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:52:23,164 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 14 treesize of output 16 [2022-11-21 13:52:23,247 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 14 treesize of output 16 [2022-11-21 13:52:23,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:23,293 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 21 treesize of output 20 [2022-11-21 13:52:23,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:52:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:23,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:23,567 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-11-21 13:52:23,581 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2022-11-21 13:52:23,597 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_368) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2022-11-21 13:52:23,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:23,615 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 21 treesize of output 22 [2022-11-21 13:52:23,623 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 60 treesize of output 52 [2022-11-21 13:52:23,630 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 44 [2022-11-21 13:52:23,637 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 22 treesize of output 20 [2022-11-21 13:52:24,078 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 13:52:24,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 27 treesize of output 26 [2022-11-21 13:52:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-21 13:52:24,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:24,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112401906] [2022-11-21 13:52:24,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112401906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:24,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:24,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-11-21 13:52:24,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238657188] [2022-11-21 13:52:24,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:24,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 13:52:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 13:52:24,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=411, Unknown=3, NotChecked=126, Total=600 [2022-11-21 13:52:24,094 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:26,202 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-11-21 13:52:26,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:52:26,207 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 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 28 [2022-11-21 13:52:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:26,207 INFO L225 Difference]: With dead ends: 106 [2022-11-21 13:52:26,207 INFO L226 Difference]: Without dead ends: 106 [2022-11-21 13:52:26,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=242, Invalid=956, Unknown=4, NotChecked=204, Total=1406 [2022-11-21 13:52:26,209 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 749 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 16 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:26,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 429 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 514 Invalid, 7 Unknown, 319 Unchecked, 0.9s Time] [2022-11-21 13:52:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-21 13:52:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-11-21 13:52:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-11-21 13:52:26,212 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2022-11-21 13:52:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:26,212 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-11-21 13:52:26,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-11-21 13:52:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:52:26,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:26,214 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, 1, 1, 1, 1] [2022-11-21 13:52:26,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:26,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:26,414 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-11-21 13:52:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:26,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414233392] [2022-11-21 13:52:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:26,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:26,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:26,419 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:26,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-21 13:52:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:26,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 13:52:26,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:26,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:52:26,889 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 23 treesize of output 11 [2022-11-21 13:52:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:52:26,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:26,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:26,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414233392] [2022-11-21 13:52:26,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414233392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:26,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:26,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:52:26,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879917152] [2022-11-21 13:52:26,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:26,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:52:26,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:26,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:52:26,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:52:26,994 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:28,132 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-11-21 13:52:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:52:28,134 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 29 [2022-11-21 13:52:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:28,134 INFO L225 Difference]: With dead ends: 97 [2022-11-21 13:52:28,134 INFO L226 Difference]: Without dead ends: 97 [2022-11-21 13:52:28,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:52:28,135 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 583 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:28,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 73 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 13:52:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-21 13:52:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-21 13:52:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-11-21 13:52:28,138 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2022-11-21 13:52:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:28,139 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-11-21 13:52:28,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-11-21 13:52:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:52:28,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:28,139 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, 1, 1, 1, 1] [2022-11-21 13:52:28,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:28,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:28,340 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-11-21 13:52:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:28,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087123091] [2022-11-21 13:52:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:28,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:28,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:28,343 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:28,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-21 13:52:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:28,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 13:52:28,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:28,564 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 7 [2022-11-21 13:52:28,706 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-21 13:52:28,707 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 20 treesize of output 22 [2022-11-21 13:52:28,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:52:28,860 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:52:28,860 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-21 13:52:29,002 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 22 treesize of output 22 [2022-11-21 13:52:29,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:29,065 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 29 treesize of output 24 [2022-11-21 13:52:29,231 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 23 treesize of output 11 [2022-11-21 13:52:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:29,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:29,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:29,874 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 21 treesize of output 22 [2022-11-21 13:52:29,877 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 122 treesize of output 110 [2022-11-21 13:52:29,897 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 98 [2022-11-21 13:52:29,906 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 51 treesize of output 47 [2022-11-21 13:52:30,480 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 13:52:30,481 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 27 treesize of output 26 [2022-11-21 13:52:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:30,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:30,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087123091] [2022-11-21 13:52:30,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087123091] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:30,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:30,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-11-21 13:52:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54017739] [2022-11-21 13:52:30,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:30,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 13:52:30,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 13:52:30,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=509, Unknown=25, NotChecked=0, Total=600 [2022-11-21 13:52:30,493 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:34,085 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-11-21 13:52:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:52:34,086 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 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 29 [2022-11-21 13:52:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:34,087 INFO L225 Difference]: With dead ends: 96 [2022-11-21 13:52:34,087 INFO L226 Difference]: Without dead ends: 96 [2022-11-21 13:52:34,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=251, Invalid=1053, Unknown=28, NotChecked=0, Total=1332 [2022-11-21 13:52:34,089 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 690 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:34,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 289 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-21 13:52:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-21 13:52:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-11-21 13:52:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-11-21 13:52:34,094 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 29 [2022-11-21 13:52:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:34,094 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-11-21 13:52:34,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-11-21 13:52:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:52:34,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:34,095 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, 1, 1, 1, 1, 1] [2022-11-21 13:52:34,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-11-21 13:52:34,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:34,315 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:34,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-11-21 13:52:34,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:34,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842837826] [2022-11-21 13:52:34,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:34,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:34,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:34,318 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:34,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-21 13:52:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:34,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:52:34,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:34,538 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 13 treesize of output 9 [2022-11-21 13:52:34,605 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 19 treesize of output 11 [2022-11-21 13:52:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:52:34,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:52:34,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:34,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842837826] [2022-11-21 13:52:34,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842837826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:52:34,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:52:34,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:52:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318240405] [2022-11-21 13:52:34,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:52:34,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:52:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:52:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:52:34,662 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:35,310 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-11-21 13:52:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:52:35,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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) Word has length 30 [2022-11-21 13:52:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:35,311 INFO L225 Difference]: With dead ends: 91 [2022-11-21 13:52:35,311 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 13:52:35,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:52:35,312 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 217 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:35,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 280 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:52:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 13:52:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-21 13:52:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2022-11-21 13:52:35,319 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 30 [2022-11-21 13:52:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:35,319 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2022-11-21 13:52:35,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2022-11-21 13:52:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:52:35,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:35,320 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, 1, 1, 1, 1, 1] [2022-11-21 13:52:35,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:35,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:35,537 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:35,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-11-21 13:52:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:35,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439842740] [2022-11-21 13:52:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:35,539 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:35,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-21 13:52:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:35,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 13:52:35,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:35,730 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 7 [2022-11-21 13:52:35,833 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-21 13:52:35,834 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 20 treesize of output 22 [2022-11-21 13:52:35,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:52:35,940 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:52:35,941 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-21 13:52:36,043 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 26 treesize of output 26 [2022-11-21 13:52:36,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:36,098 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 33 treesize of output 28 [2022-11-21 13:52:36,211 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 27 treesize of output 15 [2022-11-21 13:52:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:36,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:38,500 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-21 13:52:38,524 INFO L321 Elim1Store]: treesize reduction 7, result has 65.0 percent of original size [2022-11-21 13:52:38,525 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 26 treesize of output 25 [2022-11-21 13:52:38,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:38,629 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 21 treesize of output 22 [2022-11-21 13:52:38,635 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 122 treesize of output 110 [2022-11-21 13:52:38,655 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 90 treesize of output 82 [2022-11-21 13:52:38,662 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 43 treesize of output 39 [2022-11-21 13:52:38,914 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 13:52:38,915 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 33 treesize of output 32 [2022-11-21 13:52:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 13:52:38,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:38,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439842740] [2022-11-21 13:52:38,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439842740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:38,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:38,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2022-11-21 13:52:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620824481] [2022-11-21 13:52:38,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:38,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 13:52:38,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:38,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 13:52:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=400, Unknown=10, NotChecked=40, Total=506 [2022-11-21 13:52:38,931 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:41,417 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-11-21 13:52:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:52:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-21 13:52:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:41,418 INFO L225 Difference]: With dead ends: 94 [2022-11-21 13:52:41,418 INFO L226 Difference]: Without dead ends: 94 [2022-11-21 13:52:41,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=201, Invalid=849, Unknown=10, NotChecked=62, Total=1122 [2022-11-21 13:52:41,420 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 150 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:41,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 761 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 762 Invalid, 0 Unknown, 72 Unchecked, 1.3s Time] [2022-11-21 13:52:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-21 13:52:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-11-21 13:52:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-21 13:52:41,436 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 30 [2022-11-21 13:52:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:41,436 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-21 13:52:41,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-21 13:52:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 13:52:41,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:41,438 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:41,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:41,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:41,642 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-11-21 13:52:41,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:41,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107944116] [2022-11-21 13:52:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:41,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:41,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:41,645 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:41,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-21 13:52:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:41,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:52:41,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:41,903 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:52:41,903 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 19 treesize of output 27 [2022-11-21 13:52:42,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:52:42,158 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 27 treesize of output 15 [2022-11-21 13:52:42,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:52:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:42,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:42,803 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 13:52:42,803 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 16 treesize of output 15 [2022-11-21 13:52:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:42,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:42,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107944116] [2022-11-21 13:52:42,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107944116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:42,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:42,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-11-21 13:52:42,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794681972] [2022-11-21 13:52:42,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:42,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 13:52:42,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:42,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 13:52:42,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-11-21 13:52:42,818 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:44,542 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-11-21 13:52:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:52:44,542 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 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 33 [2022-11-21 13:52:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:44,543 INFO L225 Difference]: With dead ends: 89 [2022-11-21 13:52:44,543 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 13:52:44,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2022-11-21 13:52:44,545 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 270 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:44,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 330 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 13:52:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 13:52:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-21 13:52:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-11-21 13:52:44,549 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 33 [2022-11-21 13:52:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:44,550 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-11-21 13:52:44,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-11-21 13:52:44,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 13:52:44,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:44,551 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:44,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:44,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:44,762 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:44,763 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-11-21 13:52:44,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:44,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124018271] [2022-11-21 13:52:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:44,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:44,765 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:44,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-21 13:52:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:44,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 13:52:44,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:44,962 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 7 [2022-11-21 13:52:45,051 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-21 13:52:45,051 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 20 treesize of output 22 [2022-11-21 13:52:45,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:52:45,164 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:52:45,165 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-21 13:52:45,297 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 26 treesize of output 26 [2022-11-21 13:52:45,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:45,357 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 33 treesize of output 28 [2022-11-21 13:52:45,511 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 27 treesize of output 15 [2022-11-21 13:52:45,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:52:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:45,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:46,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:46,380 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 41 treesize of output 47 [2022-11-21 13:52:46,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:46,590 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 21 treesize of output 22 [2022-11-21 13:52:46,595 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 122 treesize of output 110 [2022-11-21 13:52:46,604 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 90 treesize of output 82 [2022-11-21 13:52:46,611 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 43 treesize of output 39 [2022-11-21 13:52:46,663 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:52:46,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 1 [2022-11-21 13:52:46,888 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 13:52:46,889 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 33 treesize of output 32 [2022-11-21 13:52:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:46,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:46,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124018271] [2022-11-21 13:52:46,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124018271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:46,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:46,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-11-21 13:52:46,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845817414] [2022-11-21 13:52:46,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:46,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-21 13:52:46,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:46,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-21 13:52:46,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=488, Unknown=4, NotChecked=0, Total=552 [2022-11-21 13:52:46,902 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:49,579 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-11-21 13:52:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:52:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 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 33 [2022-11-21 13:52:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:49,580 INFO L225 Difference]: With dead ends: 92 [2022-11-21 13:52:49,581 INFO L226 Difference]: Without dead ends: 92 [2022-11-21 13:52:49,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=220, Invalid=1036, Unknown=4, NotChecked=0, Total=1260 [2022-11-21 13:52:49,582 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 188 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:49,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 711 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 13:52:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-21 13:52:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2022-11-21 13:52:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-11-21 13:52:49,587 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 33 [2022-11-21 13:52:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:49,587 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-11-21 13:52:49,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:52:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-11-21 13:52:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:52:49,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:49,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:49,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:49,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:49,798 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:52:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-11-21 13:52:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:49,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169187159] [2022-11-21 13:52:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:49,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:52:49,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:49,801 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:52:49,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-21 13:52:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:49,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 13:52:49,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:49,994 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 7 [2022-11-21 13:52:50,057 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:52:50,057 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 19 treesize of output 27 [2022-11-21 13:52:50,233 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-21 13:52:50,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-21 13:52:50,336 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 11 treesize of output 7 [2022-11-21 13:52:50,457 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:52:50,458 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-21 13:52:50,626 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 34 treesize of output 32 [2022-11-21 13:52:50,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:50,668 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 41 treesize of output 32 [2022-11-21 13:52:51,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:51,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 33 [2022-11-21 13:52:51,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 13:52:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:52:51,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:52,083 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_695 (_ BitVec 1)) (v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_695) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-21 13:52:52,104 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_695 (_ BitVec 1)) (v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_695) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-21 13:52:54,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:54,223 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 28 treesize of output 29 [2022-11-21 13:52:54,228 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 178 treesize of output 166 [2022-11-21 13:52:54,234 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 162 treesize of output 154 [2022-11-21 13:52:54,239 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 154 treesize of output 150 [2022-11-21 13:53:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 13:53:55,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:53:55,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169187159] [2022-11-21 13:53:55,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169187159] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:53:55,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:53:55,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2022-11-21 13:53:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980123969] [2022-11-21 13:53:55,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:53:55,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-21 13:53:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:53:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-21 13:53:55,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=985, Unknown=12, NotChecked=130, Total=1260 [2022-11-21 13:53:55,208 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:54:07,280 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-11-21 13:54:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:54:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 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 34 [2022-11-21 13:54:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:54:07,284 INFO L225 Difference]: With dead ends: 91 [2022-11-21 13:54:07,284 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 13:54:07,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 71.8s TimeCoverageRelationStatistics Valid=431, Invalid=2014, Unknown=13, NotChecked=194, Total=2652 [2022-11-21 13:54:07,286 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 317 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:54:07,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 571 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1017 Invalid, 1 Unknown, 151 Unchecked, 3.8s Time] [2022-11-21 13:54:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 13:54:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2022-11-21 13:54:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2022-11-21 13:54:07,290 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 34 [2022-11-21 13:54:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:54:07,290 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2022-11-21 13:54:07,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-11-21 13:54:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:54:07,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:54:07,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:54:07,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-21 13:54:07,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:54:07,511 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:54:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:54:07,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2022-11-21 13:54:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:54:07,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766266032] [2022-11-21 13:54:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:54:07,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:54:07,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:54:07,513 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:54:07,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-21 13:54:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:54:07,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:54:07,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:54:07,767 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:54:07,767 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 19 treesize of output 27 [2022-11-21 13:54:07,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:54:08,064 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 27 treesize of output 15 [2022-11-21 13:54:08,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 13:54:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:54:08,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:54:08,874 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 13:54:08,875 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 16 treesize of output 15 [2022-11-21 13:54:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:54:08,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:54:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766266032] [2022-11-21 13:54:08,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766266032] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:54:08,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:54:08,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-11-21 13:54:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179580432] [2022-11-21 13:54:08,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:54:08,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 13:54:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:54:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 13:54:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-11-21 13:54:08,889 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:54:10,995 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-11-21 13:54:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:54:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 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 34 [2022-11-21 13:54:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:54:10,997 INFO L225 Difference]: With dead ends: 86 [2022-11-21 13:54:10,997 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 13:54:10,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2022-11-21 13:54:10,998 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 141 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:54:10,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 469 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-21 13:54:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 13:54:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-21 13:54:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-21 13:54:11,002 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 34 [2022-11-21 13:54:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:54:11,002 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-21 13:54:11,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-21 13:54:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:54:11,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:54:11,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:54:11,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-21 13:54:11,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:54:11,206 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:54:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:54:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-11-21 13:54:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:54:11,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003207500] [2022-11-21 13:54:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:54:11,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:54:11,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:54:11,208 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:54:11,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-21 13:54:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:54:11,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-21 13:54:11,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:54:11,435 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 7 [2022-11-21 13:54:11,511 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:54:11,512 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 19 treesize of output 27 [2022-11-21 13:54:11,687 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-21 13:54:11,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 13:54:11,764 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 11 treesize of output 7 [2022-11-21 13:54:11,844 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:54:11,844 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-21 13:54:12,010 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 23 treesize of output 23 [2022-11-21 13:54:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:12,089 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 30 treesize of output 25 [2022-11-21 13:54:12,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:12,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2022-11-21 13:54:12,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:54:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:54:12,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:54:13,445 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 8 treesize of output 6 [2022-11-21 13:54:13,692 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-11-21 13:54:13,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:13,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 13:54:13,708 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 65 treesize of output 57 [2022-11-21 13:54:13,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:54:13,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:54:13,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:54:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 13:54:26,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:54:26,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003207500] [2022-11-21 13:54:26,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003207500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:54:26,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:54:26,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2022-11-21 13:54:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704361004] [2022-11-21 13:54:26,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:54:26,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 13:54:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:54:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 13:54:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=929, Unknown=18, NotChecked=62, Total=1122 [2022-11-21 13:54:26,532 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:54:31,879 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-11-21 13:54:31,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 13:54:31,880 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 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 34 [2022-11-21 13:54:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:54:31,881 INFO L225 Difference]: With dead ends: 87 [2022-11-21 13:54:31,881 INFO L226 Difference]: Without dead ends: 87 [2022-11-21 13:54:31,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=420, Invalid=1822, Unknown=18, NotChecked=92, Total=2352 [2022-11-21 13:54:31,882 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 392 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:54:31,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 329 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 700 Invalid, 0 Unknown, 87 Unchecked, 1.9s Time] [2022-11-21 13:54:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-21 13:54:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-11-21 13:54:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-21 13:54:31,885 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 34 [2022-11-21 13:54:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:54:31,886 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-21 13:54:31,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-21 13:54:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:54:31,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:54:31,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:54:31,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-21 13:54:32,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:54:32,094 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:54:32,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:54:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-11-21 13:54:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:54:32,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154878879] [2022-11-21 13:54:32,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:54:32,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:54:32,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:54:32,098 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:54:32,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-21 13:54:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:54:32,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-21 13:54:32,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:54:32,289 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 7 [2022-11-21 13:54:32,405 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-21 13:54:32,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-21 13:54:32,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:54:32,611 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:54:32,611 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-21 13:54:32,790 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 26 treesize of output 26 [2022-11-21 13:54:32,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:32,866 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 33 treesize of output 28 [2022-11-21 13:54:33,009 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 27 treesize of output 15 [2022-11-21 13:54:33,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 13:54:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:54:33,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:54:33,612 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_839) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_842) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)))) is different from false [2022-11-21 13:54:33,628 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_839) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (_ bv1 1)))) is different from false [2022-11-21 13:54:33,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:33,744 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 28 treesize of output 29 [2022-11-21 13:54:33,749 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 88 treesize of output 80 [2022-11-21 13:54:33,753 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 76 treesize of output 72 [2022-11-21 13:54:33,768 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 34 [2022-11-21 13:54:34,487 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 13:54:34,487 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 33 treesize of output 32 [2022-11-21 13:54:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 13:54:34,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:54:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154878879] [2022-11-21 13:54:34,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154878879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:54:34,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:54:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-11-21 13:54:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725232054] [2022-11-21 13:54:34,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:54:34,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 13:54:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:54:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 13:54:34,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=474, Unknown=7, NotChecked=90, Total=650 [2022-11-21 13:54:34,498 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:54:37,440 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-11-21 13:54:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:54:37,441 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 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 34 [2022-11-21 13:54:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:54:37,442 INFO L225 Difference]: With dead ends: 86 [2022-11-21 13:54:37,442 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 13:54:37,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=207, Invalid=916, Unknown=7, NotChecked=130, Total=1260 [2022-11-21 13:54:37,443 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 177 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:54:37,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 611 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 701 Invalid, 0 Unknown, 127 Unchecked, 1.7s Time] [2022-11-21 13:54:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 13:54:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-11-21 13:54:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.12987012987013) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-21 13:54:37,448 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 34 [2022-11-21 13:54:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:54:37,449 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-21 13:54:37,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:54:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-21 13:54:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 13:54:37,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:54:37,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:54:37,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-21 13:54:37,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:54:37,658 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:54:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:54:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-11-21 13:54:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:54:37,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973659252] [2022-11-21 13:54:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:54:37,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:54:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:54:37,660 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:54:37,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-21 13:54:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:54:37,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 13:54:37,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:54:37,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-21 13:54:37,930 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:54:37,930 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 19 treesize of output 27 [2022-11-21 13:54:38,091 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-21 13:54:38,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 13:54:38,157 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 11 treesize of output 7 [2022-11-21 13:54:38,243 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:54:38,243 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-21 13:54:38,416 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 34 treesize of output 32 [2022-11-21 13:54:38,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:38,448 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 41 treesize of output 32 [2022-11-21 13:54:38,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:38,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2022-11-21 13:54:39,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2022-11-21 13:54:39,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:54:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:54:39,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:54:40,344 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_894 (_ BitVec 1)) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_894) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) (forall ((v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2022-11-21 13:54:40,368 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_894 (_ BitVec 1)) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_894) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) (forall ((v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2022-11-21 13:54:40,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:40,397 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 76 treesize of output 82 [2022-11-21 13:54:40,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:40,669 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 22 treesize of output 23 [2022-11-21 13:54:40,675 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 131 treesize of output 119 [2022-11-21 13:54:40,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:54:40,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:54:40,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:54:40,712 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:54:40,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 21 treesize of output 1 [2022-11-21 13:54:40,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:40,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 23 [2022-11-21 13:54:40,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:54:40,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:54:40,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:54:53,560 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:55:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 13:55:13,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:13,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973659252] [2022-11-21 13:55:13,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973659252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:13,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:13,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2022-11-21 13:55:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362611618] [2022-11-21 13:55:13,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:13,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-21 13:55:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:13,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-21 13:55:13,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=8, NotChecked=130, Total=1260 [2022-11-21 13:55:13,774 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:20,466 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-11-21 13:55:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 13:55:20,467 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 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 36 [2022-11-21 13:55:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:20,467 INFO L225 Difference]: With dead ends: 84 [2022-11-21 13:55:20,467 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 13:55:20,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=391, Invalid=1960, Unknown=9, NotChecked=190, Total=2550 [2022-11-21 13:55:20,469 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 224 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:20,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 605 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1107 Invalid, 3 Unknown, 135 Unchecked, 2.9s Time] [2022-11-21 13:55:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 13:55:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2022-11-21 13:55:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.103896103896104) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-21 13:55:20,472 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 36 [2022-11-21 13:55:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:20,473 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-21 13:55:20,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-21 13:55:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 13:55:20,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:20,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:20,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:20,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:20,678 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:55:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1472889600, now seen corresponding path program 1 times [2022-11-21 13:55:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:20,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950043589] [2022-11-21 13:55:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:20,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:20,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:20,681 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:20,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-21 13:55:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:20,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 13:55:20,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:20,876 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 7 [2022-11-21 13:55:21,002 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-21 13:55:21,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-21 13:55:21,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:55:21,211 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:55:21,212 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-21 13:55:21,365 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 26 treesize of output 26 [2022-11-21 13:55:21,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:21,401 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 33 treesize of output 28 [2022-11-21 13:55:21,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2022-11-21 13:55:22,158 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-11-21 13:55:22,158 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 28 treesize of output 41 [2022-11-21 13:55:22,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:55:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:22,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:23,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:55:23,637 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 19 treesize of output 20 [2022-11-21 13:55:23,641 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 33 treesize of output 25 [2022-11-21 13:55:23,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-21 13:55:23,921 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 13:55:23,922 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 33 treesize of output 32 [2022-11-21 13:55:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:23,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:23,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950043589] [2022-11-21 13:55:23,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950043589] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:23,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:23,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2022-11-21 13:55:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192498680] [2022-11-21 13:55:23,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:23,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 13:55:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:23,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 13:55:23,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=824, Unknown=2, NotChecked=0, Total=930 [2022-11-21 13:55:23,931 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:29,352 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-21 13:55:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 13:55:29,353 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 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 37 [2022-11-21 13:55:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:29,354 INFO L225 Difference]: With dead ends: 82 [2022-11-21 13:55:29,354 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 13:55:29,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=331, Invalid=1647, Unknown=2, NotChecked=0, Total=1980 [2022-11-21 13:55:29,355 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 229 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:29,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 472 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-21 13:55:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 13:55:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-11-21 13:55:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.077922077922078) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-21 13:55:29,359 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 37 [2022-11-21 13:55:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:29,359 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-21 13:55:29,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-21 13:55:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 13:55:29,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:29,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:29,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:29,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:29,575 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:55:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash -882633249, now seen corresponding path program 1 times [2022-11-21 13:55:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:29,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249062015] [2022-11-21 13:55:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:29,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:29,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:29,577 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:29,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-21 13:55:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:29,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-21 13:55:29,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:30,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:55:30,163 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:55:30,163 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-21 13:55:30,397 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:55:30,397 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 50 treesize of output 48 [2022-11-21 13:55:30,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:30,441 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 57 treesize of output 48 [2022-11-21 13:55:31,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:55:31,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 43 [2022-11-21 13:55:35,841 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| (_ BitVec 32)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| (_ BitVec 32)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| (_ bv1 1)))) (let ((.cse0 (store .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (= (store (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| (_ bv0 1)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| (_ bv0 1)) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| (_ bv0 1)) |c_#valid|))))) is different from true [2022-11-21 13:55:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:35,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:37,385 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ bv0 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-21 13:55:37,406 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ bv0 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 1)))) is different from false [2022-11-21 13:55:37,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ bv0 1)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 1)))) is different from false [2022-11-21 13:55:37,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:55:37,429 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 36 treesize of output 37 [2022-11-21 13:55:37,433 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 120 treesize of output 112 [2022-11-21 13:55:37,438 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 108 treesize of output 104 [2022-11-21 13:55:37,445 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 52 treesize of output 50 [2022-11-21 13:56:43,174 WARN L233 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 56 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:58:07,904 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_41| (_ BitVec 32)) (v_antiDerIndex_entry0_1 (_ BitVec 32)) (v_arrayElimCell_165 (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| (_ bv1 1)))) (let ((.cse1 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse2 (store (store .cse0 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_41| (_ bv0 1)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ bv0 1)))) (or (not (= (select .cse0 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_41|) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv0 1))) (= (_ bv0 1) (bvadd .cse1 (select (store .cse2 v_arrayElimCell_165 (_ bv0 1)) v_antiDerIndex_entry0_1))) (not (= (_ bv0 1) (bvadd (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv1 1)))) (= (bvadd .cse1 (select (store .cse2 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| (_ bv0 1)) v_antiDerIndex_entry0_1)) (_ bv0 1)))))) is different from false [2022-11-21 13:58:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-21 13:58:07,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:58:07,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249062015] [2022-11-21 13:58:07,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249062015] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:07,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:07,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2022-11-21 13:58:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417978604] [2022-11-21 13:58:07,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:07,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-21 13:58:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:58:07,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-21 13:58:07,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1175, Unknown=64, NotChecked=370, Total=1722 [2022-11-21 13:58:07,950 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:09,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:59:27,832 WARN L233 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 138 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:59:30,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:59:34,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:59:38,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:59:41,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:59:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:41,785 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2022-11-21 13:59:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 13:59:41,785 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-21 13:59:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:41,786 INFO L225 Difference]: With dead ends: 149 [2022-11-21 13:59:41,786 INFO L226 Difference]: Without dead ends: 141 [2022-11-21 13:59:41,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 219.5s TimeCoverageRelationStatistics Valid=323, Invalid=2487, Unknown=72, NotChecked=540, Total=3422 [2022-11-21 13:59:41,788 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 391 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 119 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 579 IncrementalHoareTripleChecker+Unchecked, 31.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:41,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 882 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1443 Invalid, 5 Unknown, 579 Unchecked, 31.0s Time] [2022-11-21 13:59:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-21 13:59:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2022-11-21 13:59:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0842105263157895) internal successors, (103), 95 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-11-21 13:59:41,792 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 38 [2022-11-21 13:59:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:41,792 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-11-21 13:59:41,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.829268292682927) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-11-21 13:59:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 13:59:41,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:41,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:41,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:42,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:59:42,002 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-21 13:59:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash 68066961, now seen corresponding path program 1 times [2022-11-21 13:59:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:59:42,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527973486] [2022-11-21 13:59:42,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:42,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:59:42,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:59:42,004 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:59:42,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cba3053-63d0-4bf8-a6b1-67d2a846d11c/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-21 13:59:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:42,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-21 13:59:42,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:42,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:59:42,694 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:59:42,695 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-21 13:59:42,957 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:59:42,957 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 50 treesize of output 48 [2022-11-21 13:59:42,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:42,991 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 57 treesize of output 48 [2022-11-21 13:59:43,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:43,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 43 [2022-11-21 13:59:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:44,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:49,641 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1055) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ bv0 1)))) is different from false [2022-11-21 13:59:49,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (_ bv0 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1055) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ bv0 1)))) is different from false [2022-11-21 13:59:49,673 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (_ bv0 1)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1053) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1055) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ bv0 1)))) is different from false [2022-11-21 13:59:49,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:49,686 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 36 treesize of output 37 [2022-11-21 13:59:49,690 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 120 treesize of output 112 [2022-11-21 13:59:49,701 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 54 treesize of output 52 [2022-11-21 13:59:49,706 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 102