./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.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/heap-manipulation/dancing.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', 'c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a'] 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/heap-manipulation/dancing.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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:40:16,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:40:16,692 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:40:16,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:40:16,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:40:16,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:40:16,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:40:16,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:40:16,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:40:16,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:40:16,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:40:16,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:40:16,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:40:16,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:40:16,728 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:40:16,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:40:16,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:40:16,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:40:16,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:40:16,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:40:16,729 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:40:16,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:40:16,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:40:16,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:40:16,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:40:16,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:40:16,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:40:16,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:40:16,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:40:16,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:40:16,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:40:16,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:40:16,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:40:16,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:40:16,732 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2024-11-07 16:40:16,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:40:16,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:40:16,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:40:16,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:40:16,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:40:16,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-07 16:40:18,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:40:18,543 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:40:18,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-07 16:40:18,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac2874137/2ffb231bf758425cbd2ac03662112e1a/FLAG064fae028 [2024-11-07 16:40:18,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac2874137/2ffb231bf758425cbd2ac03662112e1a [2024-11-07 16:40:18,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:40:18,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:40:18,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:40:18,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:40:18,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:40:18,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:40:18" (1/1) ... [2024-11-07 16:40:18,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f42fe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:18, skipping insertion in model container [2024-11-07 16:40:18,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:40:18" (1/1) ... [2024-11-07 16:40:18,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:40:19,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:40:19,111 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:40:19,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:40:19,180 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:40:19,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19 WrapperNode [2024-11-07 16:40:19,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:40:19,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:40:19,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:40:19,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:40:19,188 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:40:19" (1/1) ... [2024-11-07 16:40:19,203 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:40:19" (1/1) ... [2024-11-07 16:40:19,222 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2024-11-07 16:40:19,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:40:19,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:40:19,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:40:19,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:40:19,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,253 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-07 16:40:19,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:40:19,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:40:19,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:40:19,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:40:19,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (1/1) ... [2024-11-07 16:40:19,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:40:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:19,313 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:40:19,317 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:40:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2024-11-07 16:40:19,340 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2024-11-07 16:40:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 16:40:19,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:40:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:40:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:40:19,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:40:19,448 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:40:19,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:40:19,785 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-11-07 16:40:19,785 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:40:19,794 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:40:19,795 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 16:40:19,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:40:19 BoogieIcfgContainer [2024-11-07 16:40:19,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:40:19,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:40:19,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:40:19,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:40:19,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:40:18" (1/3) ... [2024-11-07 16:40:19,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b70e511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:40:19, skipping insertion in model container [2024-11-07 16:40:19,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:19" (2/3) ... [2024-11-07 16:40:19,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b70e511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:40:19, skipping insertion in model container [2024-11-07 16:40:19,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:40:19" (3/3) ... [2024-11-07 16:40:19,817 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2024-11-07 16:40:19,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:40:19,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-07 16:40:19,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:40:19,878 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;@7bb36e3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:40:19,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-07 16:40:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 57 states have (on average 2.017543859649123) internal successors, (115), 101 states have internal predecessors, (115), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:40:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:40:19,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:19,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:40:19,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:19,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash 47731, now seen corresponding path program 1 times [2024-11-07 16:40:19,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719228727] [2024-11-07 16:40:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:20,059 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:40:20,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:20,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719228727] [2024-11-07 16:40:20,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719228727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:20,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:20,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:40:20,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779738169] [2024-11-07 16:40:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:20,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:40:20,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:40:20,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:40:20,093 INFO L87 Difference]: Start difference. First operand has 110 states, 57 states have (on average 2.017543859649123) internal successors, (115), 101 states have internal predecessors, (115), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:40:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:20,228 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2024-11-07 16:40:20,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:40:20,230 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:40:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:20,236 INFO L225 Difference]: With dead ends: 107 [2024-11-07 16:40:20,236 INFO L226 Difference]: Without dead ends: 105 [2024-11-07 16:40:20,239 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:40:20,243 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:20,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 97 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-07 16:40:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-07 16:40:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 55 states have (on average 1.9272727272727272) internal successors, (106), 96 states have internal predecessors, (106), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:40:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-07 16:40:20,288 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 3 [2024-11-07 16:40:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:20,289 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-07 16:40:20,289 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:40:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-07 16:40:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:40:20,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:20,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:40:20,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:40:20,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:20,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash 47732, now seen corresponding path program 1 times [2024-11-07 16:40:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:20,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714810707] [2024-11-07 16:40:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:20,409 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:40:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:20,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714810707] [2024-11-07 16:40:20,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714810707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:20,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:20,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:40:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30659804] [2024-11-07 16:40:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:20,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:40:20,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:20,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:40:20,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:40:20,411 INFO L87 Difference]: Start difference. First operand 105 states and 118 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:40:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:20,512 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-07 16:40:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:40:20,512 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:40:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:20,513 INFO L225 Difference]: With dead ends: 103 [2024-11-07 16:40:20,513 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 16:40:20,513 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:40:20,514 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:20,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 95 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 16:40:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 16:40:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 94 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:40:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-07 16:40:20,525 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 3 [2024-11-07 16:40:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:20,526 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-07 16:40:20,526 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:40:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-07 16:40:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:40:20,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:20,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:20,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:40:20,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:20,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1278588, now seen corresponding path program 1 times [2024-11-07 16:40:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:20,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634352791] [2024-11-07 16:40:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:20,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:20,605 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:40:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:20,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634352791] [2024-11-07 16:40:20,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634352791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:20,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:20,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:40:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705674179] [2024-11-07 16:40:20,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:20,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:40:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:40:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:40:20,607 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:20,697 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-11-07 16:40:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:40:20,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 16:40:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:20,698 INFO L225 Difference]: With dead ends: 102 [2024-11-07 16:40:20,698 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 16:40:20,698 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:40:20,699 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:20,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 168 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 16:40:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-07 16:40:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 92 states have internal predecessors, (102), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:40:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-07 16:40:20,705 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 9 [2024-11-07 16:40:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:20,706 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-07 16:40:20,706 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), 0 states have call successors, (0), 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:40:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-07 16:40:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:40:20,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:20,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:20,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:40:20,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:20,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1278589, now seen corresponding path program 1 times [2024-11-07 16:40:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:20,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995094246] [2024-11-07 16:40:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:20,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:20,889 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:40:20,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:20,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995094246] [2024-11-07 16:40:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995094246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:20,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:20,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:40:20,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34081346] [2024-11-07 16:40:20,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:20,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:40:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:20,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:40:20,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:40:20,891 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:20,968 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2024-11-07 16:40:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:40:20,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 16:40:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:20,970 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:40:20,970 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:40:20,970 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:40:20,971 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:20,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 170 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:40:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-07 16:40:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 90 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:40:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-07 16:40:20,980 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 9 [2024-11-07 16:40:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:20,981 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-07 16:40:20,981 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), 0 states have call successors, (0), 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:40:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-07 16:40:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:40:20,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:20,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:20,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:40:20,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1230885448, now seen corresponding path program 1 times [2024-11-07 16:40:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130440914] [2024-11-07 16:40:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:21,137 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:40:21,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:21,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130440914] [2024-11-07 16:40:21,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130440914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:21,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:21,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:40:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516038804] [2024-11-07 16:40:21,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:21,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:40:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:40:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:40:21,140 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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:40:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:21,229 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2024-11-07 16:40:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:40:21,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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:40:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:21,230 INFO L225 Difference]: With dead ends: 174 [2024-11-07 16:40:21,230 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 16:40:21,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:40:21,231 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 73 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:21,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 403 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 16:40:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2024-11-07 16:40:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:40:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2024-11-07 16:40:21,244 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 11 [2024-11-07 16:40:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:21,244 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2024-11-07 16:40:21,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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:40:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2024-11-07 16:40:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:40:21,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:21,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:21,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:40:21,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:21,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1228723583, now seen corresponding path program 1 times [2024-11-07 16:40:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28850074] [2024-11-07 16:40:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:21,409 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:40:21,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28850074] [2024-11-07 16:40:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28850074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:21,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:40:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171080811] [2024-11-07 16:40:21,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:21,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:40:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:40:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:40:21,414 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:21,531 INFO L93 Difference]: Finished difference Result 141 states and 194 transitions. [2024-11-07 16:40:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:40:21,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 16:40:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:21,534 INFO L225 Difference]: With dead ends: 141 [2024-11-07 16:40:21,534 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 16:40:21,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:40:21,535 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 205 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:21,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 109 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 16:40:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-07 16:40:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 93 states have (on average 1.8709677419354838) internal successors, (174), 128 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:40:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2024-11-07 16:40:21,543 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 11 [2024-11-07 16:40:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:21,543 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2024-11-07 16:40:21,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2024-11-07 16:40:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:40:21,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:21,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:21,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:40:21,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:21,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:21,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1228723584, now seen corresponding path program 1 times [2024-11-07 16:40:21,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:21,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573887952] [2024-11-07 16:40:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:21,739 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:40:21,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573887952] [2024-11-07 16:40:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573887952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:40:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294795815] [2024-11-07 16:40:21,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:21,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:40:21,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:21,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:40:21,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:40:21,741 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:21,840 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2024-11-07 16:40:21,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:40:21,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 16:40:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:21,841 INFO L225 Difference]: With dead ends: 140 [2024-11-07 16:40:21,841 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 16:40:21,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:40:21,842 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 139 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:21,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 110 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 16:40:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-07 16:40:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:40:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2024-11-07 16:40:21,855 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 11 [2024-11-07 16:40:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:21,856 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2024-11-07 16:40:21,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2024-11-07 16:40:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:40:21,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:21,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:21,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:40:21,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:21,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash -987102938, now seen corresponding path program 1 times [2024-11-07 16:40:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:21,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123488418] [2024-11-07 16:40:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:21,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:21,937 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:40:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:21,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123488418] [2024-11-07 16:40:21,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123488418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:21,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:21,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:40:21,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659833451] [2024-11-07 16:40:21,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:21,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:40:21,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:40:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:40:21,940 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:22,149 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2024-11-07 16:40:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:40:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-07 16:40:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:22,151 INFO L225 Difference]: With dead ends: 161 [2024-11-07 16:40:22,151 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 16:40:22,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:40:22,152 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 273 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:22,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 176 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:40:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 16:40:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2024-11-07 16:40:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.7311827956989247) internal successors, (161), 122 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:40:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2024-11-07 16:40:22,166 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 16 [2024-11-07 16:40:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2024-11-07 16:40:22,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2024-11-07 16:40:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:40:22,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:22,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:40:22,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -987102937, now seen corresponding path program 1 times [2024-11-07 16:40:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829302836] [2024-11-07 16:40:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:22,366 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:40:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:22,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829302836] [2024-11-07 16:40:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829302836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:40:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937100348] [2024-11-07 16:40:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:22,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:40:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:40:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:40:22,370 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:22,620 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2024-11-07 16:40:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:40:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-07 16:40:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:22,623 INFO L225 Difference]: With dead ends: 156 [2024-11-07 16:40:22,623 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 16:40:22,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:40:22,623 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 194 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:22,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 234 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:40:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 16:40:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 135. [2024-11-07 16:40:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.6666666666666667) internal successors, (155), 122 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:40:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2024-11-07 16:40:22,631 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 16 [2024-11-07 16:40:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:22,631 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2024-11-07 16:40:22,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2024-11-07 16:40:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:40:22,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:22,632 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:40:22,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:40:22,632 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:22,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash 812586538, now seen corresponding path program 1 times [2024-11-07 16:40:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:22,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892867178] [2024-11-07 16:40:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:22,950 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:40:22,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:22,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892867178] [2024-11-07 16:40:22,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892867178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:22,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:22,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:40:22,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658778806] [2024-11-07 16:40:22,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:22,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:40:22,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:22,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:40:22,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:40:22,952 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:23,160 INFO L93 Difference]: Finished difference Result 184 states and 234 transitions. [2024-11-07 16:40:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:40:23,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-07 16:40:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:23,161 INFO L225 Difference]: With dead ends: 184 [2024-11-07 16:40:23,161 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 16:40:23,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:40:23,162 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 199 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:23,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 401 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 16:40:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 144. [2024-11-07 16:40:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 130 states have internal predecessors, (165), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 16:40:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2024-11-07 16:40:23,168 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 20 [2024-11-07 16:40:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:23,169 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2024-11-07 16:40:23,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2024-11-07 16:40:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:40:23,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:23,170 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:23,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:40:23,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:23,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1967618707, now seen corresponding path program 1 times [2024-11-07 16:40:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950011801] [2024-11-07 16:40:23,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950011801] [2024-11-07 16:40:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950011801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297785651] [2024-11-07 16:40:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:23,257 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:40:23,258 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:40:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:23,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:40:23,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:23,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:23,460 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:40:23,461 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 12 treesize of output 11 [2024-11-07 16:40:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297785651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:23,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-07 16:40:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143292895] [2024-11-07 16:40:23,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:40:23,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:23,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:40:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:40:23,477 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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:40:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:23,650 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2024-11-07 16:40:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:40:23,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:40:23,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:23,652 INFO L225 Difference]: With dead ends: 158 [2024-11-07 16:40:23,652 INFO L226 Difference]: Without dead ends: 158 [2024-11-07 16:40:23,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:40:23,653 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 141 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:23,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 197 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:40:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-07 16:40:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2024-11-07 16:40:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.6203703703703705) internal successors, (175), 136 states have internal predecessors, (175), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:40:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 199 transitions. [2024-11-07 16:40:23,663 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 199 transitions. Word has length 20 [2024-11-07 16:40:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:23,663 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 199 transitions. [2024-11-07 16:40:23,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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:40:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 199 transitions. [2024-11-07 16:40:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:40:23,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:23,664 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:23,682 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:40:23,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 16:40:23,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:23,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1967618706, now seen corresponding path program 1 times [2024-11-07 16:40:23,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:23,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029954392] [2024-11-07 16:40:23,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:23,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029954392] [2024-11-07 16:40:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029954392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174261423] [2024-11-07 16:40:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:24,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:24,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:24,075 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:40:24,077 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:40:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:24,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 16:40:24,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:24,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:24,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:40:24,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-07 16:40:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174261423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:24,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 16 [2024-11-07 16:40:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432860595] [2024-11-07 16:40:24,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:24,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 16:40:24,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:24,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 16:40:24,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-07 16:40:24,544 INFO L87 Difference]: Start difference. First operand 152 states and 199 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:24,835 INFO L93 Difference]: Finished difference Result 156 states and 204 transitions. [2024-11-07 16:40:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:40:24,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 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:40:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:24,836 INFO L225 Difference]: With dead ends: 156 [2024-11-07 16:40:24,836 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 16:40:24,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:40:24,837 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 346 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:24,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 215 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:40:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 16:40:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2024-11-07 16:40:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.5925925925925926) internal successors, (172), 135 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:40:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 196 transitions. [2024-11-07 16:40:24,845 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 196 transitions. Word has length 20 [2024-11-07 16:40:24,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:24,846 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 196 transitions. [2024-11-07 16:40:24,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:24,846 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 196 transitions. [2024-11-07 16:40:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:40:24,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:24,848 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:40:24,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:40:25,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:25,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:25,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -461951124, now seen corresponding path program 1 times [2024-11-07 16:40:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:25,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659277479] [2024-11-07 16:40:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:25,255 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:40:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:25,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659277479] [2024-11-07 16:40:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659277479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:25,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:25,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:40:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999114892] [2024-11-07 16:40:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:40:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:25,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:40:25,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:40:25,257 INFO L87 Difference]: Start difference. First operand 151 states and 196 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:25,414 INFO L93 Difference]: Finished difference Result 186 states and 237 transitions. [2024-11-07 16:40:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:40:25,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-07 16:40:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:25,416 INFO L225 Difference]: With dead ends: 186 [2024-11-07 16:40:25,416 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 16:40:25,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:40:25,416 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 76 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:25,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 395 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 16:40:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 153. [2024-11-07 16:40:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 110 states have (on average 1.5818181818181818) internal successors, (174), 137 states have internal predecessors, (174), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:40:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2024-11-07 16:40:25,426 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 22 [2024-11-07 16:40:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:25,426 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2024-11-07 16:40:25,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2024-11-07 16:40:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:40:25,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:25,429 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:25,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:40:25,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:25,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash -22381279, now seen corresponding path program 1 times [2024-11-07 16:40:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:25,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852784205] [2024-11-07 16:40:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:25,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:40:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852784205] [2024-11-07 16:40:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852784205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598243996] [2024-11-07 16:40:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:25,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:25,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:25,543 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:40:25,544 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:40:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:25,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:40:25,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:25,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:25,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598243996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:25,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:25,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-07 16:40:25,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973985755] [2024-11-07 16:40:25,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:25,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 16:40:25,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:25,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 16:40:25,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:40:25,866 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:40:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:26,249 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2024-11-07 16:40:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:40:26,249 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-07 16:40:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:26,250 INFO L225 Difference]: With dead ends: 180 [2024-11-07 16:40:26,250 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 16:40:26,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:40:26,251 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 230 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:26,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 483 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:40:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 16:40:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2024-11-07 16:40:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 110 states have (on average 1.5727272727272728) internal successors, (173), 137 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:40:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2024-11-07 16:40:26,257 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 25 [2024-11-07 16:40:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:26,257 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2024-11-07 16:40:26,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:40:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2024-11-07 16:40:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:40:26,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:26,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:26,274 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:40:26,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:26,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:26,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:26,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1600307457, now seen corresponding path program 1 times [2024-11-07 16:40:26,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:26,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808921249] [2024-11-07 16:40:26,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:26,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:26,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808921249] [2024-11-07 16:40:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808921249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585949080] [2024-11-07 16:40:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:26,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:26,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:26,828 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:40:26,830 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:40:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:26,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:40:26,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:26,978 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:40:27,023 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:40:27,089 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:40:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:27,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:27,156 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:40:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585949080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:27,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:27,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 20 [2024-11-07 16:40:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174895733] [2024-11-07 16:40:27,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:27,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 16:40:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:27,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 16:40:27,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:40:27,277 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 21 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:28,344 INFO L93 Difference]: Finished difference Result 330 states and 428 transitions. [2024-11-07 16:40:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:40:28,345 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:40:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:28,348 INFO L225 Difference]: With dead ends: 330 [2024-11-07 16:40:28,348 INFO L226 Difference]: Without dead ends: 330 [2024-11-07 16:40:28,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 16:40:28,349 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 402 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:28,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1272 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 16:40:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-07 16:40:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 203. [2024-11-07 16:40:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 149 states have (on average 1.563758389261745) internal successors, (233), 178 states have internal predecessors, (233), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 16:40:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 273 transitions. [2024-11-07 16:40:28,365 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 273 transitions. Word has length 26 [2024-11-07 16:40:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:28,365 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 273 transitions. [2024-11-07 16:40:28,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 273 transitions. [2024-11-07 16:40:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:40:28,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:28,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:28,385 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:40:28,569 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,SelfDestructingSolverStorable14 [2024-11-07 16:40:28,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:28,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1600307456, now seen corresponding path program 1 times [2024-11-07 16:40:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096747251] [2024-11-07 16:40:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096747251] [2024-11-07 16:40:29,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096747251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287037492] [2024-11-07 16:40:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:29,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:29,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:29,151 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:40:29,152 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:40:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:29,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-07 16:40:29,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:29,285 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:40:29,291 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:40:29,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:40:29,407 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 18 treesize of output 13 [2024-11-07 16:40:29,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:40:29,419 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 18 treesize of output 13 [2024-11-07 16:40:29,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:40:29,431 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 18 treesize of output 13 [2024-11-07 16:40:29,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:40:29,439 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 18 treesize of output 13 [2024-11-07 16:40:29,470 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2024-11-07 16:40:29,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-07 16:40:29,486 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-11-07 16:40:29,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-07 16:40:30,017 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 29 treesize of output 11 [2024-11-07 16:40:30,024 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 9 treesize of output 3 [2024-11-07 16:40:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:30,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:33,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:40:33,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-07 16:40:33,095 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 36 treesize of output 24 [2024-11-07 16:40:33,104 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-07 16:40:33,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 1 [2024-11-07 16:40:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:33,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287037492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:33,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:33,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 37 [2024-11-07 16:40:33,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883638378] [2024-11-07 16:40:33,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:33,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-07 16:40:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 16:40:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1183, Unknown=31, NotChecked=0, Total=1332 [2024-11-07 16:40:33,153 INFO L87 Difference]: Start difference. First operand 203 states and 273 transitions. Second operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:35,404 INFO L93 Difference]: Finished difference Result 451 states and 568 transitions. [2024-11-07 16:40:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 16:40:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:40:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:35,407 INFO L225 Difference]: With dead ends: 451 [2024-11-07 16:40:35,408 INFO L226 Difference]: Without dead ends: 451 [2024-11-07 16:40:35,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=451, Invalid=3548, Unknown=33, NotChecked=0, Total=4032 [2024-11-07 16:40:35,410 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 981 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:35,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 2137 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 16:40:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-07 16:40:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 256. [2024-11-07 16:40:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 222 states have internal predecessors, (297), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 16:40:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 353 transitions. [2024-11-07 16:40:35,427 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 353 transitions. Word has length 26 [2024-11-07 16:40:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:35,427 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 353 transitions. [2024-11-07 16:40:35,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:40:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 353 transitions. [2024-11-07 16:40:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:40:35,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:35,429 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, 1, 1, 1, 1, 1] [2024-11-07 16:40:35,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:40:35,633 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,SelfDestructingSolverStorable15 [2024-11-07 16:40:35,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:35,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2113819088, now seen corresponding path program 1 times [2024-11-07 16:40:35,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:35,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057646191] [2024-11-07 16:40:35,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:35,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:35,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:35,695 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:40:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:35,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057646191] [2024-11-07 16:40:35,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057646191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:35,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:35,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:40:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071948898] [2024-11-07 16:40:35,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:35,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:40:35,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:40:35,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:40:35,698 INFO L87 Difference]: Start difference. First operand 256 states and 353 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:35,725 INFO L93 Difference]: Finished difference Result 272 states and 374 transitions. [2024-11-07 16:40:35,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:40:35,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-07 16:40:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:35,728 INFO L225 Difference]: With dead ends: 272 [2024-11-07 16:40:35,728 INFO L226 Difference]: Without dead ends: 272 [2024-11-07 16:40:35,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:40:35,729 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:35,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 393 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:40:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-07 16:40:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2024-11-07 16:40:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 194 states have (on average 1.5463917525773196) internal successors, (300), 231 states have internal predecessors, (300), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 23 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 16:40:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 368 transitions. [2024-11-07 16:40:35,741 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 368 transitions. Word has length 27 [2024-11-07 16:40:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:35,741 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 368 transitions. [2024-11-07 16:40:35,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 368 transitions. [2024-11-07 16:40:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:40:35,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:35,743 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, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:40:35,743 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:35,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1091475286, now seen corresponding path program 1 times [2024-11-07 16:40:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718612951] [2024-11-07 16:40:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:35,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:35,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:40:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:35,809 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:40:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718612951] [2024-11-07 16:40:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718612951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:35,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:35,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:40:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920407716] [2024-11-07 16:40:35,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:35,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:40:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:40:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:40:35,811 INFO L87 Difference]: Start difference. First operand 266 states and 368 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:40:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:35,969 INFO L93 Difference]: Finished difference Result 279 states and 360 transitions. [2024-11-07 16:40:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:40:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-07 16:40:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:35,972 INFO L225 Difference]: With dead ends: 279 [2024-11-07 16:40:35,972 INFO L226 Difference]: Without dead ends: 279 [2024-11-07 16:40:35,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:40:35,972 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 177 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:35,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 175 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-07 16:40:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2024-11-07 16:40:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 228 states have internal predecessors, (287), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 23 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 16:40:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 355 transitions. [2024-11-07 16:40:35,987 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 355 transitions. Word has length 28 [2024-11-07 16:40:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:35,988 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 355 transitions. [2024-11-07 16:40:35,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:40:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 355 transitions. [2024-11-07 16:40:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:40:35,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:35,989 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, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:35,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:40:35,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:35,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1091475285, now seen corresponding path program 1 times [2024-11-07 16:40:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:35,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339383522] [2024-11-07 16:40:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:36,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:36,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:40:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:36,110 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:40:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339383522] [2024-11-07 16:40:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339383522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:36,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:40:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21385391] [2024-11-07 16:40:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:36,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:40:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:40:36,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:40:36,112 INFO L87 Difference]: Start difference. First operand 263 states and 355 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:40:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:36,325 INFO L93 Difference]: Finished difference Result 276 states and 352 transitions. [2024-11-07 16:40:36,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:40:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-07 16:40:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:36,327 INFO L225 Difference]: With dead ends: 276 [2024-11-07 16:40:36,328 INFO L226 Difference]: Without dead ends: 276 [2024-11-07 16:40:36,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:40:36,329 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 169 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:36,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 215 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:40:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-07 16:40:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 263. [2024-11-07 16:40:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 194 states have (on average 1.4381443298969072) internal successors, (279), 228 states have internal predecessors, (279), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 23 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 16:40:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 347 transitions. [2024-11-07 16:40:36,340 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 347 transitions. Word has length 28 [2024-11-07 16:40:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:36,340 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 347 transitions. [2024-11-07 16:40:36,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:40:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 347 transitions. [2024-11-07 16:40:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:40:36,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:36,341 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:36,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:40:36,342 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1158319475, now seen corresponding path program 1 times [2024-11-07 16:40:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968476695] [2024-11-07 16:40:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:36,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:40:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968476695] [2024-11-07 16:40:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968476695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:36,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:40:36,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572098515] [2024-11-07 16:40:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:36,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:40:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:36,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:40:36,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:40:36,409 INFO L87 Difference]: Start difference. First operand 263 states and 347 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:36,592 INFO L93 Difference]: Finished difference Result 274 states and 350 transitions. [2024-11-07 16:40:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:40:36,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-07 16:40:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:36,594 INFO L225 Difference]: With dead ends: 274 [2024-11-07 16:40:36,595 INFO L226 Difference]: Without dead ends: 274 [2024-11-07 16:40:36,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:40:36,596 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:36,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 308 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:40:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-07 16:40:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2024-11-07 16:40:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 194 states have (on average 1.4278350515463918) internal successors, (277), 227 states have internal predecessors, (277), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 23 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 16:40:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 345 transitions. [2024-11-07 16:40:36,609 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 345 transitions. Word has length 27 [2024-11-07 16:40:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:36,609 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 345 transitions. [2024-11-07 16:40:36,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 345 transitions. [2024-11-07 16:40:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:40:36,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:36,609 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:36,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:40:36,610 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:36,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1158319474, now seen corresponding path program 1 times [2024-11-07 16:40:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:36,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296759020] [2024-11-07 16:40:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:40:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:36,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296759020] [2024-11-07 16:40:36,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296759020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:36,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:36,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:40:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312154466] [2024-11-07 16:40:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:36,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:40:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:40:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:40:36,718 INFO L87 Difference]: Start difference. First operand 262 states and 345 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:36,911 INFO L93 Difference]: Finished difference Result 269 states and 341 transitions. [2024-11-07 16:40:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:40:36,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-07 16:40:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:36,912 INFO L225 Difference]: With dead ends: 269 [2024-11-07 16:40:36,912 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 16:40:36,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:40:36,913 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 65 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:36,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 323 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:40:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 16:40:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 256. [2024-11-07 16:40:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 194 states have (on average 1.3814432989690721) internal successors, (268), 221 states have internal predecessors, (268), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 23 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 16:40:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 336 transitions. [2024-11-07 16:40:36,922 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 336 transitions. Word has length 27 [2024-11-07 16:40:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:36,923 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 336 transitions. [2024-11-07 16:40:36,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:40:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 336 transitions. [2024-11-07 16:40:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:40:36,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:36,924 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:36,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:40:36,924 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:36,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash 509532327, now seen corresponding path program 1 times [2024-11-07 16:40:36,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:36,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47621339] [2024-11-07 16:40:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:40:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47621339] [2024-11-07 16:40:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47621339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669485410] [2024-11-07 16:40:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:37,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:37,164 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:40:37,178 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:40:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:37,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:40:37,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:37,309 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:40:37,342 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:40:37,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 16:40:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:37,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:37,474 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:40:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669485410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:37,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:37,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 15 [2024-11-07 16:40:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991544717] [2024-11-07 16:40:37,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:37,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 16:40:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:37,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 16:40:37,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:40:37,562 INFO L87 Difference]: Start difference. First operand 256 states and 336 transitions. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:40:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:37,996 INFO L93 Difference]: Finished difference Result 360 states and 444 transitions. [2024-11-07 16:40:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:40:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-07 16:40:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:38,000 INFO L225 Difference]: With dead ends: 360 [2024-11-07 16:40:38,000 INFO L226 Difference]: Without dead ends: 360 [2024-11-07 16:40:38,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:40:38,003 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 400 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:38,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 636 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:40:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-07 16:40:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 303. [2024-11-07 16:40:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 230 states have (on average 1.3695652173913044) internal successors, (315), 259 states have internal predecessors, (315), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 28 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 16:40:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 397 transitions. [2024-11-07 16:40:38,018 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 397 transitions. Word has length 29 [2024-11-07 16:40:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:38,018 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 397 transitions. [2024-11-07 16:40:38,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:40:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 397 transitions. [2024-11-07 16:40:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:40:38,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:38,020 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:38,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 16:40:38,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 16:40:38,225 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:38,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash 509532328, now seen corresponding path program 1 times [2024-11-07 16:40:38,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:38,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924280089] [2024-11-07 16:40:38,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:38,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:39,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:40:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924280089] [2024-11-07 16:40:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924280089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031146443] [2024-11-07 16:40:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:39,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:39,089 INFO L229 MonitoredProcess]: Starting monitored process 8 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:40:39,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 16:40:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:39,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 16:40:39,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:39,230 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:40:39,267 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:40:39,269 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:40:39,409 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:40:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:39,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:39,509 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 70 treesize of output 64 [2024-11-07 16:40:39,511 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 94 treesize of output 82 [2024-11-07 16:40:39,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:40:39,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:40:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:39,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031146443] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:39,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:39,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 6] total 24 [2024-11-07 16:40:39,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831692063] [2024-11-07 16:40:39,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:39,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 16:40:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 16:40:39,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2024-11-07 16:40:39,568 INFO L87 Difference]: Start difference. First operand 303 states and 397 transitions. Second operand has 25 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:40:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:40,908 INFO L93 Difference]: Finished difference Result 432 states and 528 transitions. [2024-11-07 16:40:40,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 16:40:40,909 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-11-07 16:40:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:40,911 INFO L225 Difference]: With dead ends: 432 [2024-11-07 16:40:40,911 INFO L226 Difference]: Without dead ends: 432 [2024-11-07 16:40:40,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=337, Invalid=1303, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 16:40:40,912 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 818 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:40,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 992 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 16:40:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-07 16:40:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 354. [2024-11-07 16:40:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 267 states have (on average 1.3408239700374531) internal successors, (358), 300 states have internal predecessors, (358), 51 states have call successors, (51), 19 states have call predecessors, (51), 19 states have return successors, (51), 34 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-07 16:40:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 460 transitions. [2024-11-07 16:40:40,924 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 460 transitions. Word has length 29 [2024-11-07 16:40:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:40,925 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 460 transitions. [2024-11-07 16:40:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:40:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 460 transitions. [2024-11-07 16:40:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:40:40,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:40,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:40,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 16:40:41,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:41,130 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:41,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1057246167, now seen corresponding path program 1 times [2024-11-07 16:40:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:41,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769012062] [2024-11-07 16:40:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:40:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,337 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:40:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:41,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769012062] [2024-11-07 16:40:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769012062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:41,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:41,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:40:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033666589] [2024-11-07 16:40:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:40:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:41,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:40:41,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:40:41,338 INFO L87 Difference]: Start difference. First operand 354 states and 460 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:40:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:41,511 INFO L93 Difference]: Finished difference Result 364 states and 469 transitions. [2024-11-07 16:40:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:40:41,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-07 16:40:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:41,513 INFO L225 Difference]: With dead ends: 364 [2024-11-07 16:40:41,513 INFO L226 Difference]: Without dead ends: 364 [2024-11-07 16:40:41,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:40:41,513 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 102 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 371 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:41,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 371 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:40:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-07 16:40:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2024-11-07 16:40:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 300 states have internal predecessors, (356), 51 states have call successors, (51), 19 states have call predecessors, (51), 19 states have return successors, (51), 34 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-07 16:40:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 458 transitions. [2024-11-07 16:40:41,526 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 458 transitions. Word has length 31 [2024-11-07 16:40:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:41,526 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 458 transitions. [2024-11-07 16:40:41,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:40:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 458 transitions. [2024-11-07 16:40:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:40:41,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:41,526 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 16:40:41,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 16:40:41,527 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:41,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1349384138, now seen corresponding path program 1 times [2024-11-07 16:40:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478866569] [2024-11-07 16:40:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 16:40:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 16:40:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:40:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478866569] [2024-11-07 16:40:41,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478866569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:40:41,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:40:41,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:40:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992374604] [2024-11-07 16:40:41,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:40:41,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:40:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:40:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:40:41,573 INFO L87 Difference]: Start difference. First operand 354 states and 458 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:40:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:41,601 INFO L93 Difference]: Finished difference Result 352 states and 437 transitions. [2024-11-07 16:40:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:40:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-07 16:40:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:41,604 INFO L225 Difference]: With dead ends: 352 [2024-11-07 16:40:41,604 INFO L226 Difference]: Without dead ends: 352 [2024-11-07 16:40:41,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:40:41,605 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:41,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 259 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:40:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-07 16:40:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 339. [2024-11-07 16:40:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 262 states have (on average 1.3206106870229009) internal successors, (346), 290 states have internal predecessors, (346), 41 states have call successors, (41), 19 states have call predecessors, (41), 19 states have return successors, (41), 29 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 16:40:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 428 transitions. [2024-11-07 16:40:41,627 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 428 transitions. Word has length 33 [2024-11-07 16:40:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:41,628 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 428 transitions. [2024-11-07 16:40:41,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:40:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 428 transitions. [2024-11-07 16:40:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:40:41,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:41,632 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:41,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 16:40:41,632 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:41,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2033877999, now seen corresponding path program 1 times [2024-11-07 16:40:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:41,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32748475] [2024-11-07 16:40:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:40:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:41,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32748475] [2024-11-07 16:40:41,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32748475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:41,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95377849] [2024-11-07 16:40:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:41,843 INFO L229 MonitoredProcess]: Starting monitored process 9 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:40:41,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 16:40:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:41,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-07 16:40:41,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:42,015 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:40:42,019 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:40:42,062 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:40:42,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:40:42,102 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:40:42,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-07 16:40:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:42,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:42,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:40:42,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-07 16:40:42,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:40:42,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-07 16:40:42,730 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 50 treesize of output 38 [2024-11-07 16:40:42,734 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 50 treesize of output 38 [2024-11-07 16:40:42,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-11-07 16:40:42,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-07 16:40:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:42,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95377849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:42,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:42,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 27 [2024-11-07 16:40:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987932968] [2024-11-07 16:40:42,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:42,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:40:42,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:42,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:40:42,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=620, Unknown=1, NotChecked=0, Total=702 [2024-11-07 16:40:42,786 INFO L87 Difference]: Start difference. First operand 339 states and 428 transitions. Second operand has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:40:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:40:43,756 INFO L93 Difference]: Finished difference Result 374 states and 450 transitions. [2024-11-07 16:40:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:40:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2024-11-07 16:40:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:40:43,758 INFO L225 Difference]: With dead ends: 374 [2024-11-07 16:40:43,758 INFO L226 Difference]: Without dead ends: 368 [2024-11-07 16:40:43,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1256, Unknown=1, NotChecked=0, Total=1482 [2024-11-07 16:40:43,759 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 272 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:40:43,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1456 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 16:40:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-07 16:40:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 307. [2024-11-07 16:40:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 261 states have internal predecessors, (305), 38 states have call successors, (38), 18 states have call predecessors, (38), 18 states have return successors, (38), 27 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 16:40:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 381 transitions. [2024-11-07 16:40:43,771 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 381 transitions. Word has length 31 [2024-11-07 16:40:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:40:43,771 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 381 transitions. [2024-11-07 16:40:43,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:40:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 381 transitions. [2024-11-07 16:40:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:40:43,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:40:43,772 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:40:43,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-07 16:40:43,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-07 16:40:43,976 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-07 16:40:43,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:40:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash 360728233, now seen corresponding path program 1 times [2024-11-07 16:40:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:40:43,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570430711] [2024-11-07 16:40:43,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:40:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:44,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:40:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:40:44,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570430711] [2024-11-07 16:40:44,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570430711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:40:44,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929363337] [2024-11-07 16:40:44,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:40:44,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:40:44,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:40:44,433 INFO L229 MonitoredProcess]: Starting monitored process 10 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:40:44,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 16:40:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:40:44,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 16:40:44,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:40:44,615 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:40:44,705 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 20 treesize of output 8 [2024-11-07 16:40:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:44,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:40:44,746 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:40:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:40:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929363337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:40:44,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:40:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 17 [2024-11-07 16:40:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443317241] [2024-11-07 16:40:44,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:40:44,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 16:40:44,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:40:44,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 16:40:44,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-07 16:40:44,778 INFO L87 Difference]: Start difference. First operand 307 states and 381 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:40:48,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:40:52,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:40:56,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:00,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:04,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:09,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:13,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:17,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:21,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:25,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:29,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:33,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:37,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:41,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:45,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:49,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:41:53,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]