./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:29:56,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:29:56,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:29:56,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:29:56,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:29:56,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:29:56,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:29:56,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:29:56,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:29:56,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:29:56,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:29:56,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:29:56,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:29:56,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:29:56,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:29:56,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:29:56,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:29:56,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:29:56,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:29:56,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:29:56,489 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:29:56,489 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:29:56,489 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:29:56,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:29:56,490 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:29:56,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:29:56,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:29:56,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:29:56,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:29:56,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:29:56,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:29:56,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:29:56,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:29:56,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:56,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:29:56,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:29:56,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:29:56,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:29:56,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:29:56,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:29:56,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:29:56,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:29:56,492 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2024-11-07 16:29:56,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:29:56,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:29:56,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:29:56,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:29:56,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:29:56,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2024-11-07 16:29:58,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:29:58,343 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:29:58,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2024-11-07 16:29:58,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/780d87549/82bc2b8465fd4dba92a3e583cfa2b594/FLAG3f24e555c [2024-11-07 16:29:58,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/780d87549/82bc2b8465fd4dba92a3e583cfa2b594 [2024-11-07 16:29:58,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:29:58,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:29:58,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:58,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:29:58,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:29:58,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:58" (1/1) ... [2024-11-07 16:29:58,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da3f906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:58, skipping insertion in model container [2024-11-07 16:29:58,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:58" (1/1) ... [2024-11-07 16:29:58,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:29:59,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:59,068 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:29:59,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:59,157 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:29:59,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59 WrapperNode [2024-11-07 16:29:59,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:59,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:59,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:29:59,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:29:59,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,212 INFO L138 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 367 [2024-11-07 16:29:59,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:59,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:29:59,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:29:59,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:29:59,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,268 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 10, 54]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 5, 6]. [2024-11-07 16:29:59,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:29:59,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:29:59,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:29:59,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:29:59,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (1/1) ... [2024-11-07 16:29:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:59,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:59,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:29:59,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:29:59,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:29:59,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:29:59,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:29:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:29:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:29:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:29:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:29:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 16:29:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:29:59,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:29:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-07 16:29:59,377 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-07 16:29:59,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:29:59,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:30:00,317 INFO L? ?]: Removed 360 outVars from TransFormulas that were not future-live. [2024-11-07 16:30:00,317 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:30:00,342 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:30:00,345 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-07 16:30:00,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:00 BoogieIcfgContainer [2024-11-07 16:30:00,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:30:00,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:30:00,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:30:00,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:30:00,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:29:58" (1/3) ... [2024-11-07 16:30:00,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af69287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:30:00, skipping insertion in model container [2024-11-07 16:30:00,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:59" (2/3) ... [2024-11-07 16:30:00,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af69287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:30:00, skipping insertion in model container [2024-11-07 16:30:00,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:00" (3/3) ... [2024-11-07 16:30:00,357 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2024-11-07 16:30:00,372 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:30:00,373 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2024-11-07 16:30:00,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:30:00,441 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6be30639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:30:00,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-11-07 16:30:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 163 states have (on average 2.1165644171779143) internal successors, (345), 312 states have internal predecessors, (345), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 16:30:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:30:00,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:00,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:30:00,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:00,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:00,458 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-07 16:30:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638644424] [2024-11-07 16:30:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:00,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638644424] [2024-11-07 16:30:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638644424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922561457] [2024-11-07 16:30:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:00,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:00,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:00,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:00,662 INFO L87 Difference]: Start difference. First operand has 326 states, 163 states have (on average 2.1165644171779143) internal successors, (345), 312 states have internal predecessors, (345), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:01,142 INFO L93 Difference]: Finished difference Result 550 states and 604 transitions. [2024-11-07 16:30:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:01,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-07 16:30:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:01,159 INFO L225 Difference]: With dead ends: 550 [2024-11-07 16:30:01,159 INFO L226 Difference]: Without dead ends: 548 [2024-11-07 16:30:01,161 INFO L431 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 [2024-11-07 16:30:01,165 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 243 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:01,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 453 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:30:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-07 16:30:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 410. [2024-11-07 16:30:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 250 states have (on average 2.076) internal successors, (519), 396 states have internal predecessors, (519), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 16:30:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 547 transitions. [2024-11-07 16:30:01,250 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 547 transitions. Word has length 3 [2024-11-07 16:30:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:01,251 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 547 transitions. [2024-11-07 16:30:01,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 547 transitions. [2024-11-07 16:30:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:30:01,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:01,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:30:01,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:30:01,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:01,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-07 16:30:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039668097] [2024-11-07 16:30:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039668097] [2024-11-07 16:30:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039668097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:01,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624851166] [2024-11-07 16:30:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:01,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:01,334 INFO L87 Difference]: Start difference. First operand 410 states and 547 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:01,526 INFO L93 Difference]: Finished difference Result 411 states and 550 transitions. [2024-11-07 16:30:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-07 16:30:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:01,529 INFO L225 Difference]: With dead ends: 411 [2024-11-07 16:30:01,529 INFO L226 Difference]: Without dead ends: 411 [2024-11-07 16:30:01,529 INFO L431 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 [2024-11-07 16:30:01,530 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:01,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 571 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-07 16:30:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2024-11-07 16:30:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 250 states have (on average 2.068) internal successors, (517), 394 states have internal predecessors, (517), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 16:30:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 545 transitions. [2024-11-07 16:30:01,559 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 545 transitions. Word has length 3 [2024-11-07 16:30:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:01,559 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 545 transitions. [2024-11-07 16:30:01,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 545 transitions. [2024-11-07 16:30:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:30:01,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:01,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:01,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:30:01,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:01,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1117393141, now seen corresponding path program 1 times [2024-11-07 16:30:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:01,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291564213] [2024-11-07 16:30:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:01,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291564213] [2024-11-07 16:30:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291564213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:01,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673551810] [2024-11-07 16:30:01,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:01,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:01,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:01,696 INFO L87 Difference]: Start difference. First operand 408 states and 545 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:01,914 INFO L93 Difference]: Finished difference Result 403 states and 540 transitions. [2024-11-07 16:30:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:01,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-07 16:30:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:01,918 INFO L225 Difference]: With dead ends: 403 [2024-11-07 16:30:01,918 INFO L226 Difference]: Without dead ends: 403 [2024-11-07 16:30:01,918 INFO L431 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 [2024-11-07 16:30:01,919 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 35 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:01,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 518 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-07 16:30:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-07 16:30:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 250 states have (on average 2.048) internal successors, (512), 389 states have internal predecessors, (512), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 16:30:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 540 transitions. [2024-11-07 16:30:01,936 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 540 transitions. Word has length 10 [2024-11-07 16:30:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:01,936 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 540 transitions. [2024-11-07 16:30:01,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 540 transitions. [2024-11-07 16:30:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:30:01,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:01,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:01,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:30:01,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:01,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1117393142, now seen corresponding path program 1 times [2024-11-07 16:30:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974994797] [2024-11-07 16:30:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:02,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:02,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974994797] [2024-11-07 16:30:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974994797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:02,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026649883] [2024-11-07 16:30:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:02,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:02,083 INFO L87 Difference]: Start difference. First operand 403 states and 540 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:02,269 INFO L93 Difference]: Finished difference Result 398 states and 535 transitions. [2024-11-07 16:30:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-07 16:30:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:02,272 INFO L225 Difference]: With dead ends: 398 [2024-11-07 16:30:02,273 INFO L226 Difference]: Without dead ends: 398 [2024-11-07 16:30:02,273 INFO L431 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 [2024-11-07 16:30:02,274 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 35 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:02,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 531 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-07 16:30:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-11-07 16:30:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 250 states have (on average 2.028) internal successors, (507), 384 states have internal predecessors, (507), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 16:30:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 535 transitions. [2024-11-07 16:30:02,294 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 535 transitions. Word has length 10 [2024-11-07 16:30:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:02,295 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 535 transitions. [2024-11-07 16:30:02,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 535 transitions. [2024-11-07 16:30:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:30:02,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:02,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:02,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:30:02,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 279449431, now seen corresponding path program 1 times [2024-11-07 16:30:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623432898] [2024-11-07 16:30:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623432898] [2024-11-07 16:30:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623432898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:02,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:30:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23891531] [2024-11-07 16:30:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:30:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:02,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:30:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:30:02,481 INFO L87 Difference]: Start difference. First operand 398 states and 535 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:02,994 INFO L93 Difference]: Finished difference Result 525 states and 577 transitions. [2024-11-07 16:30:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:30:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 16:30:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:02,997 INFO L225 Difference]: With dead ends: 525 [2024-11-07 16:30:02,997 INFO L226 Difference]: Without dead ends: 525 [2024-11-07 16:30:02,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:02,998 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 324 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:02,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 658 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:30:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-07 16:30:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 390. [2024-11-07 16:30:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 250 states have (on average 1.996) internal successors, (499), 376 states have internal predecessors, (499), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 16:30:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 527 transitions. [2024-11-07 16:30:03,021 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 527 transitions. Word has length 11 [2024-11-07 16:30:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 527 transitions. [2024-11-07 16:30:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 527 transitions. [2024-11-07 16:30:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:30:03,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:03,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:30:03,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:03,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash 279449432, now seen corresponding path program 1 times [2024-11-07 16:30:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:03,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286881666] [2024-11-07 16:30:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:03,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286881666] [2024-11-07 16:30:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286881666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:03,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:03,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:30:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758679295] [2024-11-07 16:30:03,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:03,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:30:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:30:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:30:03,275 INFO L87 Difference]: Start difference. First operand 390 states and 527 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:03,901 INFO L93 Difference]: Finished difference Result 517 states and 568 transitions. [2024-11-07 16:30:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 16:30:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:03,903 INFO L225 Difference]: With dead ends: 517 [2024-11-07 16:30:03,903 INFO L226 Difference]: Without dead ends: 517 [2024-11-07 16:30:03,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:03,906 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 794 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:03,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 468 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:30:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-07 16:30:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 381. [2024-11-07 16:30:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 250 states have (on average 1.956) internal successors, (489), 367 states have internal predecessors, (489), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 16:30:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 517 transitions. [2024-11-07 16:30:03,924 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 517 transitions. Word has length 11 [2024-11-07 16:30:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:03,924 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 517 transitions. [2024-11-07 16:30:03,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 517 transitions. [2024-11-07 16:30:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:30:03,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:03,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:03,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:30:03,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1072685968, now seen corresponding path program 1 times [2024-11-07 16:30:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388303109] [2024-11-07 16:30:03,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:03,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:04,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388303109] [2024-11-07 16:30:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388303109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:04,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:04,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:30:04,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522883067] [2024-11-07 16:30:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:04,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:30:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:30:04,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:04,289 INFO L87 Difference]: Start difference. First operand 381 states and 517 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:04,415 INFO L93 Difference]: Finished difference Result 403 states and 542 transitions. [2024-11-07 16:30:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:30:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 16:30:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:04,417 INFO L225 Difference]: With dead ends: 403 [2024-11-07 16:30:04,417 INFO L226 Difference]: Without dead ends: 403 [2024-11-07 16:30:04,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:30:04,418 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 35 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:04,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1879 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-07 16:30:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 389. [2024-11-07 16:30:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 257 states have (on average 1.933852140077821) internal successors, (497), 374 states have internal predecessors, (497), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 16:30:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2024-11-07 16:30:04,429 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 20 [2024-11-07 16:30:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2024-11-07 16:30:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2024-11-07 16:30:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:30:04,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:04,430 INFO L215 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] [2024-11-07 16:30:04,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:30:04,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:04,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:04,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1874624237, now seen corresponding path program 1 times [2024-11-07 16:30:04,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:04,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951613533] [2024-11-07 16:30:04,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:04,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951613533] [2024-11-07 16:30:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951613533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:04,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:30:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704610223] [2024-11-07 16:30:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:04,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:30:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:30:04,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:04,776 INFO L87 Difference]: Start difference. First operand 389 states and 527 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:04,970 INFO L93 Difference]: Finished difference Result 396 states and 533 transitions. [2024-11-07 16:30:04,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:30:04,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:30:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:04,973 INFO L225 Difference]: With dead ends: 396 [2024-11-07 16:30:04,973 INFO L226 Difference]: Without dead ends: 396 [2024-11-07 16:30:04,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:30:04,974 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 279 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:04,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1865 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-07 16:30:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 392. [2024-11-07 16:30:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 260 states have (on average 1.9230769230769231) internal successors, (500), 377 states have internal predecessors, (500), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 16:30:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 530 transitions. [2024-11-07 16:30:04,984 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 530 transitions. Word has length 22 [2024-11-07 16:30:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:04,985 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 530 transitions. [2024-11-07 16:30:04,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 530 transitions. [2024-11-07 16:30:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:30:04,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:04,986 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:04,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:30:04,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:04,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash -271188316, now seen corresponding path program 1 times [2024-11-07 16:30:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105053143] [2024-11-07 16:30:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:30:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105053143] [2024-11-07 16:30:05,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105053143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474276385] [2024-11-07 16:30:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:05,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:05,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 16:30:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 16:30:05,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:06,044 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 [2024-11-07 16:30:06,160 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 19 treesize of output 1 [2024-11-07 16:30:06,254 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-07 16:30:06,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2024-11-07 16:30:06,304 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 21 treesize of output 9 [2024-11-07 16:30:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:06,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:06,584 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 40 treesize of output 34 [2024-11-07 16:30:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474276385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:07,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:07,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2024-11-07 16:30:07,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125736875] [2024-11-07 16:30:07,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:07,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 16:30:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 16:30:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:30:07,289 INFO L87 Difference]: Start difference. First operand 392 states and 530 transitions. Second operand has 20 states, 19 states have (on average 4.473684210526316) internal successors, (85), 18 states have internal predecessors, (85), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:30:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:08,978 INFO L93 Difference]: Finished difference Result 533 states and 585 transitions. [2024-11-07 16:30:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:30:08,979 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.473684210526316) internal successors, (85), 18 states have internal predecessors, (85), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-07 16:30:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:08,981 INFO L225 Difference]: With dead ends: 533 [2024-11-07 16:30:08,981 INFO L226 Difference]: Without dead ends: 533 [2024-11-07 16:30:08,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-07 16:30:08,984 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 832 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:08,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 2375 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 16:30:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-07 16:30:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 397. [2024-11-07 16:30:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 265 states have (on average 1.9018867924528302) internal successors, (504), 382 states have internal predecessors, (504), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 16:30:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2024-11-07 16:30:09,001 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 38 [2024-11-07 16:30:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:09,002 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2024-11-07 16:30:09,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.473684210526316) internal successors, (85), 18 states have internal predecessors, (85), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:30:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2024-11-07 16:30:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:30:09,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:09,004 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:09,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:09,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:09,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -271188315, now seen corresponding path program 1 times [2024-11-07 16:30:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960180369] [2024-11-07 16:30:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:10,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:30:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960180369] [2024-11-07 16:30:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960180369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571845156] [2024-11-07 16:30:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:10,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:10,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:10,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:10,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 16:30:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:10,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-07 16:30:10,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:10,635 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 [2024-11-07 16:30:10,646 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 8 treesize of output 1 [2024-11-07 16:30:10,786 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 [2024-11-07 16:30:10,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-07 16:30:10,846 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 13 treesize of output 9 [2024-11-07 16:30:11,005 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-07 16:30:11,005 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 17 treesize of output 17 [2024-11-07 16:30:11,010 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 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-07 16:30:11,105 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 34 treesize of output 12 [2024-11-07 16:30:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:11,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:11,574 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 34 treesize of output 28 [2024-11-07 16:30:11,589 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 76 treesize of output 70 [2024-11-07 16:30:11,702 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 104 treesize of output 98 [2024-11-07 16:30:11,938 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 44 treesize of output 38 [2024-11-07 16:30:12,085 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 44 treesize of output 38 [2024-11-07 16:30:12,231 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 44 treesize of output 38 [2024-11-07 16:30:12,403 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 44 treesize of output 38 [2024-11-07 16:30:12,562 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 44 treesize of output 38 [2024-11-07 16:30:12,714 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 44 treesize of output 38 [2024-11-07 16:30:12,870 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 44 treesize of output 38 [2024-11-07 16:30:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:13,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571845156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:13,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 6] total 23 [2024-11-07 16:30:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672833112] [2024-11-07 16:30:13,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:30:13,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:13,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:30:13,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2024-11-07 16:30:13,009 INFO L87 Difference]: Start difference. First operand 397 states and 534 transitions. Second operand has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:30:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:15,820 INFO L93 Difference]: Finished difference Result 806 states and 922 transitions. [2024-11-07 16:30:15,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 16:30:15,820 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-07 16:30:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:15,825 INFO L225 Difference]: With dead ends: 806 [2024-11-07 16:30:15,825 INFO L226 Difference]: Without dead ends: 806 [2024-11-07 16:30:15,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 16:30:15,826 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1723 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:15,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 1796 Invalid, 3179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 16:30:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-07 16:30:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 396. [2024-11-07 16:30:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 265 states have (on average 1.8981132075471698) internal successors, (503), 381 states have internal predecessors, (503), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 16:30:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 533 transitions. [2024-11-07 16:30:15,844 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 533 transitions. Word has length 38 [2024-11-07 16:30:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:15,845 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 533 transitions. [2024-11-07 16:30:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:30:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 533 transitions. [2024-11-07 16:30:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 16:30:15,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:15,849 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:15,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:30:16,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:16,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:16,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:16,054 INFO L85 PathProgramCache]: Analyzing trace with hash -410521290, now seen corresponding path program 1 times [2024-11-07 16:30:16,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:16,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721409473] [2024-11-07 16:30:16,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:16,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:30:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 16:30:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 16:30:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 16:30:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 16:30:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 16:30:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 16:30:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 16:30:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 16:30:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 16:30:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 16:30:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 16:30:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 16:30:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 16:30:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 91 proven. 77 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 16:30:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721409473] [2024-11-07 16:30:16,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721409473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:16,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220512232] [2024-11-07 16:30:16,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:16,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:16,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:16,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:16,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 16:30:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 1974 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 16:30:17,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2024-11-07 16:30:17,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:30:17,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220512232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:17,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:30:17,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-07 16:30:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957763063] [2024-11-07 16:30:17,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:17,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:17,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:17,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:30:17,023 INFO L87 Difference]: Start difference. First operand 396 states and 533 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 16:30:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:17,033 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2024-11-07 16:30:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:17,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 207 [2024-11-07 16:30:17,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:17,035 INFO L225 Difference]: With dead ends: 397 [2024-11-07 16:30:17,036 INFO L226 Difference]: Without dead ends: 397 [2024-11-07 16:30:17,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:30:17,036 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:17,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 647 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-07 16:30:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-07 16:30:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 266 states have (on average 1.894736842105263) internal successors, (504), 382 states have internal predecessors, (504), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 16:30:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2024-11-07 16:30:17,046 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 207 [2024-11-07 16:30:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:17,046 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2024-11-07 16:30:17,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 16:30:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2024-11-07 16:30:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 16:30:17,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:17,048 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:17,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 16:30:17,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:17,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:17,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash -62401479, now seen corresponding path program 1 times [2024-11-07 16:30:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:17,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681759331] [2024-11-07 16:30:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:17,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:30:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 16:30:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 16:30:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 16:30:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 16:30:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 16:30:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 16:30:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 16:30:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 16:30:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 16:30:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 16:30:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 16:30:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 16:30:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 16:30:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2024-11-07 16:30:18,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681759331] [2024-11-07 16:30:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681759331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769035324] [2024-11-07 16:30:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:18,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:18,740 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:18,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:30:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:19,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:30:19,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:19,374 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 [2024-11-07 16:30:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 337 proven. 13 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 16:30:19,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:19,774 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 32 treesize of output 26 [2024-11-07 16:30:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 1 proven. 337 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2024-11-07 16:30:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769035324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:19,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 23 [2024-11-07 16:30:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268599790] [2024-11-07 16:30:19,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 16:30:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:19,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 16:30:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:30:19,828 INFO L87 Difference]: Start difference. First operand 397 states and 534 transitions. Second operand has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 20 states have internal predecessors, (104), 4 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-07 16:30:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:20,542 INFO L93 Difference]: Finished difference Result 392 states and 526 transitions. [2024-11-07 16:30:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:30:20,543 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 20 states have internal predecessors, (104), 4 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 233 [2024-11-07 16:30:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:20,545 INFO L225 Difference]: With dead ends: 392 [2024-11-07 16:30:20,545 INFO L226 Difference]: Without dead ends: 392 [2024-11-07 16:30:20,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 16:30:20,546 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 581 mSDsluCounter, 3081 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 3376 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:20,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 3376 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:30:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-07 16:30:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-11-07 16:30:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 259 states have (on average 1.9111969111969112) internal successors, (495), 375 states have internal predecessors, (495), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 16:30:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 525 transitions. [2024-11-07 16:30:20,560 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 525 transitions. Word has length 233 [2024-11-07 16:30:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:20,561 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 525 transitions. [2024-11-07 16:30:20,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 20 states have internal predecessors, (104), 4 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-07 16:30:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 525 transitions. [2024-11-07 16:30:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-07 16:30:20,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:20,565 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:20,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 16:30:20,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 16:30:20,766 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:20,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1691751237, now seen corresponding path program 1 times [2024-11-07 16:30:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571097933] [2024-11-07 16:30:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:30:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 16:30:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 16:30:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 16:30:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 16:30:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 16:30:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 16:30:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 16:30:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 16:30:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 16:30:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 16:30:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 16:30:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-07 16:30:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:29,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 16:30:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 13 proven. 78 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2024-11-07 16:30:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571097933] [2024-11-07 16:30:30,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571097933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331333248] [2024-11-07 16:30:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:30,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:30,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:30,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:30,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:30:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:30,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 2208 conjuncts, 253 conjuncts are in the unsatisfiable core [2024-11-07 16:30:30,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:30,789 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 [2024-11-07 16:30:30,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-07 16:30:31,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:31,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 16 [2024-11-07 16:30:31,230 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2024-11-07 16:30:31,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2024-11-07 16:30:31,235 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 43 treesize of output 23 [2024-11-07 16:30:31,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:31,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 22 [2024-11-07 16:30:31,471 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-07 16:30:31,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-07 16:30:31,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-07 16:30:31,651 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-07 16:30:31,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-07 16:30:31,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-07 16:30:31,861 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-07 16:30:31,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-07 16:30:31,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-07 16:30:32,015 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-07 16:30:32,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-07 16:30:32,231 INFO L349 Elim1Store]: treesize reduction 56, result has 41.1 percent of original size [2024-11-07 16:30:32,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2024-11-07 16:30:32,238 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 51 treesize of output 27 [2024-11-07 16:30:32,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:32,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 37 [2024-11-07 16:30:32,507 INFO L349 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2024-11-07 16:30:32,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 76 [2024-11-07 16:30:32,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-07 16:30:32,756 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-07 16:30:32,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-07 16:30:32,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-07 16:30:32,892 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-07 16:30:32,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-07 16:30:33,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-07 16:30:33,018 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-07 16:30:33,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-07 16:30:33,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-07 16:30:33,176 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-07 16:30:33,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-07 16:30:33,366 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_append_~head.offset_89 Int)) (and (<= |c_append_#in~head.offset| v_append_~head.offset_89) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_append_#in~head.base| (let ((.cse0 (+ v_append_~head.offset_89 4))) (store (select |c_old(#memory_$Pointer$#1.base)| |c_append_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_append_#in~head.base|) .cse0))))))) (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2024-11-07 16:30:33,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:30:33,383 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 37 treesize of output 17 [2024-11-07 16:30:33,402 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-07 16:30:33,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2024-11-07 16:30:33,458 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 25 treesize of output 13 [2024-11-07 16:30:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 210 proven. 750 refuted. 0 times theorem prover too weak. 366 trivial. 26 not checked. [2024-11-07 16:30:33,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331333248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:50,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:30:50,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30] total 39 [2024-11-07 16:30:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479254691] [2024-11-07 16:30:50,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:50,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-07 16:30:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-07 16:30:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1654, Unknown=13, NotChecked=84, Total=1980 [2024-11-07 16:30:50,829 INFO L87 Difference]: Start difference. First operand 390 states and 525 transitions. Second operand has 40 states, 37 states have (on average 4.72972972972973) internal successors, (175), 35 states have internal predecessors, (175), 6 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-07 16:30:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:53,865 INFO L93 Difference]: Finished difference Result 529 states and 584 transitions. [2024-11-07 16:30:53,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:30:53,866 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 4.72972972972973) internal successors, (175), 35 states have internal predecessors, (175), 6 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) Word has length 259 [2024-11-07 16:30:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:53,868 INFO L225 Difference]: With dead ends: 529 [2024-11-07 16:30:53,868 INFO L226 Difference]: Without dead ends: 529 [2024-11-07 16:30:53,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 353 SyntacticMatches, 21 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=414, Invalid=2657, Unknown=13, NotChecked=108, Total=3192 [2024-11-07 16:30:53,870 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 798 mSDsluCounter, 3639 mSDsCounter, 0 mSdLazyCounter, 3941 mSolverCounterSat, 79 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 3829 SdHoareTripleChecker+Invalid, 4599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3941 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:53,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 3829 Invalid, 4599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3941 Invalid, 1 Unknown, 578 Unchecked, 2.6s Time] [2024-11-07 16:30:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-07 16:30:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 389. [2024-11-07 16:30:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 264 states have (on average 1.8901515151515151) internal successors, (499), 374 states have internal predecessors, (499), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 16:30:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 529 transitions. [2024-11-07 16:30:53,882 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 529 transitions. Word has length 259 [2024-11-07 16:30:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:53,883 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 529 transitions. [2024-11-07 16:30:53,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 4.72972972972973) internal successors, (175), 35 states have internal predecessors, (175), 6 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-07 16:30:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 529 transitions. [2024-11-07 16:30:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-07 16:30:53,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:53,887 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:53,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:54,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 16:30:54,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-07 16:30:54,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1691751238, now seen corresponding path program 1 times [2024-11-07 16:30:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240386167] [2024-11-07 16:30:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:31:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 16:31:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 16:31:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:03,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 16:31:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 16:31:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:03,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 16:31:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:03,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 16:31:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:04,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 16:31:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:04,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 16:31:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 16:31:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:04,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 16:31:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 16:31:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:04,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-07 16:31:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 16:31:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-07 16:31:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:31:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240386167] [2024-11-07 16:31:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240386167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:31:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574389140] [2024-11-07 16:31:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:31:04,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:31:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:31:04,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:31:04,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 16:31:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:05,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 2208 conjuncts, 408 conjuncts are in the unsatisfiable core [2024-11-07 16:31:05,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:31:05,794 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 [2024-11-07 16:31:05,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:31:05,927 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 [2024-11-07 16:31:05,960 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 17 treesize of output 17 [2024-11-07 16:31:06,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2024-11-07 16:31:06,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:06,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2024-11-07 16:31:06,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 21 [2024-11-07 16:31:06,696 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2024-11-07 16:31:06,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2024-11-07 16:31:06,700 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 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:31:06,704 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 52 treesize of output 28 [2024-11-07 16:31:06,716 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 27 treesize of output 11 [2024-11-07 16:31:07,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:07,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 27 [2024-11-07 16:31:07,072 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-07 16:31:07,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-07 16:31:07,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-07 16:31:07,084 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 27 treesize of output 11 [2024-11-07 16:31:07,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:31:07,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:07,330 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 30 treesize of output 13 [2024-11-07 16:31:07,362 INFO L349 Elim1Store]: treesize reduction 72, result has 35.1 percent of original size [2024-11-07 16:31:07,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 59 [2024-11-07 16:31:07,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 32 [2024-11-07 16:31:07,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:07,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 40 [2024-11-07 16:31:07,832 INFO L349 Elim1Store]: treesize reduction 77, result has 28.7 percent of original size [2024-11-07 16:31:07,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 43 [2024-11-07 16:31:07,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-07 16:31:07,849 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 27 treesize of output 11 [2024-11-07 16:31:08,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2024-11-07 16:31:08,171 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-07 16:31:08,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-11-07 16:31:08,174 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 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-07 16:31:08,177 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 27 treesize of output 11 [2024-11-07 16:31:08,475 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-07 16:31:08,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2024-11-07 16:31:08,479 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 43 treesize of output 23 [2024-11-07 16:31:08,485 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 27 treesize of output 11 [2024-11-07 16:31:08,862 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-07 16:31:08,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-11-07 16:31:08,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2024-11-07 16:31:08,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2024-11-07 16:31:09,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 35 [2024-11-07 16:31:09,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2024-11-07 16:31:09,269 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2024-11-07 16:31:09,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2024-11-07 16:31:09,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 35 [2024-11-07 16:31:09,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2024-11-07 16:31:09,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:09,943 INFO L349 Elim1Store]: treesize reduction 45, result has 33.8 percent of original size [2024-11-07 16:31:09,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 43 [2024-11-07 16:31:09,957 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-07 16:31:09,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-11-07 16:31:10,406 INFO L349 Elim1Store]: treesize reduction 130, result has 30.9 percent of original size [2024-11-07 16:31:10,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 45 treesize of output 81 [2024-11-07 16:31:10,429 INFO L349 Elim1Store]: treesize reduction 89, result has 20.5 percent of original size [2024-11-07 16:31:10,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 68 [2024-11-07 16:31:10,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 47 [2024-11-07 16:31:10,461 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 27 treesize of output 11 [2024-11-07 16:31:10,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:10,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:10,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:10,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:10,784 INFO L349 Elim1Store]: treesize reduction 95, result has 19.5 percent of original size [2024-11-07 16:31:10,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 76 [2024-11-07 16:31:10,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 45 [2024-11-07 16:31:10,864 INFO L349 Elim1Store]: treesize reduction 136, result has 31.0 percent of original size [2024-11-07 16:31:10,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 87 [2024-11-07 16:31:10,903 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 27 treesize of output 11 [2024-11-07 16:31:11,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:11,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 39 [2024-11-07 16:31:11,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:11,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:11,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:11,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:11,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:11,527 INFO L349 Elim1Store]: treesize reduction 95, result has 15.2 percent of original size [2024-11-07 16:31:11,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 66 [2024-11-07 16:31:11,559 INFO L349 Elim1Store]: treesize reduction 36, result has 36.8 percent of original size [2024-11-07 16:31:11,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 39 [2024-11-07 16:31:11,880 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 27 treesize of output 11 [2024-11-07 16:31:12,620 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 208 treesize of output 176 [2024-11-07 16:31:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 452 proven. 790 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-07 16:31:13,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:31:13,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574389140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:31:13,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:31:13,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 54] total 71 [2024-11-07 16:31:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814658161] [2024-11-07 16:31:13,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:31:13,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-11-07 16:31:13,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:31:13,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-11-07 16:31:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=5250, Unknown=3, NotChecked=0, Total=5700 [2024-11-07 16:31:13,556 INFO L87 Difference]: Start difference. First operand 389 states and 529 transitions. Second operand has 72 states, 61 states have (on average 4.081967213114754) internal successors, (249), 57 states have internal predecessors, (249), 18 states have call successors, (28), 5 states have call predecessors, (28), 16 states have return successors, (28), 17 states have call predecessors, (28), 18 states have call successors, (28)