./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:43:15,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:43:15,870 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:43:15,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:43:15,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:43:15,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:43:15,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:43:15,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:43:15,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:43:15,902 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:43:15,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:43:15,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:43:15,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:43:15,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:43:15,905 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:43:15,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:43:15,907 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:43:15,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:43:15,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:43:15,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:43:15,909 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:43:15,910 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:43:15,910 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:43:15,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:43:15,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:43:15,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:43:15,913 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:43:15,913 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:43:15,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:43:15,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:43:15,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:43:15,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:43:15,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:43:15,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:43:15,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:43:15,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:43:15,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:43:15,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:43:15,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:43:15,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:43:15,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:43:15,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/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_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2023-11-24 21:43:16,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:43:16,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:43:16,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:43:16,225 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:43:16,226 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:43:16,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2023-11-24 21:43:19,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:43:19,551 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:43:19,552 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2023-11-24 21:43:19,567 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/data/8632348bf/ba0232f69e674c7aa0a8a9f8805560e4/FLAGe84060874 [2023-11-24 21:43:19,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/data/8632348bf/ba0232f69e674c7aa0a8a9f8805560e4 [2023-11-24 21:43:19,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:43:19,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:43:19,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:43:19,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:43:19,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:43:19,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:43:19" (1/1) ... [2023-11-24 21:43:19,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dcec2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:19, skipping insertion in model container [2023-11-24 21:43:19,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:43:19" (1/1) ... [2023-11-24 21:43:19,645 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:43:20,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:43:20,177 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:43:20,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:43:20,287 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:43:20,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20 WrapperNode [2023-11-24 21:43:20,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:43:20,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:43:20,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:43:20,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:43:20,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,386 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2023-11-24 21:43:20,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:43:20,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:43:20,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:43:20,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:43:20,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,461 INFO L175 MemorySlicer]: Split 49 memory accesses to 2 slices as follows [2, 47]. 96 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2023-11-24 21:43:20,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:43:20,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:43:20,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:43:20,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:43:20,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (1/1) ... [2023-11-24 21:43:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:43:20,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:43:20,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:43:20,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:43:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 21:43:20,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:43:20,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 21:43:20,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 21:43:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 21:43:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 21:43:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:43:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:43:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:43:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:43:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:43:20,765 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:43:20,767 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:43:21,381 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:43:21,443 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:43:21,443 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-24 21:43:21,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:43:21 BoogieIcfgContainer [2023-11-24 21:43:21,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:43:21,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:43:21,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:43:21,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:43:21,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:43:19" (1/3) ... [2023-11-24 21:43:21,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372f6428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:43:21, skipping insertion in model container [2023-11-24 21:43:21,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:20" (2/3) ... [2023-11-24 21:43:21,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372f6428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:43:21, skipping insertion in model container [2023-11-24 21:43:21,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:43:21" (3/3) ... [2023-11-24 21:43:21,453 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2023-11-24 21:43:21,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:43:21,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2023-11-24 21:43:21,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:43:21,536 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=PETRI_NET, 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;@3c238fc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:43:21,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-24 21:43:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 82 states have (on average 2.5609756097560976) internal successors, (210), 186 states have internal predecessors, (210), 0 states have call successors, (0), 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-24 21:43:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-24 21:43:21,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:21,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-24 21:43:21,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:21,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 11939, now seen corresponding path program 1 times [2023-11-24 21:43:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413755453] [2023-11-24 21:43:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:21,839 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-24 21:43:21,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:21,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413755453] [2023-11-24 21:43:21,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413755453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:21,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:21,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:43:21,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361391200] [2023-11-24 21:43:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:21,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:21,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:21,909 INFO L87 Difference]: Start difference. First operand has 187 states, 82 states have (on average 2.5609756097560976) internal successors, (210), 186 states have internal predecessors, (210), 0 states have call successors, (0), 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-24 21:43:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:22,280 INFO L93 Difference]: Finished difference Result 251 states and 274 transitions. [2023-11-24 21:43:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:22,282 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-24 21:43:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:22,301 INFO L225 Difference]: With dead ends: 251 [2023-11-24 21:43:22,301 INFO L226 Difference]: Without dead ends: 250 [2023-11-24 21:43:22,303 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-24 21:43:22,308 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 177 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:22,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 166 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 21:43:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-24 21:43:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2023-11-24 21:43:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 82 states have (on average 2.3536585365853657) internal successors, (193), 176 states have internal predecessors, (193), 0 states have call successors, (0), 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-24 21:43:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2023-11-24 21:43:22,374 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 2 [2023-11-24 21:43:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:22,374 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2023-11-24 21:43:22,374 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-24 21:43:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2023-11-24 21:43:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-24 21:43:22,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:22,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-24 21:43:22,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:43:22,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:22,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash 11940, now seen corresponding path program 1 times [2023-11-24 21:43:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:22,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948768103] [2023-11-24 21:43:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:22,547 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-24 21:43:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:22,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948768103] [2023-11-24 21:43:22,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948768103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:22,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:22,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:43:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210284908] [2023-11-24 21:43:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:22,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:22,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:22,555 INFO L87 Difference]: Start difference. First operand 177 states and 193 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-24 21:43:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:22,835 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2023-11-24 21:43:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:22,836 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-24 21:43:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:22,839 INFO L225 Difference]: With dead ends: 294 [2023-11-24 21:43:22,839 INFO L226 Difference]: Without dead ends: 294 [2023-11-24 21:43:22,839 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-24 21:43:22,841 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 139 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:22,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 248 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 21:43:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-11-24 21:43:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 172. [2023-11-24 21:43:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 82 states have (on average 2.292682926829268) internal successors, (188), 171 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2023-11-24 21:43:22,855 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 2 [2023-11-24 21:43:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:22,855 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2023-11-24 21:43:22,855 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-24 21:43:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2023-11-24 21:43:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-24 21:43:22,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:22,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:22,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:43:22,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:22,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1491706194, now seen corresponding path program 1 times [2023-11-24 21:43:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:22,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153030742] [2023-11-24 21:43:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:23,113 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-24 21:43:23,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:23,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153030742] [2023-11-24 21:43:23,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153030742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:23,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:23,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:43:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918803522] [2023-11-24 21:43:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:23,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:43:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:43:23,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:43:23,122 INFO L87 Difference]: Start difference. First operand 172 states and 188 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-24 21:43:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:23,449 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2023-11-24 21:43:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:43:23,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-24 21:43:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:23,452 INFO L225 Difference]: With dead ends: 171 [2023-11-24 21:43:23,452 INFO L226 Difference]: Without dead ends: 171 [2023-11-24 21:43:23,452 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-24 21:43:23,454 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:23,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 423 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 21:43:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-24 21:43:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-11-24 21:43:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 82 states have (on average 2.2804878048780486) internal successors, (187), 170 states have internal predecessors, (187), 0 states have call successors, (0), 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-24 21:43:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2023-11-24 21:43:23,476 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 7 [2023-11-24 21:43:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:23,477 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2023-11-24 21:43:23,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-24 21:43:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2023-11-24 21:43:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-24 21:43:23,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:23,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:23,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:43:23,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:23,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1491706193, now seen corresponding path program 1 times [2023-11-24 21:43:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942496728] [2023-11-24 21:43:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:23,842 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-24 21:43:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:23,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942496728] [2023-11-24 21:43:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942496728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:23,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:23,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:43:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095322015] [2023-11-24 21:43:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:23,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:43:23,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:23,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:43:23,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:43:23,844 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-24 21:43:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:24,146 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2023-11-24 21:43:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:43:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-24 21:43:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:24,148 INFO L225 Difference]: With dead ends: 170 [2023-11-24 21:43:24,148 INFO L226 Difference]: Without dead ends: 170 [2023-11-24 21:43:24,148 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-24 21:43:24,149 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:24,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 436 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 21:43:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-24 21:43:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2023-11-24 21:43:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 82 states have (on average 2.268292682926829) internal successors, (186), 169 states have internal predecessors, (186), 0 states have call successors, (0), 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-24 21:43:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2023-11-24 21:43:24,158 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 7 [2023-11-24 21:43:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:24,158 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2023-11-24 21:43:24,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-24 21:43:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2023-11-24 21:43:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 21:43:24,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:24,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:24,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:43:24,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:24,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash 617215464, now seen corresponding path program 1 times [2023-11-24 21:43:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356289844] [2023-11-24 21:43:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:24,302 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-24 21:43:24,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:24,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356289844] [2023-11-24 21:43:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356289844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:24,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:24,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:43:24,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720613341] [2023-11-24 21:43:24,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:24,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:43:24,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:24,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:43:24,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:43:24,306 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:24,694 INFO L93 Difference]: Finished difference Result 318 states and 346 transitions. [2023-11-24 21:43:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:43:24,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-24 21:43:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:24,697 INFO L225 Difference]: With dead ends: 318 [2023-11-24 21:43:24,697 INFO L226 Difference]: Without dead ends: 318 [2023-11-24 21:43:24,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:43:24,698 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 331 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:24,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 189 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:43:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-11-24 21:43:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 166. [2023-11-24 21:43:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 165 states have internal predecessors, (182), 0 states have call successors, (0), 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-24 21:43:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2023-11-24 21:43:24,706 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 10 [2023-11-24 21:43:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:24,707 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2023-11-24 21:43:24,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2023-11-24 21:43:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 21:43:24,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:24,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:24,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:43:24,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:24,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1953810176, now seen corresponding path program 1 times [2023-11-24 21:43:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:24,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879742472] [2023-11-24 21:43:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:25,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-24 21:43:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:25,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879742472] [2023-11-24 21:43:25,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879742472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:25,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:25,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:43:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813223990] [2023-11-24 21:43:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:25,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:43:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:25,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:43:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:43:25,017 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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-24 21:43:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:25,615 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2023-11-24 21:43:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:43:25,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-24 21:43:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:25,618 INFO L225 Difference]: With dead ends: 315 [2023-11-24 21:43:25,618 INFO L226 Difference]: Without dead ends: 315 [2023-11-24 21:43:25,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-24 21:43:25,620 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 421 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:25,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 648 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 21:43:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-24 21:43:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 170. [2023-11-24 21:43:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 86 states have (on average 2.186046511627907) internal successors, (188), 169 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 188 transitions. [2023-11-24 21:43:25,628 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 188 transitions. Word has length 11 [2023-11-24 21:43:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:25,628 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 188 transitions. [2023-11-24 21:43:25,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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-24 21:43:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2023-11-24 21:43:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 21:43:25,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:25,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:25,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:43:25,630 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:25,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:25,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1953810177, now seen corresponding path program 1 times [2023-11-24 21:43:25,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:25,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841608001] [2023-11-24 21:43:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:25,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:26,146 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-24 21:43:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841608001] [2023-11-24 21:43:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841608001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:26,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:43:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052516299] [2023-11-24 21:43:26,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:26,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:43:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:26,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:43:26,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:43:26,148 INFO L87 Difference]: Start difference. First operand 170 states and 188 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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-24 21:43:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:27,061 INFO L93 Difference]: Finished difference Result 241 states and 271 transitions. [2023-11-24 21:43:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:43:27,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-24 21:43:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:27,063 INFO L225 Difference]: With dead ends: 241 [2023-11-24 21:43:27,063 INFO L226 Difference]: Without dead ends: 241 [2023-11-24 21:43:27,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-24 21:43:27,065 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 425 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:27,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 471 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-24 21:43:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-24 21:43:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 170. [2023-11-24 21:43:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 86 states have (on average 2.1744186046511627) internal successors, (187), 169 states have internal predecessors, (187), 0 states have call successors, (0), 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-24 21:43:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2023-11-24 21:43:27,070 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 11 [2023-11-24 21:43:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:27,071 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2023-11-24 21:43:27,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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-24 21:43:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2023-11-24 21:43:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-24 21:43:27,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:27,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:27,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:43:27,072 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:27,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash 438573322, now seen corresponding path program 1 times [2023-11-24 21:43:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:27,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287814639] [2023-11-24 21:43:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:27,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:27,148 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-24 21:43:27,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:27,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287814639] [2023-11-24 21:43:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287814639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728208478] [2023-11-24 21:43:27,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:27,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:27,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:27,151 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:27,389 INFO L93 Difference]: Finished difference Result 281 states and 313 transitions. [2023-11-24 21:43:27,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:27,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-24 21:43:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:27,392 INFO L225 Difference]: With dead ends: 281 [2023-11-24 21:43:27,392 INFO L226 Difference]: Without dead ends: 281 [2023-11-24 21:43:27,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:27,394 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 150 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:27,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 283 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:43:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-24 21:43:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 167. [2023-11-24 21:43:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 86 states have (on average 2.13953488372093) internal successors, (184), 166 states have internal predecessors, (184), 0 states have call successors, (0), 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-24 21:43:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2023-11-24 21:43:27,409 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 12 [2023-11-24 21:43:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:27,409 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2023-11-24 21:43:27,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2023-11-24 21:43:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-24 21:43:27,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:27,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:27,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:43:27,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:27,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash 438573323, now seen corresponding path program 1 times [2023-11-24 21:43:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687040750] [2023-11-24 21:43:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:27,510 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-24 21:43:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687040750] [2023-11-24 21:43:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687040750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:27,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:27,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594496630] [2023-11-24 21:43:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:27,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:27,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:27,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:27,513 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:27,730 INFO L93 Difference]: Finished difference Result 261 states and 293 transitions. [2023-11-24 21:43:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:27,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-24 21:43:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:27,733 INFO L225 Difference]: With dead ends: 261 [2023-11-24 21:43:27,733 INFO L226 Difference]: Without dead ends: 261 [2023-11-24 21:43:27,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:27,734 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 125 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:27,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 294 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:43:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-24 21:43:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 165. [2023-11-24 21:43:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 86 states have (on average 2.116279069767442) internal successors, (182), 164 states have internal predecessors, (182), 0 states have call successors, (0), 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-24 21:43:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2023-11-24 21:43:27,739 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 12 [2023-11-24 21:43:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:27,739 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2023-11-24 21:43:27,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2023-11-24 21:43:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 21:43:27,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:27,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:27,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:43:27,747 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:27,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash 709699393, now seen corresponding path program 1 times [2023-11-24 21:43:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:27,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178535060] [2023-11-24 21:43:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:27,797 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-24 21:43:27,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:27,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178535060] [2023-11-24 21:43:27,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178535060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:27,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:27,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:43:27,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833124763] [2023-11-24 21:43:27,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:27,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:43:27,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:27,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:43:27,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:43:27,799 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-24 21:43:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:28,077 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2023-11-24 21:43:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:43:28,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-24 21:43:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:28,080 INFO L225 Difference]: With dead ends: 226 [2023-11-24 21:43:28,080 INFO L226 Difference]: Without dead ends: 226 [2023-11-24 21:43:28,080 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-24 21:43:28,081 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:28,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 120 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 21:43:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-24 21:43:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 154. [2023-11-24 21:43:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 153 states have internal predecessors, (175), 0 states have call successors, (0), 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-24 21:43:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2023-11-24 21:43:28,085 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 13 [2023-11-24 21:43:28,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:28,086 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2023-11-24 21:43:28,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-24 21:43:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2023-11-24 21:43:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 21:43:28,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:28,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:28,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:43:28,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:28,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:28,088 INFO L85 PathProgramCache]: Analyzing trace with hash 709699394, now seen corresponding path program 1 times [2023-11-24 21:43:28,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:28,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771199266] [2023-11-24 21:43:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:28,220 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-24 21:43:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:28,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771199266] [2023-11-24 21:43:28,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771199266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:28,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:28,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:43:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141503381] [2023-11-24 21:43:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:28,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:43:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:28,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:43:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:43:28,222 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-24 21:43:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:28,690 INFO L93 Difference]: Finished difference Result 389 states and 443 transitions. [2023-11-24 21:43:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:43:28,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-24 21:43:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:28,693 INFO L225 Difference]: With dead ends: 389 [2023-11-24 21:43:28,693 INFO L226 Difference]: Without dead ends: 389 [2023-11-24 21:43:28,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:43:28,694 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 625 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:28,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 239 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:43:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-11-24 21:43:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 275. [2023-11-24 21:43:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 211 states have (on average 1.914691943127962) internal successors, (404), 274 states have internal predecessors, (404), 0 states have call successors, (0), 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-24 21:43:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 404 transitions. [2023-11-24 21:43:28,703 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 404 transitions. Word has length 13 [2023-11-24 21:43:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:28,703 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 404 transitions. [2023-11-24 21:43:28,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-24 21:43:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 404 transitions. [2023-11-24 21:43:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-24 21:43:28,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:28,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:28,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:43:28,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:28,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash 562471561, now seen corresponding path program 1 times [2023-11-24 21:43:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:28,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496034305] [2023-11-24 21:43:28,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:28,914 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-24 21:43:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:28,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496034305] [2023-11-24 21:43:28,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496034305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:28,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:43:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959000218] [2023-11-24 21:43:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:28,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:43:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:43:28,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:43:28,917 INFO L87 Difference]: Start difference. First operand 275 states and 404 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-24 21:43:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:29,541 INFO L93 Difference]: Finished difference Result 681 states and 1023 transitions. [2023-11-24 21:43:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:43:29,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-24 21:43:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:29,546 INFO L225 Difference]: With dead ends: 681 [2023-11-24 21:43:29,546 INFO L226 Difference]: Without dead ends: 681 [2023-11-24 21:43:29,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-24 21:43:29,547 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 335 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:29,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 772 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 21:43:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-24 21:43:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 274. [2023-11-24 21:43:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 211 states have (on average 1.9099526066350712) internal successors, (403), 273 states have internal predecessors, (403), 0 states have call successors, (0), 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-24 21:43:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 403 transitions. [2023-11-24 21:43:29,559 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 403 transitions. Word has length 14 [2023-11-24 21:43:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:29,560 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 403 transitions. [2023-11-24 21:43:29,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-24 21:43:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 403 transitions. [2023-11-24 21:43:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-24 21:43:29,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:29,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:29,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:43:29,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:29,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash 562471562, now seen corresponding path program 1 times [2023-11-24 21:43:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398682495] [2023-11-24 21:43:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:29,848 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-24 21:43:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398682495] [2023-11-24 21:43:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398682495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:29,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:43:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127071921] [2023-11-24 21:43:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:29,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:43:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:29,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:43:29,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:43:29,851 INFO L87 Difference]: Start difference. First operand 274 states and 403 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-24 21:43:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:30,908 INFO L93 Difference]: Finished difference Result 680 states and 1022 transitions. [2023-11-24 21:43:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:43:30,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-24 21:43:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:30,914 INFO L225 Difference]: With dead ends: 680 [2023-11-24 21:43:30,914 INFO L226 Difference]: Without dead ends: 680 [2023-11-24 21:43:30,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-24 21:43:30,915 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 327 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:30,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 796 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-24 21:43:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-11-24 21:43:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 273. [2023-11-24 21:43:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 211 states have (on average 1.90521327014218) internal successors, (402), 272 states have internal predecessors, (402), 0 states have call successors, (0), 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-24 21:43:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 402 transitions. [2023-11-24 21:43:30,926 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 402 transitions. Word has length 14 [2023-11-24 21:43:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:30,927 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 402 transitions. [2023-11-24 21:43:30,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-24 21:43:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 402 transitions. [2023-11-24 21:43:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-24 21:43:30,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:30,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:30,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:43:30,929 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:30,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash -878604630, now seen corresponding path program 1 times [2023-11-24 21:43:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:30,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433455431] [2023-11-24 21:43:30,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:30,992 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-24 21:43:30,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433455431] [2023-11-24 21:43:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433455431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:30,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:30,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733064286] [2023-11-24 21:43:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:30,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:30,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:30,995 INFO L87 Difference]: Start difference. First operand 273 states and 402 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-24 21:43:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:31,075 INFO L93 Difference]: Finished difference Result 341 states and 474 transitions. [2023-11-24 21:43:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-24 21:43:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:31,079 INFO L225 Difference]: With dead ends: 341 [2023-11-24 21:43:31,079 INFO L226 Difference]: Without dead ends: 341 [2023-11-24 21:43:31,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:31,080 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 144 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:31,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 235 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:43:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-24 21:43:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2023-11-24 21:43:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 245 states have (on average 1.9346938775510205) internal successors, (474), 306 states have internal predecessors, (474), 0 states have call successors, (0), 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-24 21:43:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 474 transitions. [2023-11-24 21:43:31,092 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 474 transitions. Word has length 15 [2023-11-24 21:43:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:31,092 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 474 transitions. [2023-11-24 21:43:31,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-24 21:43:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 474 transitions. [2023-11-24 21:43:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 21:43:31,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:31,094 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:31,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:43:31,095 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:31,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash -256134480, now seen corresponding path program 1 times [2023-11-24 21:43:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:31,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775908697] [2023-11-24 21:43:31,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775908697] [2023-11-24 21:43:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775908697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:43:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580329179] [2023-11-24 21:43:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:31,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:43:31,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:43:31,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:43:31,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:43:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:31,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 21:43:31,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:43:31,899 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:43:31,947 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:43:31,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 21:43:31,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-24 21:43:32,066 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:43:32,067 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 31 treesize of output 32 [2023-11-24 21:43:32,096 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:43:32,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 21:43:32,142 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 19 treesize of output 14 [2023-11-24 21:43:32,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:43:32,205 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 42 treesize of output 41 [2023-11-24 21:43:32,256 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-24 21:43:32,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2023-11-24 21:43:32,305 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 31 treesize of output 13 [2023-11-24 21:43:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:32,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:43:32,408 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-24 21:43:32,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 21:43:32,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:43:32,776 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 1 case distinctions, treesize of input 26 treesize of output 27 [2023-11-24 21:43:32,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:43:32,789 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 39 treesize of output 27 [2023-11-24 21:43:32,795 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 8 treesize of output 4 [2023-11-24 21:43:32,804 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-24 21:43:32,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-24 21:43:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580329179] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:43:32,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:43:32,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2023-11-24 21:43:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226595675] [2023-11-24 21:43:32,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:43:32,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-24 21:43:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-24 21:43:32,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=464, Unknown=9, NotChecked=0, Total=552 [2023-11-24 21:43:32,855 INFO L87 Difference]: Start difference. First operand 307 states and 474 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:34,651 INFO L93 Difference]: Finished difference Result 706 states and 1039 transitions. [2023-11-24 21:43:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:43:34,652 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-24 21:43:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:34,657 INFO L225 Difference]: With dead ends: 706 [2023-11-24 21:43:34,657 INFO L226 Difference]: Without dead ends: 706 [2023-11-24 21:43:34,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=700, Unknown=9, NotChecked=0, Total=870 [2023-11-24 21:43:34,658 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 834 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:34,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 2550 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-24 21:43:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2023-11-24 21:43:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 306. [2023-11-24 21:43:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 245 states have (on average 1.9306122448979592) internal successors, (473), 305 states have internal predecessors, (473), 0 states have call successors, (0), 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-24 21:43:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 473 transitions. [2023-11-24 21:43:34,670 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 473 transitions. Word has length 18 [2023-11-24 21:43:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:34,670 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 473 transitions. [2023-11-24 21:43:34,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 473 transitions. [2023-11-24 21:43:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 21:43:34,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:34,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:34,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:43:34,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-24 21:43:34,881 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:34,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash -256134479, now seen corresponding path program 1 times [2023-11-24 21:43:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018736784] [2023-11-24 21:43:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018736784] [2023-11-24 21:43:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018736784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:43:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558570861] [2023-11-24 21:43:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:35,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:43:35,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:43:35,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:43:35,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:43:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:35,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-24 21:43:35,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:43:35,678 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:43:35,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:43:35,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 21:43:35,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-24 21:43:35,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:43:35,791 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 31 treesize of output 32 [2023-11-24 21:43:35,812 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:43:35,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 21:43:35,870 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 19 treesize of output 14 [2023-11-24 21:43:35,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:43:35,936 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 81 treesize of output 74 [2023-11-24 21:43:35,941 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 49 treesize of output 30 [2023-11-24 21:43:36,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:43:36,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-24 21:43:36,016 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2023-11-24 21:43:36,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-24 21:43:36,066 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 39 treesize of output 21 [2023-11-24 21:43:36,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-24 21:43:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:36,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:43:36,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:43:36,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 107 [2023-11-24 21:43:36,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:43:36,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 109 [2023-11-24 21:43:36,518 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 113 treesize of output 95 [2023-11-24 21:43:36,530 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 65 treesize of output 61 [2023-11-24 21:43:36,533 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 61 treesize of output 57 [2023-11-24 21:43:40,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:43:40,861 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 1 case distinctions, treesize of input 26 treesize of output 27 [2023-11-24 21:43:40,866 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:43:40,868 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 39 treesize of output 27 [2023-11-24 21:43:40,879 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-24 21:43:40,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-24 21:43:40,884 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 8 treesize of output 4 [2023-11-24 21:43:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558570861] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:43:40,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:43:40,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 29 [2023-11-24 21:43:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432181208] [2023-11-24 21:43:40,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:43:40,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-24 21:43:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-24 21:43:40,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=733, Unknown=12, NotChecked=0, Total=870 [2023-11-24 21:43:40,938 INFO L87 Difference]: Start difference. First operand 306 states and 473 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:44,250 INFO L93 Difference]: Finished difference Result 587 states and 883 transitions. [2023-11-24 21:43:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:43:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-24 21:43:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:44,262 INFO L225 Difference]: With dead ends: 587 [2023-11-24 21:43:44,262 INFO L226 Difference]: Without dead ends: 587 [2023-11-24 21:43:44,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=226, Invalid=1022, Unknown=12, NotChecked=0, Total=1260 [2023-11-24 21:43:44,266 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 771 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:44,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1810 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-24 21:43:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-11-24 21:43:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 301. [2023-11-24 21:43:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 241 states have (on average 1.937759336099585) internal successors, (467), 300 states have internal predecessors, (467), 0 states have call successors, (0), 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-24 21:43:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 467 transitions. [2023-11-24 21:43:44,286 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 467 transitions. Word has length 18 [2023-11-24 21:43:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:44,287 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 467 transitions. [2023-11-24 21:43:44,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 467 transitions. [2023-11-24 21:43:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 21:43:44,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:44,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:44,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:43:44,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-24 21:43:44,496 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:44,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash -905517055, now seen corresponding path program 1 times [2023-11-24 21:43:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:44,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006094622] [2023-11-24 21:43:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:44,530 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-24 21:43:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006094622] [2023-11-24 21:43:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006094622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:44,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:43:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002339302] [2023-11-24 21:43:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:44,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:44,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:44,533 INFO L87 Difference]: Start difference. First operand 301 states and 467 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-24 21:43:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:44,601 INFO L93 Difference]: Finished difference Result 305 states and 471 transitions. [2023-11-24 21:43:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:44,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-11-24 21:43:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:44,603 INFO L225 Difference]: With dead ends: 305 [2023-11-24 21:43:44,604 INFO L226 Difference]: Without dead ends: 305 [2023-11-24 21:43:44,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:44,604 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:44,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:43:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-24 21:43:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2023-11-24 21:43:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 245 states have (on average 1.9224489795918367) internal successors, (471), 304 states have internal predecessors, (471), 0 states have call successors, (0), 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-24 21:43:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2023-11-24 21:43:44,613 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 18 [2023-11-24 21:43:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:44,613 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2023-11-24 21:43:44,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-24 21:43:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2023-11-24 21:43:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 21:43:44,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:44,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:44,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:43:44,615 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:44,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 184289742, now seen corresponding path program 1 times [2023-11-24 21:43:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382184124] [2023-11-24 21:43:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:44,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382184124] [2023-11-24 21:43:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382184124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:44,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:44,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:43:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218574702] [2023-11-24 21:43:44,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:44,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:44,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:44,648 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-24 21:43:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:44,715 INFO L93 Difference]: Finished difference Result 308 states and 474 transitions. [2023-11-24 21:43:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:44,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-11-24 21:43:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:44,718 INFO L225 Difference]: With dead ends: 308 [2023-11-24 21:43:44,718 INFO L226 Difference]: Without dead ends: 308 [2023-11-24 21:43:44,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:44,720 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:44,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:43:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-11-24 21:43:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2023-11-24 21:43:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 248 states have (on average 1.9112903225806452) internal successors, (474), 307 states have internal predecessors, (474), 0 states have call successors, (0), 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-24 21:43:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 474 transitions. [2023-11-24 21:43:44,736 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 474 transitions. Word has length 18 [2023-11-24 21:43:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:44,736 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 474 transitions. [2023-11-24 21:43:44,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-24 21:43:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 474 transitions. [2023-11-24 21:43:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 21:43:44,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:44,738 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-24 21:43:44,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:43:44,740 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:44,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1999408612, now seen corresponding path program 1 times [2023-11-24 21:43:44,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:44,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197679542] [2023-11-24 21:43:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:44,797 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-24 21:43:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:44,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197679542] [2023-11-24 21:43:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197679542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:44,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:43:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978063076] [2023-11-24 21:43:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:44,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:44,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:44,800 INFO L87 Difference]: Start difference. First operand 308 states and 474 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-24 21:43:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:44,893 INFO L93 Difference]: Finished difference Result 343 states and 495 transitions. [2023-11-24 21:43:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:44,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-24 21:43:44,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:44,895 INFO L225 Difference]: With dead ends: 343 [2023-11-24 21:43:44,896 INFO L226 Difference]: Without dead ends: 343 [2023-11-24 21:43:44,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:44,896 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 46 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:44,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 258 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:43:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-11-24 21:43:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 295. [2023-11-24 21:43:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 235 states have (on average 1.9063829787234043) internal successors, (448), 294 states have internal predecessors, (448), 0 states have call successors, (0), 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-24 21:43:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 448 transitions. [2023-11-24 21:43:44,906 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 448 transitions. Word has length 19 [2023-11-24 21:43:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:44,906 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 448 transitions. [2023-11-24 21:43:44,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-24 21:43:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 448 transitions. [2023-11-24 21:43:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 21:43:44,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:44,908 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-24 21:43:44,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 21:43:44,908 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:44,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1481409960, now seen corresponding path program 1 times [2023-11-24 21:43:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:44,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696087341] [2023-11-24 21:43:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696087341] [2023-11-24 21:43:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696087341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:45,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:45,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 21:43:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540578857] [2023-11-24 21:43:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:45,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:43:45,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:45,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:43:45,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:43:45,392 INFO L87 Difference]: Start difference. First operand 295 states and 448 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-24 21:43:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:46,384 INFO L93 Difference]: Finished difference Result 499 states and 678 transitions. [2023-11-24 21:43:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:43:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-24 21:43:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:46,394 INFO L225 Difference]: With dead ends: 499 [2023-11-24 21:43:46,395 INFO L226 Difference]: Without dead ends: 499 [2023-11-24 21:43:46,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-11-24 21:43:46,396 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 305 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:46,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 945 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-24 21:43:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-11-24 21:43:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 310. [2023-11-24 21:43:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 250 states have (on average 1.876) internal successors, (469), 309 states have internal predecessors, (469), 0 states have call successors, (0), 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-24 21:43:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 469 transitions. [2023-11-24 21:43:46,407 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 469 transitions. Word has length 19 [2023-11-24 21:43:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:46,407 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 469 transitions. [2023-11-24 21:43:46,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-24 21:43:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 469 transitions. [2023-11-24 21:43:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 21:43:46,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:46,408 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-24 21:43:46,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-24 21:43:46,408 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:46,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1677655270, now seen corresponding path program 1 times [2023-11-24 21:43:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129074120] [2023-11-24 21:43:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:46,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:46,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129074120] [2023-11-24 21:43:46,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129074120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:46,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:46,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 21:43:46,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215251610] [2023-11-24 21:43:46,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:46,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:43:46,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:43:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:43:46,817 INFO L87 Difference]: Start difference. First operand 310 states and 469 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-24 21:43:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:47,664 INFO L93 Difference]: Finished difference Result 497 states and 674 transitions. [2023-11-24 21:43:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 21:43:47,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-24 21:43:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:47,667 INFO L225 Difference]: With dead ends: 497 [2023-11-24 21:43:47,668 INFO L226 Difference]: Without dead ends: 497 [2023-11-24 21:43:47,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-24 21:43:47,670 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 386 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:47,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 704 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 21:43:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-11-24 21:43:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 346. [2023-11-24 21:43:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 286 states have (on average 1.8776223776223777) internal successors, (537), 345 states have internal predecessors, (537), 0 states have call successors, (0), 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-24 21:43:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 537 transitions. [2023-11-24 21:43:47,683 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 537 transitions. Word has length 20 [2023-11-24 21:43:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:47,685 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 537 transitions. [2023-11-24 21:43:47,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-24 21:43:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 537 transitions. [2023-11-24 21:43:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:43:47,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:47,687 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] [2023-11-24 21:43:47,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-24 21:43:47,687 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:47,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1581829259, now seen corresponding path program 1 times [2023-11-24 21:43:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169465478] [2023-11-24 21:43:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:48,026 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-24 21:43:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:48,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169465478] [2023-11-24 21:43:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169465478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:48,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:48,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:43:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167832759] [2023-11-24 21:43:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:48,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:43:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:43:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:43:48,028 INFO L87 Difference]: Start difference. First operand 346 states and 537 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:48,926 INFO L93 Difference]: Finished difference Result 525 states and 782 transitions. [2023-11-24 21:43:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 21:43:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-24 21:43:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:48,929 INFO L225 Difference]: With dead ends: 525 [2023-11-24 21:43:48,930 INFO L226 Difference]: Without dead ends: 525 [2023-11-24 21:43:48,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-24 21:43:48,931 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 561 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:48,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 648 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-24 21:43:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-24 21:43:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 353. [2023-11-24 21:43:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 293 states have (on average 1.863481228668942) internal successors, (546), 352 states have internal predecessors, (546), 0 states have call successors, (0), 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-24 21:43:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 546 transitions. [2023-11-24 21:43:48,942 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 546 transitions. Word has length 21 [2023-11-24 21:43:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:48,942 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 546 transitions. [2023-11-24 21:43:48,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 546 transitions. [2023-11-24 21:43:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:43:48,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:48,943 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] [2023-11-24 21:43:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 21:43:48,944 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:48,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1581829260, now seen corresponding path program 1 times [2023-11-24 21:43:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223835563] [2023-11-24 21:43:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:49,311 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-24 21:43:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223835563] [2023-11-24 21:43:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223835563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:49,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:49,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:43:49,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171329226] [2023-11-24 21:43:49,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:49,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:43:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:49,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:43:49,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:43:49,314 INFO L87 Difference]: Start difference. First operand 353 states and 546 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:50,409 INFO L93 Difference]: Finished difference Result 533 states and 790 transitions. [2023-11-24 21:43:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:43:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-24 21:43:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:50,419 INFO L225 Difference]: With dead ends: 533 [2023-11-24 21:43:50,419 INFO L226 Difference]: Without dead ends: 533 [2023-11-24 21:43:50,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-11-24 21:43:50,422 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 302 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:50,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 502 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-24 21:43:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2023-11-24 21:43:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 353. [2023-11-24 21:43:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 293 states have (on average 1.8600682593856654) internal successors, (545), 352 states have internal predecessors, (545), 0 states have call successors, (0), 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-24 21:43:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 545 transitions. [2023-11-24 21:43:50,436 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 545 transitions. Word has length 21 [2023-11-24 21:43:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:50,436 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 545 transitions. [2023-11-24 21:43:50,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 545 transitions. [2023-11-24 21:43:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:43:50,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:50,445 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] [2023-11-24 21:43:50,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-24 21:43:50,446 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:50,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1582478857, now seen corresponding path program 1 times [2023-11-24 21:43:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746186466] [2023-11-24 21:43:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746186466] [2023-11-24 21:43:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746186466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:50,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:43:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645760081] [2023-11-24 21:43:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:50,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:43:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:50,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:43:50,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:43:50,579 INFO L87 Difference]: Start difference. First operand 353 states and 545 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:50,837 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2023-11-24 21:43:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:43:50,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-24 21:43:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:50,840 INFO L225 Difference]: With dead ends: 452 [2023-11-24 21:43:50,841 INFO L226 Difference]: Without dead ends: 452 [2023-11-24 21:43:50,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:43:50,842 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 111 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:50,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 280 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:43:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-11-24 21:43:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 362. [2023-11-24 21:43:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 302 states have (on average 1.8443708609271523) internal successors, (557), 361 states have internal predecessors, (557), 0 states have call successors, (0), 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-24 21:43:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 557 transitions. [2023-11-24 21:43:50,852 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 557 transitions. Word has length 21 [2023-11-24 21:43:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:50,854 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 557 transitions. [2023-11-24 21:43:50,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 557 transitions. [2023-11-24 21:43:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:43:50,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:50,855 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] [2023-11-24 21:43:50,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-24 21:43:50,855 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:50,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1582484747, now seen corresponding path program 1 times [2023-11-24 21:43:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737440613] [2023-11-24 21:43:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:51,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737440613] [2023-11-24 21:43:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737440613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:51,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:51,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 21:43:51,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234980115] [2023-11-24 21:43:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:51,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:43:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:43:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:43:51,274 INFO L87 Difference]: Start difference. First operand 362 states and 557 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:52,055 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2023-11-24 21:43:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:43:52,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-24 21:43:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:52,058 INFO L225 Difference]: With dead ends: 481 [2023-11-24 21:43:52,058 INFO L226 Difference]: Without dead ends: 481 [2023-11-24 21:43:52,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-11-24 21:43:52,059 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 536 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:52,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 524 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 21:43:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-11-24 21:43:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 327. [2023-11-24 21:43:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 267 states have (on average 1.8314606741573034) internal successors, (489), 326 states have internal predecessors, (489), 0 states have call successors, (0), 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-24 21:43:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 489 transitions. [2023-11-24 21:43:52,069 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 489 transitions. Word has length 21 [2023-11-24 21:43:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:52,070 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 489 transitions. [2023-11-24 21:43:52,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 489 transitions. [2023-11-24 21:43:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:43:52,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:52,071 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] [2023-11-24 21:43:52,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-24 21:43:52,071 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:52,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash -145879624, now seen corresponding path program 1 times [2023-11-24 21:43:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090798189] [2023-11-24 21:43:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:52,113 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-24 21:43:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:52,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090798189] [2023-11-24 21:43:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090798189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:52,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:43:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123627368] [2023-11-24 21:43:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:52,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:52,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:52,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:52,116 INFO L87 Difference]: Start difference. First operand 327 states and 489 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:52,182 INFO L93 Difference]: Finished difference Result 331 states and 493 transitions. [2023-11-24 21:43:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:52,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-24 21:43:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:52,184 INFO L225 Difference]: With dead ends: 331 [2023-11-24 21:43:52,184 INFO L226 Difference]: Without dead ends: 331 [2023-11-24 21:43:52,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:52,185 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:52,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:43:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-24 21:43:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2023-11-24 21:43:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 271 states have (on average 1.8191881918819188) internal successors, (493), 330 states have internal predecessors, (493), 0 states have call successors, (0), 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-24 21:43:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2023-11-24 21:43:52,213 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 21 [2023-11-24 21:43:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:52,214 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2023-11-24 21:43:52,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2023-11-24 21:43:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:43:52,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:52,215 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] [2023-11-24 21:43:52,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-24 21:43:52,216 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:52,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash -145939206, now seen corresponding path program 1 times [2023-11-24 21:43:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:52,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928863504] [2023-11-24 21:43:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:52,269 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-24 21:43:52,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928863504] [2023-11-24 21:43:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928863504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:52,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:52,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:52,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529276818] [2023-11-24 21:43:52,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:52,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:52,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:52,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:52,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:52,272 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:52,435 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2023-11-24 21:43:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:52,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-24 21:43:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:52,437 INFO L225 Difference]: With dead ends: 326 [2023-11-24 21:43:52,437 INFO L226 Difference]: Without dead ends: 326 [2023-11-24 21:43:52,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:52,438 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:52,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 181 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:43:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-24 21:43:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2023-11-24 21:43:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 271 states have (on average 1.8007380073800738) internal successors, (488), 325 states have internal predecessors, (488), 0 states have call successors, (0), 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-24 21:43:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 488 transitions. [2023-11-24 21:43:52,446 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 488 transitions. Word has length 21 [2023-11-24 21:43:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:52,446 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 488 transitions. [2023-11-24 21:43:52,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 488 transitions. [2023-11-24 21:43:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:43:52,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:52,447 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] [2023-11-24 21:43:52,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-24 21:43:52,448 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:52,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash -145939205, now seen corresponding path program 1 times [2023-11-24 21:43:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:52,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619577781] [2023-11-24 21:43:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:52,519 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-24 21:43:52,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:52,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619577781] [2023-11-24 21:43:52,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619577781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:52,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:52,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:52,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887747676] [2023-11-24 21:43:52,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:52,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:52,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:52,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:52,521 INFO L87 Difference]: Start difference. First operand 326 states and 488 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:52,691 INFO L93 Difference]: Finished difference Result 321 states and 483 transitions. [2023-11-24 21:43:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-24 21:43:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:52,694 INFO L225 Difference]: With dead ends: 321 [2023-11-24 21:43:52,694 INFO L226 Difference]: Without dead ends: 321 [2023-11-24 21:43:52,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:52,695 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:52,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 181 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:43:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-24 21:43:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2023-11-24 21:43:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 271 states have (on average 1.7822878228782288) internal successors, (483), 320 states have internal predecessors, (483), 0 states have call successors, (0), 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-24 21:43:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 483 transitions. [2023-11-24 21:43:52,704 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 483 transitions. Word has length 21 [2023-11-24 21:43:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:52,704 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 483 transitions. [2023-11-24 21:43:52,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 21:43:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 483 transitions. [2023-11-24 21:43:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-24 21:43:52,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:52,705 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-24 21:43:52,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-24 21:43:52,706 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:52,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash -105465677, now seen corresponding path program 1 times [2023-11-24 21:43:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:52,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768457304] [2023-11-24 21:43:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:53,007 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-24 21:43:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:53,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768457304] [2023-11-24 21:43:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768457304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:53,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:53,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:43:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103872715] [2023-11-24 21:43:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:53,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:43:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:53,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:43:53,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:43:53,009 INFO L87 Difference]: Start difference. First operand 321 states and 483 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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-24 21:43:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:53,766 INFO L93 Difference]: Finished difference Result 468 states and 682 transitions. [2023-11-24 21:43:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 21:43:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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-24 21:43:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:53,771 INFO L225 Difference]: With dead ends: 468 [2023-11-24 21:43:53,771 INFO L226 Difference]: Without dead ends: 468 [2023-11-24 21:43:53,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-11-24 21:43:53,778 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 364 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:53,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 513 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 21:43:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-24 21:43:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 324. [2023-11-24 21:43:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 274 states have (on average 1.7773722627737227) internal successors, (487), 323 states have internal predecessors, (487), 0 states have call successors, (0), 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-24 21:43:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 487 transitions. [2023-11-24 21:43:53,806 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 487 transitions. Word has length 24 [2023-11-24 21:43:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:53,807 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 487 transitions. [2023-11-24 21:43:53,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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-24 21:43:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 487 transitions. [2023-11-24 21:43:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-24 21:43:53,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:53,809 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-24 21:43:53,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-24 21:43:53,810 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:53,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash -105464586, now seen corresponding path program 1 times [2023-11-24 21:43:53,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:53,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363950566] [2023-11-24 21:43:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:53,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:53,889 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-24 21:43:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363950566] [2023-11-24 21:43:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363950566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:43:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491773595] [2023-11-24 21:43:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:53,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:43:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:53,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:43:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:43:53,891 INFO L87 Difference]: Start difference. First operand 324 states and 487 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:54,236 INFO L93 Difference]: Finished difference Result 323 states and 483 transitions. [2023-11-24 21:43:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:43:54,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-24 21:43:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:54,239 INFO L225 Difference]: With dead ends: 323 [2023-11-24 21:43:54,239 INFO L226 Difference]: Without dead ends: 323 [2023-11-24 21:43:54,239 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-24 21:43:54,240 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:54,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 279 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 21:43:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-24 21:43:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2023-11-24 21:43:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 274 states have (on average 1.7627737226277371) internal successors, (483), 322 states have internal predecessors, (483), 0 states have call successors, (0), 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-24 21:43:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 483 transitions. [2023-11-24 21:43:54,249 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 483 transitions. Word has length 24 [2023-11-24 21:43:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:54,250 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 483 transitions. [2023-11-24 21:43:54,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 483 transitions. [2023-11-24 21:43:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-24 21:43:54,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:54,251 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-24 21:43:54,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-24 21:43:54,251 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:54,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash -105464585, now seen corresponding path program 1 times [2023-11-24 21:43:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:54,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658201776] [2023-11-24 21:43:54,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:54,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:54,385 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-24 21:43:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:54,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658201776] [2023-11-24 21:43:54,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658201776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:54,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:54,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:43:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494017329] [2023-11-24 21:43:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:54,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:43:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:54,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:43:54,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:43:54,388 INFO L87 Difference]: Start difference. First operand 323 states and 483 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:54,806 INFO L93 Difference]: Finished difference Result 322 states and 479 transitions. [2023-11-24 21:43:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:43:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-24 21:43:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:54,809 INFO L225 Difference]: With dead ends: 322 [2023-11-24 21:43:54,809 INFO L226 Difference]: Without dead ends: 322 [2023-11-24 21:43:54,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:43:54,810 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 31 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:54,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 266 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:43:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-24 21:43:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2023-11-24 21:43:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 274 states have (on average 1.7481751824817517) internal successors, (479), 321 states have internal predecessors, (479), 0 states have call successors, (0), 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-24 21:43:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 479 transitions. [2023-11-24 21:43:54,818 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 479 transitions. Word has length 24 [2023-11-24 21:43:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:54,818 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 479 transitions. [2023-11-24 21:43:54,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 479 transitions. [2023-11-24 21:43:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-24 21:43:54,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:54,819 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, 1] [2023-11-24 21:43:54,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-24 21:43:54,820 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:54,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1025531656, now seen corresponding path program 1 times [2023-11-24 21:43:54,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412813762] [2023-11-24 21:43:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:55,104 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-24 21:43:55,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412813762] [2023-11-24 21:43:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412813762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:55,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:43:55,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951046508] [2023-11-24 21:43:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:55,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:43:55,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:55,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:43:55,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:43:55,106 INFO L87 Difference]: Start difference. First operand 322 states and 479 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:43:56,026 INFO L93 Difference]: Finished difference Result 459 states and 665 transitions. [2023-11-24 21:43:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:43:56,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-24 21:43:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:43:56,029 INFO L225 Difference]: With dead ends: 459 [2023-11-24 21:43:56,029 INFO L226 Difference]: Without dead ends: 459 [2023-11-24 21:43:56,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-11-24 21:43:56,030 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 225 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 21:43:56,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 624 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-24 21:43:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-11-24 21:43:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 323. [2023-11-24 21:43:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 275 states have (on average 1.7454545454545454) internal successors, (480), 322 states have internal predecessors, (480), 0 states have call successors, (0), 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-24 21:43:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 480 transitions. [2023-11-24 21:43:56,039 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 480 transitions. Word has length 25 [2023-11-24 21:43:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:43:56,040 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 480 transitions. [2023-11-24 21:43:56,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2023-11-24 21:43:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:43:56,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:43:56,041 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:56,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-24 21:43:56,041 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-24 21:43:56,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash -276512424, now seen corresponding path program 1 times [2023-11-24 21:43:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20611021] [2023-11-24 21:43:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:56,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20611021] [2023-11-24 21:43:56,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20611021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:43:56,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333003123] [2023-11-24 21:43:56,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:56,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:43:56,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:43:56,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:43:56,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b8e9d5-13a3-4f8c-84ef-08c04acba817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:43:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:56,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-24 21:43:56,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:43:56,890 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:43:56,925 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 21:43:56,936 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 21:43:56,980 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 19 treesize of output 18 [2023-11-24 21:43:56,990 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 19 treesize of output 18 [2023-11-24 21:43:57,015 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:43:57,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 21:43:57,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-24 21:43:57,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-24 21:43:57,297 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:43:57,297 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 55 treesize of output 48 [2023-11-24 21:43:57,305 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 31 treesize of output 16 [2023-11-24 21:43:57,386 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:43:57,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 21:43:57,626 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 40 treesize of output 29 [2023-11-24 21:43:57,646 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 23 treesize of output 16 [2023-11-24 21:43:57,811 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:43:57,812 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 64 treesize of output 55 [2023-11-24 21:43:57,825 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 31 treesize of output 16 [2023-11-24 21:43:58,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 21:43:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:43:58,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:43:58,359 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1113 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_1114 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (forall ((v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= 1 (select |c_#valid| .cse0)) (= .cse0 0))))) is different from false [2023-11-24 21:43:58,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1114 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse0 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1113 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse1 .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) 1)))))) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse3 0) (= (select |c_#valid| .cse3) 1)))))) is different from false [2023-11-24 21:43:58,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:43:58,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 158 [2023-11-24 21:43:58,960 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse0 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store .cse1 .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse4) (= 0 .cse4) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) .cse4))))) (or (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse7) (= 0 .cse7)))) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse10 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse10) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (let ((.cse12 (select (select (store .cse13 .cse11 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse11 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse12) (= .cse12 .cse10))))))))) (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (let ((.cse16 (select (select (store .cse18 .cse15 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse15 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse16) (= .cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse19) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse20 (select (select (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse20) (= .cse20 .cse19)))) (= 0 .cse19)))))) is different from false [2023-11-24 21:43:59,116 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse2 (select (select (store .cse5 .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse0 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= .cse1 .cse2) (= .cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse6 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse1 .cse6) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse8 (select (select (store .cse9 .cse7 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse7 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse1 .cse8) (= .cse8 .cse6))))))))) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= .cse1 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= 0 .cse12) (= .cse1 .cse12))))) (or (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= .cse1 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (forall ((v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1112) .cse15 v_ArrVal_1114) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= .cse1 (select (select (store .cse16 .cse15 v_ArrVal_1113) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse17 (select (select (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= 0 .cse17) (= .cse1 .cse17) (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) .cse17))))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse21 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_prenex_3)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (let ((.cse20 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1111))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1113)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse1 .cse20) (= .cse20 .cse21)))) (= 0 .cse21) (= .cse1 .cse21))))))) is different from false [2023-11-24 21:44:02,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:44:02,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1380 treesize of output 1534