./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:16:02,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:16:02,877 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-23 21:16:02,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:16:02,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:16:02,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:16:02,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:16:02,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:16:02,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:16:02,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:16:02,912 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:16:02,913 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:16:02,913 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:16:02,914 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:16:02,914 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:16:02,915 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:16:02,915 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:16:02,916 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:16:02,916 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:16:02,917 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:16:02,918 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:16:02,923 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:16:02,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:16:02,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:16:02,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:16:02,925 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:16:02,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:16:02,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:16:02,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:16:02,927 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:16:02,931 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:16:02,932 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:16:02,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:16:02,932 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:16:02,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:16:02,933 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:16:02,933 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:16:02,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:16:02,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:16:02,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:16:02,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:16:02,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:16:02,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:16:02,937 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:16:02,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:16:02,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:16:02,938 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:16:02,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:16:02,938 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/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_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d [2023-11-23 21:16:03,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:16:03,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:16:03,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:16:03,259 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:16:03,260 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:16:03,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2023-11-23 21:16:06,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:16:07,034 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:16:07,034 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2023-11-23 21:16:07,066 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/data/fb3469a17/17574a268afe45e9bb13fa940b5da8d2/FLAGd6b372cc5 [2023-11-23 21:16:07,081 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/data/fb3469a17/17574a268afe45e9bb13fa940b5da8d2 [2023-11-23 21:16:07,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:16:07,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:16:07,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:16:07,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:16:07,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:16:07,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646ec15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07, skipping insertion in model container [2023-11-23 21:16:07,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,158 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:16:07,586 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:16:07,599 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:16:07,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:16:07,704 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:16:07,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07 WrapperNode [2023-11-23 21:16:07,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:16:07,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:16:07,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:16:07,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:16:07,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,775 INFO L138 Inliner]: procedures = 127, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2023-11-23 21:16:07,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:16:07,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:16:07,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:16:07,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:16:07,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:16:07,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:16:07,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:16:07,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:16:07,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (1/1) ... [2023-11-23 21:16:07,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:16:07,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:16:07,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:16:07,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:16:07,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:16:07,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:16:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 21:16:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:16:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:16:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:16:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:16:07,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:16:08,136 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:16:08,140 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:16:08,920 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:16:09,012 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:16:09,012 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-23 21:16:09,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:09 BoogieIcfgContainer [2023-11-23 21:16:09,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:16:09,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:16:09,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:16:09,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:16:09,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:16:07" (1/3) ... [2023-11-23 21:16:09,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7e5a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:16:09, skipping insertion in model container [2023-11-23 21:16:09,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:07" (2/3) ... [2023-11-23 21:16:09,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7e5a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:16:09, skipping insertion in model container [2023-11-23 21:16:09,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:09" (3/3) ... [2023-11-23 21:16:09,027 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_3lvl.i [2023-11-23 21:16:09,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:16:09,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2023-11-23 21:16:09,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:16:09,122 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;@7295604a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:16:09,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-11-23 21:16:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 60 states have (on average 2.6166666666666667) internal successors, (157), 145 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:16:09,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:09,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:16:09,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:09,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:09,144 INFO L85 PathProgramCache]: Analyzing trace with hash 9428, now seen corresponding path program 1 times [2023-11-23 21:16:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:09,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876480042] [2023-11-23 21:16:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:09,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:09,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:09,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876480042] [2023-11-23 21:16:09,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876480042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:09,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:16:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255170055] [2023-11-23 21:16:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:09,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:16:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:09,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:16:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:16:09,652 INFO L87 Difference]: Start difference. First operand has 146 states, 60 states have (on average 2.6166666666666667) internal successors, (157), 145 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:09,958 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2023-11-23 21:16:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:16:09,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-23 21:16:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:09,986 INFO L225 Difference]: With dead ends: 137 [2023-11-23 21:16:09,987 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 21:16:09,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:16:09,996 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:09,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 147 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 21:16:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 21:16:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 60 states have (on average 2.3666666666666667) internal successors, (142), 135 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2023-11-23 21:16:10,063 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 2 [2023-11-23 21:16:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:10,064 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2023-11-23 21:16:10,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2023-11-23 21:16:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:16:10,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:10,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:16:10,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:16:10,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:10,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 9429, now seen corresponding path program 1 times [2023-11-23 21:16:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:10,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750690146] [2023-11-23 21:16:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:10,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750690146] [2023-11-23 21:16:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750690146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:10,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:10,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:16:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20242420] [2023-11-23 21:16:10,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:10,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:16:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:16:10,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:16:10,335 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:10,549 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2023-11-23 21:16:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:16:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-23 21:16:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:10,552 INFO L225 Difference]: With dead ends: 127 [2023-11-23 21:16:10,552 INFO L226 Difference]: Without dead ends: 127 [2023-11-23 21:16:10,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:16:10,554 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 25 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:10,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 151 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-23 21:16:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-23 21:16:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 60 states have (on average 2.216666666666667) internal successors, (133), 126 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) [2023-11-23 21:16:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2023-11-23 21:16:10,568 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 2 [2023-11-23 21:16:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:10,569 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2023-11-23 21:16:10,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2023-11-23 21:16:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 21:16:10,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:10,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:10,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:16:10,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:10,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1109848928, now seen corresponding path program 1 times [2023-11-23 21:16:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764003366] [2023-11-23 21:16:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:11,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764003366] [2023-11-23 21:16:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764003366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:11,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:16:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785252525] [2023-11-23 21:16:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:11,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:11,047 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:11,360 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2023-11-23 21:16:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:16:11,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-23 21:16:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:11,369 INFO L225 Difference]: With dead ends: 126 [2023-11-23 21:16:11,370 INFO L226 Difference]: Without dead ends: 126 [2023-11-23 21:16:11,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:11,378 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 10 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:11,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 269 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-23 21:16:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-23 21:16:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 60 states have (on average 2.2) internal successors, (132), 125 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) [2023-11-23 21:16:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2023-11-23 21:16:11,407 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2023-11-23 21:16:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:11,408 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2023-11-23 21:16:11,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2023-11-23 21:16:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 21:16:11,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:11,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:11,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:16:11,411 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:11,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1109848929, now seen corresponding path program 1 times [2023-11-23 21:16:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:11,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56696772] [2023-11-23 21:16:11,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:11,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:11,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:11,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56696772] [2023-11-23 21:16:11,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56696772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:11,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:11,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:16:11,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140161557] [2023-11-23 21:16:11,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:11,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:11,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:11,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:11,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:11,825 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:12,171 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2023-11-23 21:16:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:16:12,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-23 21:16:12,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:12,174 INFO L225 Difference]: With dead ends: 125 [2023-11-23 21:16:12,174 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 21:16:12,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:12,176 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 8 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:12,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 248 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 21:16:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-23 21:16:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 60 states have (on average 2.183333333333333) internal successors, (131), 124 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) [2023-11-23 21:16:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2023-11-23 21:16:12,188 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 8 [2023-11-23 21:16:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:12,188 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2023-11-23 21:16:12,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2023-11-23 21:16:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:16:12,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:12,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:12,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:16:12,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:12,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash 45578396, now seen corresponding path program 1 times [2023-11-23 21:16:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:12,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251759596] [2023-11-23 21:16:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:12,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:12,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251759596] [2023-11-23 21:16:12,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251759596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:12,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:12,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269797721] [2023-11-23 21:16:12,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:12,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:12,289 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-23 21:16:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:12,521 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2023-11-23 21:16:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:16:12,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2023-11-23 21:16:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:12,523 INFO L225 Difference]: With dead ends: 124 [2023-11-23 21:16:12,524 INFO L226 Difference]: Without dead ends: 124 [2023-11-23 21:16:12,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:12,525 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 11 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:12,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 347 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-23 21:16:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-23 21:16:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 60 states have (on average 2.1666666666666665) internal successors, (130), 123 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2023-11-23 21:16:12,535 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 9 [2023-11-23 21:16:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:12,535 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2023-11-23 21:16:12,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2023-11-23 21:16:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2023-11-23 21:16:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:16:12,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:12,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:12,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:16:12,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:12,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash 45578397, now seen corresponding path program 1 times [2023-11-23 21:16:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:12,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13097493] [2023-11-23 21:16:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:13,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13097493] [2023-11-23 21:16:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13097493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:16:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055449063] [2023-11-23 21:16:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:13,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:16:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:16:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:13,086 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2023-11-23 21:16:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:13,397 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2023-11-23 21:16:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:16:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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 [2023-11-23 21:16:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:13,399 INFO L225 Difference]: With dead ends: 123 [2023-11-23 21:16:13,399 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 21:16:13,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:13,401 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 12 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:13,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 279 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 21:16:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 21:16:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 60 states have (on average 2.15) internal successors, (129), 122 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) [2023-11-23 21:16:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2023-11-23 21:16:13,409 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 9 [2023-11-23 21:16:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:13,410 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2023-11-23 21:16:13,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2023-11-23 21:16:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2023-11-23 21:16:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 21:16:13,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:13,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:13,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:16:13,411 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:13,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1412930275, now seen corresponding path program 1 times [2023-11-23 21:16:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088612947] [2023-11-23 21:16:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:13,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:13,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088612947] [2023-11-23 21:16:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088612947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:13,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6511713] [2023-11-23 21:16:13,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:13,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:13,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:13,504 INFO L87 Difference]: Start difference. First operand 123 states and 129 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) [2023-11-23 21:16:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:13,700 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2023-11-23 21:16:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:16:13,700 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 [2023-11-23 21:16:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:13,701 INFO L225 Difference]: With dead ends: 122 [2023-11-23 21:16:13,702 INFO L226 Difference]: Without dead ends: 122 [2023-11-23 21:16:13,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:13,704 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:13,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 343 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-23 21:16:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-11-23 21:16:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 121 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2023-11-23 21:16:13,720 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 10 [2023-11-23 21:16:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:13,721 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2023-11-23 21:16:13,721 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) [2023-11-23 21:16:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2023-11-23 21:16:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 21:16:13,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:13,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:13,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:16:13,722 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:13,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1412930276, now seen corresponding path program 1 times [2023-11-23 21:16:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:13,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284161984] [2023-11-23 21:16:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:14,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284161984] [2023-11-23 21:16:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284161984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:14,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:16:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564863044] [2023-11-23 21:16:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:14,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:16:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:16:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:14,282 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) [2023-11-23 21:16:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:14,599 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2023-11-23 21:16:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:16:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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 [2023-11-23 21:16:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:14,601 INFO L225 Difference]: With dead ends: 121 [2023-11-23 21:16:14,601 INFO L226 Difference]: Without dead ends: 121 [2023-11-23 21:16:14,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-23 21:16:14,602 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 8 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:14,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 333 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-23 21:16:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-23 21:16:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 60 states have (on average 2.1166666666666667) internal successors, (127), 120 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2023-11-23 21:16:14,608 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 10 [2023-11-23 21:16:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:14,608 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2023-11-23 21:16:14,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) [2023-11-23 21:16:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2023-11-23 21:16:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 21:16:14,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:14,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:14,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:16:14,616 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:14,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -192751720, now seen corresponding path program 1 times [2023-11-23 21:16:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:14,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137756006] [2023-11-23 21:16:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:15,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:15,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137756006] [2023-11-23 21:16:15,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137756006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:15,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:15,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 21:16:15,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497163981] [2023-11-23 21:16:15,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:15,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 21:16:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:15,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 21:16:15,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:16:15,110 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:15,518 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2023-11-23 21:16:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:16:15,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 [2023-11-23 21:16:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:15,520 INFO L225 Difference]: With dead ends: 120 [2023-11-23 21:16:15,520 INFO L226 Difference]: Without dead ends: 120 [2023-11-23 21:16:15,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-23 21:16:15,522 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 15 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:15,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 447 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:16:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-23 21:16:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-23 21:16:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 60 states have (on average 2.1) internal successors, (126), 119 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2023-11-23 21:16:15,527 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 14 [2023-11-23 21:16:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:15,528 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2023-11-23 21:16:15,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2023-11-23 21:16:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 21:16:15,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:15,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:15,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:16:15,530 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:15,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash -192751719, now seen corresponding path program 1 times [2023-11-23 21:16:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484174654] [2023-11-23 21:16:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:16,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:16,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484174654] [2023-11-23 21:16:16,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484174654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:16,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:16,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 21:16:16,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874616195] [2023-11-23 21:16:16,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:16,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 21:16:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:16,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 21:16:16,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:16:16,232 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:16,679 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2023-11-23 21:16:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:16:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 [2023-11-23 21:16:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:16,681 INFO L225 Difference]: With dead ends: 119 [2023-11-23 21:16:16,681 INFO L226 Difference]: Without dead ends: 119 [2023-11-23 21:16:16,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-23 21:16:16,682 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 15 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:16,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:16:16,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-23 21:16:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-23 21:16:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 118 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2023-11-23 21:16:16,689 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 14 [2023-11-23 21:16:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:16,690 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2023-11-23 21:16:16,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2023-11-23 21:16:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 21:16:16,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:16,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:16,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:16:16,692 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:16,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1680336009, now seen corresponding path program 1 times [2023-11-23 21:16:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636107327] [2023-11-23 21:16:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:16,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:16,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636107327] [2023-11-23 21:16:16,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636107327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:16,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:16,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:16,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604128424] [2023-11-23 21:16:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:16,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:16,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:16,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:16,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:16,830 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) [2023-11-23 21:16:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:17,058 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2023-11-23 21:16:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:16:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 [2023-11-23 21:16:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:17,060 INFO L225 Difference]: With dead ends: 118 [2023-11-23 21:16:17,060 INFO L226 Difference]: Without dead ends: 118 [2023-11-23 21:16:17,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:17,061 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 10 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:17,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 328 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-23 21:16:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-23 21:16:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 60 states have (on average 2.066666666666667) internal successors, (124), 117 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2023-11-23 21:16:17,066 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 15 [2023-11-23 21:16:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:17,066 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2023-11-23 21:16:17,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) [2023-11-23 21:16:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2023-11-23 21:16:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 21:16:17,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:17,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:17,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:16:17,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:17,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:17,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1680336008, now seen corresponding path program 1 times [2023-11-23 21:16:17,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:17,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272896032] [2023-11-23 21:16:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:17,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:17,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272896032] [2023-11-23 21:16:17,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272896032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:17,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:17,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 21:16:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85288442] [2023-11-23 21:16:17,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 21:16:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 21:16:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:16:17,818 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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) [2023-11-23 21:16:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:18,172 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2023-11-23 21:16:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:16:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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 [2023-11-23 21:16:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:18,176 INFO L225 Difference]: With dead ends: 117 [2023-11-23 21:16:18,176 INFO L226 Difference]: Without dead ends: 117 [2023-11-23 21:16:18,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-23 21:16:18,177 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 14 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:18,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 349 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-23 21:16:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-23 21:16:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 60 states have (on average 2.05) internal successors, (123), 116 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2023-11-23 21:16:18,185 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 15 [2023-11-23 21:16:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:18,185 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2023-11-23 21:16:18,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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) [2023-11-23 21:16:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2023-11-23 21:16:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:16:18,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:18,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:18,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:16:18,189 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:18,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:18,189 INFO L85 PathProgramCache]: Analyzing trace with hash -550808709, now seen corresponding path program 1 times [2023-11-23 21:16:18,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:18,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196447310] [2023-11-23 21:16:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:18,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196447310] [2023-11-23 21:16:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196447310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569405599] [2023-11-23 21:16:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:18,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:18,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:18,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:18,301 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:18,509 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2023-11-23 21:16:18,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:16:18,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-23 21:16:18,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:18,511 INFO L225 Difference]: With dead ends: 116 [2023-11-23 21:16:18,511 INFO L226 Difference]: Without dead ends: 116 [2023-11-23 21:16:18,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:18,512 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:18,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 324 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-23 21:16:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-23 21:16:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 2.033333333333333) internal successors, (122), 115 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) [2023-11-23 21:16:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2023-11-23 21:16:18,517 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 16 [2023-11-23 21:16:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:18,518 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2023-11-23 21:16:18,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2023-11-23 21:16:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:16:18,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:18,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:16:18,520 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:18,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -550808708, now seen corresponding path program 1 times [2023-11-23 21:16:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250038939] [2023-11-23 21:16:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:19,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:19,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250038939] [2023-11-23 21:16:19,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250038939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:19,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:19,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 21:16:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220082843] [2023-11-23 21:16:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:19,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 21:16:19,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 21:16:19,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-23 21:16:19,326 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:19,877 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2023-11-23 21:16:19,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 21:16:19,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-23 21:16:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:19,879 INFO L225 Difference]: With dead ends: 115 [2023-11-23 21:16:19,879 INFO L226 Difference]: Without dead ends: 115 [2023-11-23 21:16:19,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-11-23 21:16:19,880 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 8 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:19,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 510 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:16:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-23 21:16:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-23 21:16:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 60 states have (on average 2.0166666666666666) internal successors, (121), 114 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2023-11-23 21:16:19,885 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 16 [2023-11-23 21:16:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:19,885 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2023-11-23 21:16:19,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2023-11-23 21:16:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 21:16:19,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:19,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:19,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:16:19,886 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:19,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1934429764, now seen corresponding path program 1 times [2023-11-23 21:16:19,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:19,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276006079] [2023-11-23 21:16:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:20,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276006079] [2023-11-23 21:16:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276006079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:20,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665219104] [2023-11-23 21:16:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:20,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:20,020 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:20,238 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2023-11-23 21:16:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:16:20,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-23 21:16:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:20,239 INFO L225 Difference]: With dead ends: 141 [2023-11-23 21:16:20,240 INFO L226 Difference]: Without dead ends: 141 [2023-11-23 21:16:20,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:20,241 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 165 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:20,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 127 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-23 21:16:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 113. [2023-11-23 21:16:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 112 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2023-11-23 21:16:20,246 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2023-11-23 21:16:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:20,246 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2023-11-23 21:16:20,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2023-11-23 21:16:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 21:16:20,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:20,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 21:16:20,248 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:20,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1934429765, now seen corresponding path program 1 times [2023-11-23 21:16:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808587259] [2023-11-23 21:16:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:20,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:20,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808587259] [2023-11-23 21:16:20,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808587259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:20,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:20,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292174520] [2023-11-23 21:16:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:20,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:16:20,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:20,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:16:20,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:20,460 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:20,707 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2023-11-23 21:16:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:16:20,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-23 21:16:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:20,713 INFO L225 Difference]: With dead ends: 111 [2023-11-23 21:16:20,713 INFO L226 Difference]: Without dead ends: 111 [2023-11-23 21:16:20,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:20,714 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 164 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:20,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 123 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-23 21:16:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-23 21:16:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 60 states have (on average 1.95) internal successors, (117), 110 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) [2023-11-23 21:16:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2023-11-23 21:16:20,718 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 19 [2023-11-23 21:16:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:20,718 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2023-11-23 21:16:20,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2023-11-23 21:16:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:16:20,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:20,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:20,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:16:20,730 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:20,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -162216799, now seen corresponding path program 1 times [2023-11-23 21:16:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993659848] [2023-11-23 21:16:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:20,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993659848] [2023-11-23 21:16:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993659848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:20,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:20,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357081334] [2023-11-23 21:16:20,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:20,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:20,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:20,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:20,864 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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) [2023-11-23 21:16:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:21,138 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2023-11-23 21:16:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:16:21,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 20 [2023-11-23 21:16:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:21,141 INFO L225 Difference]: With dead ends: 130 [2023-11-23 21:16:21,141 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 21:16:21,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:21,142 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 132 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:21,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 126 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 21:16:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2023-11-23 21:16:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 107 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2023-11-23 21:16:21,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 20 [2023-11-23 21:16:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:21,148 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2023-11-23 21:16:21,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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) [2023-11-23 21:16:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2023-11-23 21:16:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:16:21,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:21,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:21,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 21:16:21,150 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:21,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash -162216798, now seen corresponding path program 1 times [2023-11-23 21:16:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288769278] [2023-11-23 21:16:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:21,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:21,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288769278] [2023-11-23 21:16:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288769278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:21,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:21,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705124637] [2023-11-23 21:16:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:21,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:16:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:16:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:21,365 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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) [2023-11-23 21:16:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:21,640 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2023-11-23 21:16:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:16:21,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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 20 [2023-11-23 21:16:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:21,642 INFO L225 Difference]: With dead ends: 103 [2023-11-23 21:16:21,642 INFO L226 Difference]: Without dead ends: 103 [2023-11-23 21:16:21,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:21,643 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 108 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:21,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 159 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-23 21:16:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-23 21:16:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2023-11-23 21:16:21,647 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 20 [2023-11-23 21:16:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:21,648 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2023-11-23 21:16:21,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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) [2023-11-23 21:16:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2023-11-23 21:16:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:16:21,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:21,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:21,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 21:16:21,649 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:21,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:21,650 INFO L85 PathProgramCache]: Analyzing trace with hash -162213497, now seen corresponding path program 1 times [2023-11-23 21:16:21,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:21,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756235098] [2023-11-23 21:16:21,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:21,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:22,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756235098] [2023-11-23 21:16:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756235098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-23 21:16:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051028038] [2023-11-23 21:16:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:22,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 21:16:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 21:16:22,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-11-23 21:16:22,769 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2023-11-23 21:16:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:23,707 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2023-11-23 21:16:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 21:16:23,707 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 20 [2023-11-23 21:16:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:23,709 INFO L225 Difference]: With dead ends: 152 [2023-11-23 21:16:23,709 INFO L226 Difference]: Without dead ends: 152 [2023-11-23 21:16:23,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2023-11-23 21:16:23,710 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 194 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:23,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 377 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 21:16:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-23 21:16:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 103. [2023-11-23 21:16:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 102 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2023-11-23 21:16:23,716 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 20 [2023-11-23 21:16:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:23,716 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2023-11-23 21:16:23,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2023-11-23 21:16:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2023-11-23 21:16:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:16:23,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:23,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:23,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 21:16:23,719 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:23,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash -162213496, now seen corresponding path program 1 times [2023-11-23 21:16:23,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:23,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362573233] [2023-11-23 21:16:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:25,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:25,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362573233] [2023-11-23 21:16:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362573233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:25,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-23 21:16:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29409206] [2023-11-23 21:16:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:25,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 21:16:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 21:16:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-23 21:16:25,343 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2023-11-23 21:16:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:26,570 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2023-11-23 21:16:26,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 21:16:26,571 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 20 [2023-11-23 21:16:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:26,573 INFO L225 Difference]: With dead ends: 203 [2023-11-23 21:16:26,573 INFO L226 Difference]: Without dead ends: 203 [2023-11-23 21:16:26,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2023-11-23 21:16:26,574 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 215 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:26,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 522 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 21:16:26,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-23 21:16:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 128. [2023-11-23 21:16:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.8222222222222222) internal successors, (164), 127 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2023-11-23 21:16:26,580 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 20 [2023-11-23 21:16:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:26,581 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2023-11-23 21:16:26,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2023-11-23 21:16:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2023-11-23 21:16:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 21:16:26,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:26,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:26,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 21:16:26,583 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:26,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:26,583 INFO L85 PathProgramCache]: Analyzing trace with hash -762265447, now seen corresponding path program 1 times [2023-11-23 21:16:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072805051] [2023-11-23 21:16:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:26,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072805051] [2023-11-23 21:16:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072805051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:26,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:16:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301668865] [2023-11-23 21:16:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:26,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:26,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:26,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:26,708 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:26,817 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2023-11-23 21:16:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:16:26,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-11-23 21:16:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:26,821 INFO L225 Difference]: With dead ends: 127 [2023-11-23 21:16:26,821 INFO L226 Difference]: Without dead ends: 127 [2023-11-23 21:16:26,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:26,822 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 100 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:26,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 191 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:16:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-23 21:16:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-23 21:16:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.8111111111111111) internal successors, (163), 126 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2023-11-23 21:16:26,830 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 23 [2023-11-23 21:16:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:26,830 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2023-11-23 21:16:26,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2023-11-23 21:16:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:16:26,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:26,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:26,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 21:16:26,833 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:26,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2139657141, now seen corresponding path program 1 times [2023-11-23 21:16:26,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:26,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991862609] [2023-11-23 21:16:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:26,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:27,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:27,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991862609] [2023-11-23 21:16:27,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991862609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:27,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:27,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 21:16:27,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561949140] [2023-11-23 21:16:27,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:27,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 21:16:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:27,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 21:16:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 21:16:27,652 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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) [2023-11-23 21:16:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:28,312 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2023-11-23 21:16:28,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 21:16:28,315 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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 24 [2023-11-23 21:16:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:28,316 INFO L225 Difference]: With dead ends: 173 [2023-11-23 21:16:28,316 INFO L226 Difference]: Without dead ends: 173 [2023-11-23 21:16:28,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-11-23 21:16:28,318 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 60 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:28,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 440 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 21:16:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-23 21:16:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 133. [2023-11-23 21:16:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 96 states have (on average 1.78125) internal successors, (171), 132 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2023-11-23 21:16:28,323 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 24 [2023-11-23 21:16:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:28,325 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2023-11-23 21:16:28,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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) [2023-11-23 21:16:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2023-11-23 21:16:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:16:28,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:28,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:28,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-23 21:16:28,330 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:28,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2139657142, now seen corresponding path program 1 times [2023-11-23 21:16:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:28,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161317712] [2023-11-23 21:16:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:29,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:29,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161317712] [2023-11-23 21:16:29,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161317712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:29,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:29,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-23 21:16:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463652707] [2023-11-23 21:16:29,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:29,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 21:16:29,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:29,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 21:16:29,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-23 21:16:29,750 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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) [2023-11-23 21:16:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:30,899 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2023-11-23 21:16:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 21:16:30,900 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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 24 [2023-11-23 21:16:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:30,901 INFO L225 Difference]: With dead ends: 174 [2023-11-23 21:16:30,901 INFO L226 Difference]: Without dead ends: 174 [2023-11-23 21:16:30,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2023-11-23 21:16:30,903 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 63 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:30,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 631 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 21:16:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-23 21:16:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2023-11-23 21:16:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 96 states have (on average 1.7708333333333333) internal successors, (170), 132 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 170 transitions. [2023-11-23 21:16:30,909 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 170 transitions. Word has length 24 [2023-11-23 21:16:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:30,910 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 170 transitions. [2023-11-23 21:16:30,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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) [2023-11-23 21:16:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2023-11-23 21:16:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:16:30,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:30,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:30,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-23 21:16:30,911 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:30,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 895856010, now seen corresponding path program 1 times [2023-11-23 21:16:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:30,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407747387] [2023-11-23 21:16:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:31,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:31,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407747387] [2023-11-23 21:16:31,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407747387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:31,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:31,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:16:31,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939706580] [2023-11-23 21:16:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:31,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:16:31,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:31,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:16:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:16:31,019 INFO L87 Difference]: Start difference. First operand 133 states and 170 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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) [2023-11-23 21:16:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:31,171 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2023-11-23 21:16:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:16:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 24 [2023-11-23 21:16:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:31,173 INFO L225 Difference]: With dead ends: 132 [2023-11-23 21:16:31,173 INFO L226 Difference]: Without dead ends: 132 [2023-11-23 21:16:31,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:31,174 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:31,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 80 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:16:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-23 21:16:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2023-11-23 21:16:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 98 states have (on average 1.6938775510204083) internal successors, (166), 130 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 166 transitions. [2023-11-23 21:16:31,183 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 166 transitions. Word has length 24 [2023-11-23 21:16:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:31,183 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 166 transitions. [2023-11-23 21:16:31,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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) [2023-11-23 21:16:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2023-11-23 21:16:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:16:31,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:31,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:31,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-23 21:16:31,185 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:31,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash 895856011, now seen corresponding path program 1 times [2023-11-23 21:16:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543663085] [2023-11-23 21:16:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:32,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543663085] [2023-11-23 21:16:32,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543663085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:32,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-23 21:16:32,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473537921] [2023-11-23 21:16:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:32,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-23 21:16:32,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-23 21:16:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-11-23 21:16:32,508 INFO L87 Difference]: Start difference. First operand 131 states and 166 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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) [2023-11-23 21:16:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:33,729 INFO L93 Difference]: Finished difference Result 227 states and 248 transitions. [2023-11-23 21:16:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 21:16:33,730 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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 24 [2023-11-23 21:16:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:33,732 INFO L225 Difference]: With dead ends: 227 [2023-11-23 21:16:33,732 INFO L226 Difference]: Without dead ends: 227 [2023-11-23 21:16:33,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-11-23 21:16:33,734 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 308 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:33,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 458 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 21:16:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-23 21:16:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 147. [2023-11-23 21:16:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 114 states have (on average 1.719298245614035) internal successors, (196), 146 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 196 transitions. [2023-11-23 21:16:33,746 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 196 transitions. Word has length 24 [2023-11-23 21:16:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:33,747 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 196 transitions. [2023-11-23 21:16:33,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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) [2023-11-23 21:16:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 196 transitions. [2023-11-23 21:16:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:16:33,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:33,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:33,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-23 21:16:33,750 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-23 21:16:33,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 895862862, now seen corresponding path program 1 times [2023-11-23 21:16:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:33,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139892661] [2023-11-23 21:16:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:36,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139892661] [2023-11-23 21:16:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139892661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:16:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235726119] [2023-11-23 21:16:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:36,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:16:36,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:16:36,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:16:36,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83b3a02-2747-4076-87f5-5f2e2f428581/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:16:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:36,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-23 21:16:36,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:16:36,900 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 21:16:36,901 INFO L378 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 19 treesize of output 18 [2023-11-23 21:16:37,020 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-23 21:16:37,020 INFO L378 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 41 [2023-11-23 21:16:37,046 INFO L378 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 15 treesize of output 1 [2023-11-23 21:16:37,152 INFO L378 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 51 treesize of output 27 [2023-11-23 21:16:37,857 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:16:37,858 INFO L378 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 108 treesize of output 89 [2023-11-23 21:16:37,895 INFO L378 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 24 treesize of output 11 [2023-11-23 21:16:38,056 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:16:38,056 INFO L378 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 101 treesize of output 84 [2023-11-23 21:16:38,083 INFO L378 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 24 treesize of output 11 [2023-11-23 21:16:38,250 INFO L349 Elim1Store]: treesize reduction 74, result has 18.7 percent of original size [2023-11-23 21:16:38,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 63 [2023-11-23 21:16:38,264 INFO L378 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 99 treesize of output 80 [2023-11-23 21:16:38,904 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-11-23 21:16:38,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 131 [2023-11-23 21:16:38,930 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-11-23 21:16:38,931 INFO L378 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 103 treesize of output 80 [2023-11-23 21:16:39,018 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-11-23 21:16:39,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 124 [2023-11-23 21:16:39,039 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-11-23 21:16:39,040 INFO L378 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 103 treesize of output 80 [2023-11-23 21:16:39,127 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-11-23 21:16:39,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 117 [2023-11-23 21:16:39,155 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-11-23 21:16:39,156 INFO L378 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 103 treesize of output 80 [2023-11-23 21:16:39,438 INFO L378 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 90 treesize of output 70 [2023-11-23 21:16:39,941 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-23 21:16:39,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 32 [2023-11-23 21:16:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:40,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:16:40,333 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) 1)) is different from false [2023-11-23 21:16:40,349 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1122) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2023-11-23 21:16:40,367 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1120 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1120) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1121) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1122) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2023-11-23 21:16:40,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1120 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1120) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1121) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1122) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) 1)) is different from false [2023-11-23 21:16:40,397 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1123) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1122) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))) 1)) is different from false [2023-11-23 21:16:40,412 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) 1)) is different from false [2023-11-23 21:16:40,429 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1119) .cse2 v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))) 1)) is different from false [2023-11-23 21:16:40,452 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1117))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1116) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1119) .cse2 v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))) 1)) is different from false [2023-11-23 21:16:40,471 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1114) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1117))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1115) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1116) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1119) .cse2 v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))) 1)) is different from false [2023-11-23 21:16:40,494 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1114) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1117))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1115) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1116) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1119) .cse2 v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))))) 1)) is different from false [2023-11-23 21:16:40,513 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1114) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1117))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1115) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1116) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1119) .cse2 v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))))) 1)) is different from false [2023-11-23 21:16:40,531 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1124 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1117))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1125))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1116) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1119) .cse2 v_ArrVal_1124) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))))) 1)) is different from false [2023-11-23 21:16:40,546 INFO L378 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 1258 treesize of output 1098 [2023-11-23 21:16:40,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:16:40,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 520 treesize of output 336 [2023-11-23 21:16:40,566 INFO L378 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 160 treesize of output 158 [2023-11-23 21:16:40,576 INFO L378 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 161 treesize of output 157 [2023-11-23 21:16:40,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse7 (select .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse16 (= .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse20 (not .cse16)) (.cse5 (select .cse31 .cse6))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_1))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6))) (or (= .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_arrayElimCell_26 Int)) (let ((.cse2 (+ 8 v_arrayElimCell_26))) (or (forall ((v_ArrVal_1125 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1125))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse1 (+ 8 v_arrayElimCell_27))) 1)) (= (select |c_#valid| (select .cse1 .cse2)) 1)))) (not (= (select v_arrayElimArr_1 .cse2) .cse5))))))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse9 (+ 8 v_arrayElimCell_26))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1125 (Array Int Int))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_1))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6) v_ArrVal_1125)))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse8 (+ 8 v_arrayElimCell_27))) 1)) (= (select |c_#valid| (select .cse8 .cse9)) 1) (= (select |c_#valid| (select .cse8 (+ 8 v_arrayElimCell_28))) 1)))) (not (= (select v_arrayElimArr_1 .cse9) .cse5))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse12 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_1))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6) v_ArrVal_1125)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (.cse13 (+ 8 v_arrayElimCell_26))) (or (= (select |c_#valid| (select .cse12 .cse13)) 1) (= (select |c_#valid| (select .cse12 (+ 8 v_arrayElimCell_28))) 1) (not (= (select v_arrayElimArr_1 .cse13) .cse5))))) .cse16) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimCell_27 Int) (v_arrayElimCell_26 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_1))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6))) (or (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse5)) (= .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (= (select |c_#valid| (select (let ((.cse18 (store .cse19 .cse17 v_ArrVal_1125))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1))))) .cse20) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimCell_27 Int) (v_arrayElimCell_26 Int)) (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_1))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6) v_ArrVal_1125)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse21 (+ 8 v_arrayElimCell_28))) 1) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse5)) (= (select |c_#valid| (select .cse21 (+ 8 v_arrayElimCell_27))) 1)))) .cse20) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_1))) (let ((.cse27 (+ 8 v_arrayElimCell_26)) (.cse26 (select (select .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6))) (or (= (select |c_#valid| (select (let ((.cse24 (store .cse25 .cse26 v_ArrVal_1125))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse27)) 1) (not (= (select v_arrayElimArr_1 .cse27) .cse5)) (= .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) .cse16) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_1))) (let ((.cse28 (select (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6))) (or (not (= .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1125 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse29 (store .cse30 .cse28 v_ArrVal_1125))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_28))) 1)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse5))))))))))) is different from false [2023-11-23 21:16:41,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse7 (select .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse5 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse16 (= .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse11 (not .cse16)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse31 .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (= .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_arrayElimCell_26 Int)) (let ((.cse2 (+ 8 v_arrayElimCell_26))) (or (forall ((v_ArrVal_1125 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1125))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_27 Int)) (= 1 (select |c_#valid| (select .cse1 (+ 8 v_arrayElimCell_27))))) (= (select |c_#valid| (select .cse1 .cse2)) 1)))) (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimCell_27 Int) (v_arrayElimCell_26 Int)) (let ((.cse10 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (= .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (= 1 (select |c_#valid| (select (let ((.cse9 (store .cse10 .cse8 v_ArrVal_1125))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27)))) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) .cse11) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse12 (let ((.cse14 (let ((.cse15 (store .cse6 .cse7 v_arrayElimArr_1))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_1125)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (.cse13 (+ 8 v_arrayElimCell_26))) (or (= (select |c_#valid| (select .cse12 (+ 8 v_arrayElimCell_28))) 1) (not (= (select v_arrayElimArr_1 .cse13) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (= (select |c_#valid| (select .cse12 .cse13)) 1)))) .cse16) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse18 (+ 8 v_arrayElimCell_26))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1125 (Array Int Int))) (let ((.cse17 (let ((.cse19 (let ((.cse20 (store .cse6 .cse7 v_arrayElimArr_1))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_1125)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse17 (+ 8 v_arrayElimCell_28))) 1) (forall ((v_arrayElimCell_27 Int)) (= 1 (select |c_#valid| (select .cse17 (+ 8 v_arrayElimCell_27))))) (= (select |c_#valid| (select .cse17 .cse18)) 1)))) (not (= (select v_arrayElimArr_1 .cse18) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimCell_27 Int) (v_arrayElimCell_26 Int)) (let ((.cse21 (let ((.cse22 (let ((.cse23 (store .cse6 .cse7 v_arrayElimArr_1))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_1125)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse21 (+ 8 v_arrayElimCell_28))) 1) (= 1 (select |c_#valid| (select .cse21 (+ 8 v_arrayElimCell_27)))) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) .cse11) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse26 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse24 (select (select .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1125 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse25 (store .cse26 .cse24 v_ArrVal_1125))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_28))) 1)))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse30 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse27 (select (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5)) (.cse28 (+ 8 v_arrayElimCell_26))) (or (= .cse27 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (not (= (select v_arrayElimArr_1 .cse28) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (= (select |c_#valid| (select (let ((.cse29 (store .cse30 .cse27 v_ArrVal_1125))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse28)) 1))))) .cse16)))))) is different from false [2023-11-23 21:16:41,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:16:41,360 INFO L378 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 2 case distinctions, treesize of input 1379 treesize of output 722