./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/memsafety-ext2/length_test03-2.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', '8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/length_test03-2.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 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:29:47,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:29:47,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:29:47,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:29:47,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:29:47,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:29:47,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:29:47,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:29:47,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:29:47,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:29:47,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:29:47,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:29:47,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:29:47,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:29:47,441 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:29:47,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:29:47,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:29:47,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:47,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:29:47,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:29:47,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:29:47,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:29:47,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:29:47,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:29:47,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:29:47,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:29:47,443 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 -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2024-11-07 16:29:47,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:29:47,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:29:47,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:29:47,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:29:47,696 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:29:47,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-07 16:29:48,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:29:49,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:29:49,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-07 16:29:49,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff59fae72/018f7212c2a14627ad38121c1c4e3e03/FLAG475589597 [2024-11-07 16:29:49,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff59fae72/018f7212c2a14627ad38121c1c4e3e03 [2024-11-07 16:29:49,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:29:49,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:29:49,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:49,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:29:49,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:29:49,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a60683e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49, skipping insertion in model container [2024-11-07 16:29:49,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:29:49,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:49,798 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:29:49,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:49,860 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:29:49,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49 WrapperNode [2024-11-07 16:29:49,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:49,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:49,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:29:49,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:29:49,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,895 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2024-11-07 16:29:49,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:49,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:29:49,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:29:49,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:29:49,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,933 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 6, 7]. [2024-11-07 16:29:49,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:29:49,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:29:49,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:29:49,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:29:49,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (1/1) ... [2024-11-07 16:29:49,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:49,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:29:49,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:29:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:29:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:29:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:29:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:29:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 16:29:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:29:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:29:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-07 16:29:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-07 16:29:50,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:29:50,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:29:50,494 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-07 16:29:50,498 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:29:50,515 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:29:50,515 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 16:29:50,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:29:50 BoogieIcfgContainer [2024-11-07 16:29:50,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:29:50,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:29:50,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:29:50,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:29:50,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:29:49" (1/3) ... [2024-11-07 16:29:50,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333ceb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:29:50, skipping insertion in model container [2024-11-07 16:29:50,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:49" (2/3) ... [2024-11-07 16:29:50,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333ceb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:29:50, skipping insertion in model container [2024-11-07 16:29:50,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:29:50" (3/3) ... [2024-11-07 16:29:50,565 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-11-07 16:29:50,575 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:29:50,575 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-07 16:29:50,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:29:50,616 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;@4900f2c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:29:50,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-07 16:29:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 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:29:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:29:50,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:50,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:29:50,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:50,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-07 16:29:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:50,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358479650] [2024-11-07 16:29:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:50,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:50,805 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:29:50,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358479650] [2024-11-07 16:29:50,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358479650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:50,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:50,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338382146] [2024-11-07 16:29:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:50,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:50,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:50,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:50,843 INFO L87 Difference]: Start difference. First operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 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) 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:29:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:50,974 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2024-11-07 16:29:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:50,976 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:29:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:50,981 INFO L225 Difference]: With dead ends: 167 [2024-11-07 16:29:50,981 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 16:29:50,986 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:29:50,988 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:50,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 172 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 16:29:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2024-11-07 16:29:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 122 states have internal predecessors, (128), 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:29:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2024-11-07 16:29:51,046 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 3 [2024-11-07 16:29:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:51,046 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2024-11-07 16:29:51,046 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:29:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2024-11-07 16:29:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:29:51,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:51,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:29:51,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:29:51,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:51,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-07 16:29:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437648338] [2024-11-07 16:29:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:51,152 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:29:51,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:51,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437648338] [2024-11-07 16:29:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437648338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:51,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669145659] [2024-11-07 16:29:51,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:51,154 INFO L87 Difference]: Start difference. First operand 126 states and 132 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:29:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:51,274 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2024-11-07 16:29:51,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:51,275 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:29:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:51,276 INFO L225 Difference]: With dead ends: 126 [2024-11-07 16:29:51,276 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 16:29:51,276 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:29:51,277 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:51,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 16:29:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-07 16:29:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 120 states have internal predecessors, (126), 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:29:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2024-11-07 16:29:51,286 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2024-11-07 16:29:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:51,286 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2024-11-07 16:29:51,286 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:29:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2024-11-07 16:29:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:29:51,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:51,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:29:51,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:29:51,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:51,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2024-11-07 16:29:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053651350] [2024-11-07 16:29:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:51,328 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:29:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053651350] [2024-11-07 16:29:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053651350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904825712] [2024-11-07 16:29:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:51,330 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:29:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:51,435 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2024-11-07 16:29:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:51,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-07 16:29:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:51,436 INFO L225 Difference]: With dead ends: 140 [2024-11-07 16:29:51,436 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 16:29:51,436 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:29:51,437 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:51,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 16:29:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-07 16:29:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 123 states have internal predecessors, (132), 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:29:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-07 16:29:51,443 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 6 [2024-11-07 16:29:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:51,443 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-07 16:29:51,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:29:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-07 16:29:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:29:51,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:51,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:29:51,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:29:51,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:51,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:51,444 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2024-11-07 16:29:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166133890] [2024-11-07 16:29:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:51,521 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:29:51,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166133890] [2024-11-07 16:29:51,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166133890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:51,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:51,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:51,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626586945] [2024-11-07 16:29:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:51,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:51,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:51,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:51,523 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:29:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:51,591 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-07 16:29:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:51,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-07 16:29:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:51,592 INFO L225 Difference]: With dead ends: 127 [2024-11-07 16:29:51,592 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 16:29:51,593 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:29:51,593 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:51,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 16:29:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-07 16:29:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 121 states have internal predecessors, (130), 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:29:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2024-11-07 16:29:51,600 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2024-11-07 16:29:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:51,600 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2024-11-07 16:29:51,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:29:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2024-11-07 16:29:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:29:51,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:51,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:51,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:29:51,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:51,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552302, now seen corresponding path program 1 times [2024-11-07 16:29:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:51,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649359125] [2024-11-07 16:29:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:51,665 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:29:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649359125] [2024-11-07 16:29:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649359125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:51,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015728329] [2024-11-07 16:29:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:51,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:51,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:51,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:51,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:51,667 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:29:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:51,738 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-07 16:29:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-07 16:29:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:51,740 INFO L225 Difference]: With dead ends: 120 [2024-11-07 16:29:51,740 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 16:29:51,740 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:29:51,740 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:51,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 16:29:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 16:29:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 116 states have internal predecessors, (125), 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:29:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-07 16:29:51,747 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 12 [2024-11-07 16:29:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:51,747 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-07 16:29:51,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:29:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-07 16:29:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:29:51,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:51,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:51,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:29:51,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:51,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552303, now seen corresponding path program 1 times [2024-11-07 16:29:51,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:51,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422577977] [2024-11-07 16:29:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:51,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:51,859 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:29:51,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:51,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422577977] [2024-11-07 16:29:51,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422577977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:51,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:51,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891511474] [2024-11-07 16:29:51,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:51,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:51,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:51,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:51,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:51,862 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:29:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:51,919 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-07 16:29:51,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:51,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-07 16:29:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:51,923 INFO L225 Difference]: With dead ends: 115 [2024-11-07 16:29:51,923 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 16:29:51,923 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:29:51,923 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:51,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 154 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 16:29:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-07 16:29:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 111 states have internal predecessors, (120), 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:29:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-07 16:29:51,932 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2024-11-07 16:29:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:51,932 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-07 16:29:51,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:29:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-07 16:29:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:29:51,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:51,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:51,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:29:51,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:51,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:51,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350391, now seen corresponding path program 1 times [2024-11-07 16:29:51,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:51,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132792406] [2024-11-07 16:29:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:51,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:52,179 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:29:52,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132792406] [2024-11-07 16:29:52,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132792406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:52,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:52,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:29:52,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165076462] [2024-11-07 16:29:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:52,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:29:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:29:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:29:52,181 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:29:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:52,392 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2024-11-07 16:29:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:29:52,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2024-11-07 16:29:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:52,398 INFO L225 Difference]: With dead ends: 221 [2024-11-07 16:29:52,398 INFO L226 Difference]: Without dead ends: 221 [2024-11-07 16:29:52,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:29:52,399 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 240 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:52,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 220 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-07 16:29:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2024-11-07 16:29:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 110 states have (on average 1.6181818181818182) internal successors, (178), 144 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:29:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 182 transitions. [2024-11-07 16:29:52,416 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 182 transitions. Word has length 13 [2024-11-07 16:29:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:52,416 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 182 transitions. [2024-11-07 16:29:52,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:29:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 182 transitions. [2024-11-07 16:29:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:29:52,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:52,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:52,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:29:52,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:52,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350392, now seen corresponding path program 1 times [2024-11-07 16:29:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994568688] [2024-11-07 16:29:52,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:52,715 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:29:52,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:52,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994568688] [2024-11-07 16:29:52,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994568688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:52,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:52,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:29:52,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692165673] [2024-11-07 16:29:52,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:52,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:29:52,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:52,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:29:52,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:29:52,718 INFO L87 Difference]: Start difference. First operand 149 states and 182 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:29:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:52,904 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2024-11-07 16:29:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:29:52,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2024-11-07 16:29:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:52,906 INFO L225 Difference]: With dead ends: 171 [2024-11-07 16:29:52,906 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 16:29:52,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:29:52,907 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 25 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:52,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 330 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 16:29:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-07 16:29:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.558139534883721) internal successors, (201), 163 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:29:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2024-11-07 16:29:52,913 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 13 [2024-11-07 16:29:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:52,913 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2024-11-07 16:29:52,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:29:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2024-11-07 16:29:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:29:52,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:52,915 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:29:52,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:29:52,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:52,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1480883050, now seen corresponding path program 1 times [2024-11-07 16:29:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:52,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776587871] [2024-11-07 16:29:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:53,347 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:29:53,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776587871] [2024-11-07 16:29:53,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776587871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:53,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:53,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:29:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474348548] [2024-11-07 16:29:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:53,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:29:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:29:53,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:29:53,350 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:53,526 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2024-11-07 16:29:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:29:53,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:29:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:53,528 INFO L225 Difference]: With dead ends: 171 [2024-11-07 16:29:53,528 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 16:29:53,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:29:53,529 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:53,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 676 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 16:29:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-07 16:29:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.550387596899225) internal successors, (200), 163 states have internal predecessors, (200), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:29:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2024-11-07 16:29:53,534 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 22 [2024-11-07 16:29:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:53,534 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2024-11-07 16:29:53,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2024-11-07 16:29:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:29:53,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:53,536 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] [2024-11-07 16:29:53,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:29:53,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:53,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -439263795, now seen corresponding path program 1 times [2024-11-07 16:29:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:53,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930794584] [2024-11-07 16:29:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:54,019 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:29:54,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930794584] [2024-11-07 16:29:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930794584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:54,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:54,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:29:54,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729738404] [2024-11-07 16:29:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:54,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:29:54,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:54,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:29:54,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:29:54,021 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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:29:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:54,238 INFO L93 Difference]: Finished difference Result 196 states and 231 transitions. [2024-11-07 16:29:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:29:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 24 [2024-11-07 16:29:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:54,240 INFO L225 Difference]: With dead ends: 196 [2024-11-07 16:29:54,241 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 16:29:54,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:29:54,242 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 113 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:54,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 509 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 16:29:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2024-11-07 16:29:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 154 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:29:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2024-11-07 16:29:54,247 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 24 [2024-11-07 16:29:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:54,248 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2024-11-07 16:29:54,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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:29:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2024-11-07 16:29:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:29:54,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:54,248 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] [2024-11-07 16:29:54,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:29:54,249 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:54,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1442887251, now seen corresponding path program 1 times [2024-11-07 16:29:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:54,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028778499] [2024-11-07 16:29:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:54,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:29:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:54,338 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:29:54,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:54,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028778499] [2024-11-07 16:29:54,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028778499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:54,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428449625] [2024-11-07 16:29:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:54,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:54,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:54,342 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:29:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:54,414 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2024-11-07 16:29:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:29:54,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 30 [2024-11-07 16:29:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:54,415 INFO L225 Difference]: With dead ends: 153 [2024-11-07 16:29:54,415 INFO L226 Difference]: Without dead ends: 153 [2024-11-07 16:29:54,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:54,416 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 13 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:54,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 248 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-07 16:29:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2024-11-07 16:29:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.5) internal successors, (150), 133 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:29:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2024-11-07 16:29:54,421 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 30 [2024-11-07 16:29:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:54,422 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2024-11-07 16:29:54,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:29:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2024-11-07 16:29:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:29:54,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:54,423 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:54,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:29:54,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:54,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash -610198618, now seen corresponding path program 1 times [2024-11-07 16:29:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008305585] [2024-11-07 16:29:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:54,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:29:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:54,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008305585] [2024-11-07 16:29:54,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008305585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:54,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025571662] [2024-11-07 16:29:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:54,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:54,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:54,740 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:29:54,745 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:29:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:54,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:29:54,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:55,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:55,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:29:55,176 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:29:55,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:29:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:55,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:55,454 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 49 treesize of output 45 [2024-11-07 16:29:55,474 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-07 16:29:55,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-07 16:29:55,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:55,604 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 29 treesize of output 33 [2024-11-07 16:29:55,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:55,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2024-11-07 16:29:55,794 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:29:55,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025571662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:55,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:55,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-11-07 16:29:55,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390150649] [2024-11-07 16:29:55,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:55,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:29:55,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:55,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:29:55,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2024-11-07 16:29:55,796 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 20 states have internal predecessors, (77), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:29:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:56,391 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2024-11-07 16:29:56,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:29:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 20 states have internal predecessors, (77), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-07 16:29:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:56,393 INFO L225 Difference]: With dead ends: 173 [2024-11-07 16:29:56,393 INFO L226 Difference]: Without dead ends: 173 [2024-11-07 16:29:56,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2024-11-07 16:29:56,393 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 374 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:56,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 596 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:29:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-07 16:29:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 138. [2024-11-07 16:29:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 132 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:29:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2024-11-07 16:29:56,397 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 32 [2024-11-07 16:29:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:56,397 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2024-11-07 16:29:56,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 20 states have internal predecessors, (77), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:29:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2024-11-07 16:29:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:29:56,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:56,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:56,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:29:56,602 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,SelfDestructingSolverStorable11 [2024-11-07 16:29:56,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:56,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331565, now seen corresponding path program 1 times [2024-11-07 16:29:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:56,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326555336] [2024-11-07 16:29:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:29:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:56,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326555336] [2024-11-07 16:29:56,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326555336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:56,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356878799] [2024-11-07 16:29:56,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:56,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:56,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:56,849 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:29:56,851 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:29:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:56,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 16:29:56,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:56,977 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:29:57,011 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-07 16:29:57,112 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-07 16:29:57,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-07 16:29:57,144 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:29:57,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-07 16:29:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:29:57,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:57,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356878799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:57,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:29:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2024-11-07 16:29:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072814635] [2024-11-07 16:29:57,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:57,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:29:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:29:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-07 16:29:57,206 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:29:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:57,519 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2024-11-07 16:29:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:29:57,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-07 16:29:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:57,520 INFO L225 Difference]: With dead ends: 168 [2024-11-07 16:29:57,520 INFO L226 Difference]: Without dead ends: 168 [2024-11-07 16:29:57,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=283, Unknown=1, NotChecked=36, Total=420 [2024-11-07 16:29:57,521 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 118 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:57,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 325 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2024-11-07 16:29:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-07 16:29:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2024-11-07 16:29:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 105 states have (on average 1.4) internal successors, (147), 135 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:29:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2024-11-07 16:29:57,525 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 33 [2024-11-07 16:29:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2024-11-07 16:29:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:29:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2024-11-07 16:29:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:29:57,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:57,526 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:57,547 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:29:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:57,731 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:29:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331566, now seen corresponding path program 1 times [2024-11-07 16:29:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100719500] [2024-11-07 16:29:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:29:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:58,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:58,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100719500] [2024-11-07 16:29:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100719500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:58,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935007510] [2024-11-07 16:29:58,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:58,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:58,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:58,057 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:29:58,058 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:29:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:58,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 16:29:58,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:58,177 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:29:58,182 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:29:58,261 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2024-11-07 16:29:58,378 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 16:29:58,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-07 16:29:58,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:29:58,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:58,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:29:58,570 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-07 16:29:58,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-07 16:29:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:29:58,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:58,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935007510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:58,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:29:58,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-11-07 16:29:58,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059301919] [2024-11-07 16:29:58,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:58,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 16:29:58,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:58,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 16:29:58,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2024-11-07 16:29:58,917 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:29:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:59,879 INFO L93 Difference]: Finished difference Result 305 states and 340 transitions. [2024-11-07 16:29:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:29:59,880 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 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:29:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:59,881 INFO L225 Difference]: With dead ends: 305 [2024-11-07 16:29:59,881 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 16:29:59,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=764, Unknown=2, NotChecked=58, Total=992 [2024-11-07 16:29:59,882 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 321 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:59,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 665 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 768 Invalid, 0 Unknown, 250 Unchecked, 0.5s Time] [2024-11-07 16:29:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 16:29:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 217. [2024-11-07 16:29:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 206 states have internal predecessors, (248), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-07 16:29:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2024-11-07 16:29:59,891 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 33 [2024-11-07 16:29:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:59,891 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2024-11-07 16:29:59,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:29:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2024-11-07 16:29:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:29:59,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:59,894 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:59,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 16:30:00,097 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:30:00,098 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:00,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813252, now seen corresponding path program 1 times [2024-11-07 16:30:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:00,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614520768] [2024-11-07 16:30:00,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:00,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614520768] [2024-11-07 16:30:00,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614520768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:00,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190171965] [2024-11-07 16:30:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:00,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:00,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:00,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:00,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:30:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:01,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 16:30:01,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:01,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:01,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:30:01,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:30:01,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:01,319 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-07 16:30:01,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-07 16:30:01,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-07 16:30:01,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 16:30:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:01,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:01,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2024-11-07 16:30:01,750 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 106 treesize of output 94 [2024-11-07 16:30:01,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-11-07 16:30:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190171965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:01,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:01,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 25 [2024-11-07 16:30:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535608357] [2024-11-07 16:30:01,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:01,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 16:30:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:01,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 16:30:01,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:30:01,966 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 26 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:30:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:02,663 INFO L93 Difference]: Finished difference Result 267 states and 322 transitions. [2024-11-07 16:30:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:30:02,664 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-07 16:30:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:02,665 INFO L225 Difference]: With dead ends: 267 [2024-11-07 16:30:02,665 INFO L226 Difference]: Without dead ends: 267 [2024-11-07 16:30:02,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 16:30:02,666 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 285 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:02,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 757 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:30:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-07 16:30:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 223. [2024-11-07 16:30:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 182 states have (on average 1.3846153846153846) internal successors, (252), 212 states have internal predecessors, (252), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-07 16:30:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2024-11-07 16:30:02,670 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 41 [2024-11-07 16:30:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:02,670 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2024-11-07 16:30:02,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:30:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2024-11-07 16:30:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 16:30:02,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:02,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:02,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:02,876 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:30:02,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:02,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813253, now seen corresponding path program 1 times [2024-11-07 16:30:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:02,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947784190] [2024-11-07 16:30:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:03,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:03,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947784190] [2024-11-07 16:30:03,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947784190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912445942] [2024-11-07 16:30:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:03,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:03,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:03,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:30:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:03,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 16:30:03,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:03,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:03,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:03,553 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-07 16:30:03,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2024-11-07 16:30:03,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 16:30:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:03,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:03,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-07 16:30:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:04,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912445942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:04,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:04,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2024-11-07 16:30:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885647813] [2024-11-07 16:30:04,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:04,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 16:30:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:04,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 16:30:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:30:04,043 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:30:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:04,522 INFO L93 Difference]: Finished difference Result 225 states and 269 transitions. [2024-11-07 16:30:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:30:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-07 16:30:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:04,525 INFO L225 Difference]: With dead ends: 225 [2024-11-07 16:30:04,526 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 16:30:04,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-07 16:30:04,527 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 100 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:04,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 906 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:30:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 16:30:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-11-07 16:30:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 182 states have (on average 1.379120879120879) internal successors, (251), 212 states have internal predecessors, (251), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-07 16:30:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 265 transitions. [2024-11-07 16:30:04,536 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 265 transitions. Word has length 41 [2024-11-07 16:30:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:04,536 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 265 transitions. [2024-11-07 16:30:04,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:30:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 265 transitions. [2024-11-07 16:30:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:30:04,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:04,537 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:04,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:04,737 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:30:04,738 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:04,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:04,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1836513292, now seen corresponding path program 1 times [2024-11-07 16:30:04,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:04,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723387764] [2024-11-07 16:30:04,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:04,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723387764] [2024-11-07 16:30:05,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723387764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146127967] [2024-11-07 16:30:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:05,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:05,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:05,221 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:30:05,222 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:30:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 16:30:05,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:05,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:05,362 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:05,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:30:05,365 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 11 treesize of output 7 [2024-11-07 16:30:05,368 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 11 treesize of output 7 [2024-11-07 16:30:05,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:30:05,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:30:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:05,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:05,655 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0))) is different from false [2024-11-07 16:30:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146127967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:05,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:30:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 19 [2024-11-07 16:30:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855013023] [2024-11-07 16:30:05,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:05,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:30:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:05,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:30:05,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-07 16:30:05,658 INFO L87 Difference]: Start difference. First operand 223 states and 265 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:30:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:06,122 INFO L93 Difference]: Finished difference Result 304 states and 362 transitions. [2024-11-07 16:30:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:30:06,123 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-07 16:30:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:06,124 INFO L225 Difference]: With dead ends: 304 [2024-11-07 16:30:06,124 INFO L226 Difference]: Without dead ends: 304 [2024-11-07 16:30:06,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=580, Unknown=1, NotChecked=50, Total=756 [2024-11-07 16:30:06,124 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 223 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:06,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 805 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-07 16:30:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 235. [2024-11-07 16:30:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 192 states have (on average 1.359375) internal successors, (261), 222 states have internal predecessors, (261), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-07 16:30:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2024-11-07 16:30:06,129 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 42 [2024-11-07 16:30:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:06,129 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2024-11-07 16:30:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:30:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2024-11-07 16:30:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:30:06,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:06,130 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:06,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:06,333 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,SelfDestructingSolverStorable16 [2024-11-07 16:30:06,333 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:06,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1591414825, now seen corresponding path program 1 times [2024-11-07 16:30:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325495999] [2024-11-07 16:30:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:06,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:07,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325495999] [2024-11-07 16:30:07,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325495999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036655935] [2024-11-07 16:30:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:07,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:07,017 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:30:07,019 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:30:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:07,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 16:30:07,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:07,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:07,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:07,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:30:07,207 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 13 treesize of output 9 [2024-11-07 16:30:07,215 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 13 treesize of output 9 [2024-11-07 16:30:07,500 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:30:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:07,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036655935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:08,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:30:08,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2024-11-07 16:30:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956330790] [2024-11-07 16:30:08,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:08,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:30:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:08,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:30:08,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=613, Unknown=10, NotChecked=0, Total=702 [2024-11-07 16:30:08,486 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:30:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:09,169 INFO L93 Difference]: Finished difference Result 287 states and 341 transitions. [2024-11-07 16:30:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:30:09,170 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-07 16:30:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:09,171 INFO L225 Difference]: With dead ends: 287 [2024-11-07 16:30:09,171 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 16:30:09,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=173, Invalid=1077, Unknown=10, NotChecked=0, Total=1260 [2024-11-07 16:30:09,175 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 175 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:09,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 959 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:30:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 16:30:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 227. [2024-11-07 16:30:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 185 states have (on average 1.3297297297297297) internal successors, (246), 214 states have internal predecessors, (246), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-07 16:30:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 264 transitions. [2024-11-07 16:30:09,185 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 264 transitions. Word has length 44 [2024-11-07 16:30:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 264 transitions. [2024-11-07 16:30:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:30:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2024-11-07 16:30:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:30:09,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:09,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:09,214 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:30:09,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:09,390 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:09,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1452710056, now seen corresponding path program 1 times [2024-11-07 16:30:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337892860] [2024-11-07 16:30:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:09,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:30:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 16:30:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337892860] [2024-11-07 16:30:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337892860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136773365] [2024-11-07 16:30:09,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:09,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:09,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:09,528 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:30:09,530 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:30:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:09,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:30:09,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 16:30:09,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 16:30:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136773365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:09,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-07 16:30:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756928559] [2024-11-07 16:30:09,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:09,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:30:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:09,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:30:09,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:09,713 INFO L87 Difference]: Start difference. First operand 227 states and 264 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:30:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:09,830 INFO L93 Difference]: Finished difference Result 273 states and 314 transitions. [2024-11-07 16:30:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:30:09,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2024-11-07 16:30:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:09,832 INFO L225 Difference]: With dead ends: 273 [2024-11-07 16:30:09,833 INFO L226 Difference]: Without dead ends: 273 [2024-11-07 16:30:09,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:09,834 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 60 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:09,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 339 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-07 16:30:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 263. [2024-11-07 16:30:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 217 states have (on average 1.327188940092166) internal successors, (288), 244 states have internal predecessors, (288), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-07 16:30:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 314 transitions. [2024-11-07 16:30:09,845 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 314 transitions. Word has length 48 [2024-11-07 16:30:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:09,845 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 314 transitions. [2024-11-07 16:30:09,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:30:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 314 transitions. [2024-11-07 16:30:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 16:30:09,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:09,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:09,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 16:30:10,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:10,050 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:10,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash 948068346, now seen corresponding path program 1 times [2024-11-07 16:30:10,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:10,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197194010] [2024-11-07 16:30:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:10,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:10,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:30:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:30:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:10,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197194010] [2024-11-07 16:30:10,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197194010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:10,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743733465] [2024-11-07 16:30:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:10,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:10,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:10,854 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:30:10,855 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:30:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:11,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 16:30:11,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:11,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:30:11,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:11,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:11,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:30:11,182 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-07 16:30:11,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-07 16:30:11,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-07 16:30:11,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 16:30:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:30:11,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:11,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-11-07 16:30:11,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 76 treesize of output 70 [2024-11-07 16:30:11,513 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 106 treesize of output 94 [2024-11-07 16:30:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:30:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743733465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:11,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 24 [2024-11-07 16:30:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922101000] [2024-11-07 16:30:11,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:11,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 16:30:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 16:30:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-11-07 16:30:11,688 INFO L87 Difference]: Start difference. First operand 263 states and 314 transitions. Second operand has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 states have internal predecessors, (125), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:30:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:12,491 INFO L93 Difference]: Finished difference Result 312 states and 358 transitions. [2024-11-07 16:30:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:30:12,492 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 states have internal predecessors, (125), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-07 16:30:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:12,493 INFO L225 Difference]: With dead ends: 312 [2024-11-07 16:30:12,493 INFO L226 Difference]: Without dead ends: 312 [2024-11-07 16:30:12,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 16:30:12,494 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 324 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:12,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 817 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:30:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-07 16:30:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 274. [2024-11-07 16:30:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 227 states have (on average 1.303964757709251) internal successors, (296), 255 states have internal predecessors, (296), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-07 16:30:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 322 transitions. [2024-11-07 16:30:12,509 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 322 transitions. Word has length 60 [2024-11-07 16:30:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:12,509 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 322 transitions. [2024-11-07 16:30:12,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 states have internal predecessors, (125), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:30:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 322 transitions. [2024-11-07 16:30:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 16:30:12,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:12,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:12,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:12,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:12,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:12,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 948068345, now seen corresponding path program 1 times [2024-11-07 16:30:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803952516] [2024-11-07 16:30:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:30:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:30:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803952516] [2024-11-07 16:30:13,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803952516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637901542] [2024-11-07 16:30:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:13,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:13,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:13,316 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:13,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-07 16:30:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:13,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 16:30:13,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:13,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:13,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:13,608 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-07 16:30:13,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2024-11-07 16:30:13,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 16:30:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:30:13,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:13,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-07 16:30:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:30:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637901542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:14,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 21 [2024-11-07 16:30:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35203284] [2024-11-07 16:30:14,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:14,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 16:30:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 16:30:14,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-07 16:30:14,085 INFO L87 Difference]: Start difference. First operand 274 states and 322 transitions. Second operand has 22 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:30:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:14,526 INFO L93 Difference]: Finished difference Result 306 states and 356 transitions. [2024-11-07 16:30:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:30:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-07 16:30:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:14,527 INFO L225 Difference]: With dead ends: 306 [2024-11-07 16:30:14,527 INFO L226 Difference]: Without dead ends: 306 [2024-11-07 16:30:14,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-11-07 16:30:14,528 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 332 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:14,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 792 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:30:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-07 16:30:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 273. [2024-11-07 16:30:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 227 states have (on average 1.2951541850220265) internal successors, (294), 254 states have internal predecessors, (294), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-07 16:30:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 320 transitions. [2024-11-07 16:30:14,536 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 320 transitions. Word has length 60 [2024-11-07 16:30:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:14,536 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 320 transitions. [2024-11-07 16:30:14,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:30:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 320 transitions. [2024-11-07 16:30:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 16:30:14,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:14,537 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:14,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:14,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:14,741 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash 104187406, now seen corresponding path program 1 times [2024-11-07 16:30:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177888308] [2024-11-07 16:30:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 16:30:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 16:30:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-07 16:30:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177888308] [2024-11-07 16:30:14,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177888308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338610021] [2024-11-07 16:30:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:14,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:14,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:14,873 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:14,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-07 16:30:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 16:30:15,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 16:30:15,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:30:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338610021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:30:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-07 16:30:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195322570] [2024-11-07 16:30:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:15,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:15,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:15,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:30:15,072 INFO L87 Difference]: Start difference. First operand 273 states and 320 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:30:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:15,077 INFO L93 Difference]: Finished difference Result 267 states and 312 transitions. [2024-11-07 16:30:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 67 [2024-11-07 16:30:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:15,083 INFO L225 Difference]: With dead ends: 267 [2024-11-07 16:30:15,083 INFO L226 Difference]: Without dead ends: 267 [2024-11-07 16:30:15,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:30:15,084 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:15,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-07 16:30:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-07 16:30:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 222 states have (on average 1.2882882882882882) internal successors, (286), 248 states have internal predecessors, (286), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-07 16:30:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 312 transitions. [2024-11-07 16:30:15,089 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 312 transitions. Word has length 67 [2024-11-07 16:30:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:15,089 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 312 transitions. [2024-11-07 16:30:15,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:30:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 312 transitions. [2024-11-07 16:30:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 16:30:15,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:15,090 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:15,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:15,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 16:30:15,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1345239894, now seen corresponding path program 1 times [2024-11-07 16:30:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915930397] [2024-11-07 16:30:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 16:30:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 16:30:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 16:30:15,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:15,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915930397] [2024-11-07 16:30:15,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915930397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:15,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333871064] [2024-11-07 16:30:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:15,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:15,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:15,652 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:15,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-07 16:30:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:30:15,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:16,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:30:16,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:30:16,133 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:16,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:30:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 16:30:16,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:16,321 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 49 treesize of output 45 [2024-11-07 16:30:16,340 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-07 16:30:16,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-07 16:30:16,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:16,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 29 treesize of output 33 [2024-11-07 16:30:16,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:16,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2024-11-07 16:30:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 16:30:16,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333871064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:16,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:16,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-11-07 16:30:16,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042025387] [2024-11-07 16:30:16,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:16,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:30:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:16,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:30:16,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2024-11-07 16:30:16,654 INFO L87 Difference]: Start difference. First operand 267 states and 312 transitions. Second operand has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 20 states have internal predecessors, (107), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:30:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:17,206 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2024-11-07 16:30:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:30:17,207 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 20 states have internal predecessors, (107), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-11-07 16:30:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:17,208 INFO L225 Difference]: With dead ends: 287 [2024-11-07 16:30:17,208 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 16:30:17,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2024-11-07 16:30:17,209 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 247 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:17,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 819 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:30:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 16:30:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 264. [2024-11-07 16:30:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.2727272727272727) internal successors, (280), 245 states have internal predecessors, (280), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-07 16:30:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2024-11-07 16:30:17,214 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 72 [2024-11-07 16:30:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:17,214 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2024-11-07 16:30:17,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 20 states have internal predecessors, (107), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:30:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2024-11-07 16:30:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 16:30:17,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:17,215 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:17,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:17,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:17,416 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:17,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2134387814, now seen corresponding path program 1 times [2024-11-07 16:30:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:17,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575686979] [2024-11-07 16:30:17,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 16:30:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 16:30:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:30:17,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:17,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575686979] [2024-11-07 16:30:17,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575686979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:17,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555568615] [2024-11-07 16:30:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:17,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:17,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:17,927 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:17,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-07 16:30:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:30:18,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:18,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:30:18,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:18,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-11-07 16:30:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:30:18,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555568615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:18,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:18,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 23 [2024-11-07 16:30:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767941499] [2024-11-07 16:30:18,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:18,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 16:30:18,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 16:30:18,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:30:18,516 INFO L87 Difference]: Start difference. First operand 264 states and 306 transitions. Second operand has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 20 states have internal predecessors, (109), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:30:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:19,026 INFO L93 Difference]: Finished difference Result 279 states and 326 transitions. [2024-11-07 16:30:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:30:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 20 states have internal predecessors, (109), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2024-11-07 16:30:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:19,032 INFO L225 Difference]: With dead ends: 279 [2024-11-07 16:30:19,032 INFO L226 Difference]: Without dead ends: 279 [2024-11-07 16:30:19,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2024-11-07 16:30:19,032 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 79 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:19,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1030 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-07 16:30:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 255. [2024-11-07 16:30:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.2735849056603774) internal successors, (270), 236 states have internal predecessors, (270), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:30:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 294 transitions. [2024-11-07 16:30:19,039 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 294 transitions. Word has length 73 [2024-11-07 16:30:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:19,039 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 294 transitions. [2024-11-07 16:30:19,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 20 states have internal predecessors, (109), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:30:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2024-11-07 16:30:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 16:30:19,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:19,040 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:19,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-07 16:30:19,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:19,241 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:19,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1959490770, now seen corresponding path program 2 times [2024-11-07 16:30:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:19,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118910445] [2024-11-07 16:30:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:19,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 16:30:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 16:30:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-07 16:30:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118910445] [2024-11-07 16:30:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118910445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877467803] [2024-11-07 16:30:19,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:30:19,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:19,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:19,829 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:19,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-07 16:30:20,105 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:30:20,105 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:30:20,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-07 16:30:20,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:20,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:20,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:30:20,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:20,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:30:20,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2024-11-07 16:30:20,378 INFO L349 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2024-11-07 16:30:20,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 22 [2024-11-07 16:30:20,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:30:20,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2024-11-07 16:30:20,642 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-07 16:30:20,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-07 16:30:20,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2024-11-07 16:30:20,849 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 8 treesize of output 4 [2024-11-07 16:30:20,858 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:30:20,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-07 16:30:20,958 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-07 16:30:20,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2024-11-07 16:30:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:21,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:21,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877467803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:21,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:30:21,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 27 [2024-11-07 16:30:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467045465] [2024-11-07 16:30:21,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:21,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:30:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:21,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:30:21,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2024-11-07 16:30:21,281 INFO L87 Difference]: Start difference. First operand 255 states and 294 transitions. Second operand has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 21 states have internal predecessors, (113), 7 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:30:25,364 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:30:29,491 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:30:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:30,602 INFO L93 Difference]: Finished difference Result 292 states and 335 transitions. [2024-11-07 16:30:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:30:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 21 states have internal predecessors, (113), 7 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2024-11-07 16:30:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:30,604 INFO L225 Difference]: With dead ends: 292 [2024-11-07 16:30:30,606 INFO L226 Difference]: Without dead ends: 292 [2024-11-07 16:30:30,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=312, Invalid=2238, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 16:30:30,607 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 341 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:30,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 796 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 963 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-07 16:30:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-07 16:30:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 168. [2024-11-07 16:30:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 158 states have internal predecessors, (174), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:30:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2024-11-07 16:30:30,610 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 75 [2024-11-07 16:30:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:30,611 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2024-11-07 16:30:30,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 21 states have internal predecessors, (113), 7 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:30:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2024-11-07 16:30:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 16:30:30,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:30,618 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:30,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-07 16:30:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-07 16:30:30,819 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash -850577046, now seen corresponding path program 2 times [2024-11-07 16:30:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860144568] [2024-11-07 16:30:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:30:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:31,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:30:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:31,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 16:30:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 16:30:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-07 16:30:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860144568] [2024-11-07 16:30:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860144568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:31,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186175608] [2024-11-07 16:30:31,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:30:31,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:31,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:31,224 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:31,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-07 16:30:31,681 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:30:31,682 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:30:31,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:30:31,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-07 16:30:31,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-07 16:30:31,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186175608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:31,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:31,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2024-11-07 16:30:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232308173] [2024-11-07 16:30:31,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:31,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:30:31,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:31,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:30:31,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:30:31,837 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 18 states have internal predecessors, (81), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 16:30:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:32,351 INFO L93 Difference]: Finished difference Result 203 states and 211 transitions. [2024-11-07 16:30:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 16:30:32,351 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 18 states have internal predecessors, (81), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 102 [2024-11-07 16:30:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:32,352 INFO L225 Difference]: With dead ends: 203 [2024-11-07 16:30:32,352 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 16:30:32,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 16:30:32,363 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 270 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:32,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 812 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 16:30:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2024-11-07 16:30:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 149 states have (on average 1.308724832214765) internal successors, (195), 171 states have internal predecessors, (195), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:30:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2024-11-07 16:30:32,372 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 102 [2024-11-07 16:30:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:32,372 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2024-11-07 16:30:32,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 18 states have internal predecessors, (81), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 16:30:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2024-11-07 16:30:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 16:30:32,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:32,373 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:32,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-07 16:30:32,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-07 16:30:32,576 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:32,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1160568942, now seen corresponding path program 1 times [2024-11-07 16:30:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:32,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247075063] [2024-11-07 16:30:32,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:32,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:30:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:30:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:30:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 16:30:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 16:30:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 16:30:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-07 16:30:33,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247075063] [2024-11-07 16:30:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247075063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164928728] [2024-11-07 16:30:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:33,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:33,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:33,634 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:33,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-07 16:30:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:33,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-07 16:30:34,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:34,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:34,144 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-07 16:30:34,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-11-07 16:30:34,273 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-07 16:30:34,286 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 22 treesize of output 10 [2024-11-07 16:30:34,305 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-07 16:30:34,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-07 16:30:34,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:34,436 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-11-07 16:30:34,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2024-11-07 16:30:34,700 INFO L349 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2024-11-07 16:30:34,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2024-11-07 16:30:34,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 26 [2024-11-07 16:30:34,927 INFO L349 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2024-11-07 16:30:34,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2024-11-07 16:30:34,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 26 [2024-11-07 16:30:35,151 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 48 treesize of output 30 [2024-11-07 16:30:35,183 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2024-11-07 16:30:35,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 52 [2024-11-07 16:30:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 69 proven. 190 refuted. 0 times theorem prover too weak. 37 trivial. 24 not checked. [2024-11-07 16:30:35,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164928728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:35,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:30:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 25] total 29 [2024-11-07 16:30:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787062637] [2024-11-07 16:30:35,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:35,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 16:30:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 16:30:35,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=766, Unknown=1, NotChecked=56, Total=930 [2024-11-07 16:30:35,360 INFO L87 Difference]: Start difference. First operand 183 states and 211 transitions. Second operand has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 27 states have internal predecessors, (147), 5 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-07 16:30:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:36,191 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2024-11-07 16:30:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:30:36,195 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 27 states have internal predecessors, (147), 5 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 148 [2024-11-07 16:30:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:36,196 INFO L225 Difference]: With dead ends: 208 [2024-11-07 16:30:36,196 INFO L226 Difference]: Without dead ends: 208 [2024-11-07 16:30:36,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=1604, Unknown=1, NotChecked=84, Total=1980 [2024-11-07 16:30:36,197 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 136 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:36,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 811 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 797 Invalid, 0 Unknown, 138 Unchecked, 0.5s Time] [2024-11-07 16:30:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-07 16:30:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 182. [2024-11-07 16:30:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 149 states have (on average 1.3020134228187918) internal successors, (194), 170 states have internal predecessors, (194), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:30:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2024-11-07 16:30:36,204 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 148 [2024-11-07 16:30:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:36,204 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2024-11-07 16:30:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 27 states have internal predecessors, (147), 5 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-07 16:30:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2024-11-07 16:30:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 16:30:36,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:36,205 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:36,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-07 16:30:36,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:36,406 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:36,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1160568941, now seen corresponding path program 1 times [2024-11-07 16:30:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:36,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981965661] [2024-11-07 16:30:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:30:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:30:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:37,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:30:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:37,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 16:30:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:37,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 16:30:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 16:30:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-07 16:30:37,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:37,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981965661] [2024-11-07 16:30:37,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981965661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:37,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227582469] [2024-11-07 16:30:37,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:37,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:37,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:37,714 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:37,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-07 16:30:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:38,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-07 16:30:38,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:38,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 16:30:38,328 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-07 16:30:38,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-11-07 16:30:38,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2024-11-07 16:30:38,619 INFO L349 Elim1Store]: treesize reduction 78, result has 35.5 percent of original size [2024-11-07 16:30:38,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 63 [2024-11-07 16:30:38,624 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 57 treesize of output 20 [2024-11-07 16:30:38,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2024-11-07 16:30:39,017 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-07 16:30:39,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-07 16:30:39,055 INFO L349 Elim1Store]: treesize reduction 143, result has 24.7 percent of original size [2024-11-07 16:30:39,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 59 [2024-11-07 16:30:39,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 24 [2024-11-07 16:30:39,535 INFO L349 Elim1Store]: treesize reduction 78, result has 17.0 percent of original size [2024-11-07 16:30:39,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2024-11-07 16:30:39,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 18 [2024-11-07 16:30:39,573 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-07 16:30:39,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-07 16:30:39,905 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2024-11-07 16:30:39,927 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 23 treesize of output 11 [2024-11-07 16:30:39,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:30:39,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:30:39,935 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:30:39,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2024-11-07 16:30:39,965 INFO L349 Elim1Store]: treesize reduction 52, result has 28.8 percent of original size [2024-11-07 16:30:39,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 39 [2024-11-07 16:30:40,153 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-07 16:30:40,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2024-11-07 16:30:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 39 proven. 248 refuted. 0 times theorem prover too weak. 9 trivial. 24 not checked. [2024-11-07 16:30:40,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227582469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:40,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:30:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 33] total 45 [2024-11-07 16:30:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320130581] [2024-11-07 16:30:40,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-07 16:30:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-07 16:30:40,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1909, Unknown=1, NotChecked=90, Total=2256 [2024-11-07 16:30:40,324 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand has 46 states, 45 states have (on average 4.555555555555555) internal successors, (205), 42 states have internal predecessors, (205), 8 states have call successors, (10), 5 states have call predecessors, (10), 11 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-07 16:30:44,351 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:30:48,375 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:30:52,421 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:30:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:53,782 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2024-11-07 16:30:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 16:30:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 4.555555555555555) internal successors, (205), 42 states have internal predecessors, (205), 8 states have call successors, (10), 5 states have call predecessors, (10), 11 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) Word has length 148 [2024-11-07 16:30:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:53,784 INFO L225 Difference]: With dead ends: 219 [2024-11-07 16:30:53,784 INFO L226 Difference]: Without dead ends: 219 [2024-11-07 16:30:53,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=716, Invalid=4254, Unknown=4, NotChecked=138, Total=5112 [2024-11-07 16:30:53,785 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 396 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:53,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 829 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 888 Invalid, 3 Unknown, 156 Unchecked, 12.6s Time] [2024-11-07 16:30:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-07 16:30:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 181. [2024-11-07 16:30:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 169 states have internal predecessors, (193), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:30:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2024-11-07 16:30:53,789 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 148 [2024-11-07 16:30:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:53,789 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2024-11-07 16:30:53,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.555555555555555) internal successors, (205), 42 states have internal predecessors, (205), 8 states have call successors, (10), 5 states have call predecessors, (10), 11 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-07 16:30:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2024-11-07 16:30:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 16:30:53,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:53,790 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:53,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:53,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-07 16:30:53,994 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:30:53,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1384744403, now seen corresponding path program 1 times [2024-11-07 16:30:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:53,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503969575] [2024-11-07 16:30:53,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:53,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:30:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:30:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:30:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:30:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:55,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 16:30:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 16:30:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 16:30:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-07 16:30:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503969575] [2024-11-07 16:30:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503969575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572964601] [2024-11-07 16:30:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:55,963 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:55,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-07 16:30:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:56,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 159 conjuncts are in the unsatisfiable core [2024-11-07 16:30:56,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:56,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:56,438 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:56,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:30:56,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:30:56,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:30:56,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-07 16:30:56,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2024-11-07 16:30:56,719 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-07 16:30:56,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2024-11-07 16:30:56,722 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 45 treesize of output 34 [2024-11-07 16:30:56,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:56,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-07 16:30:56,988 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-07 16:30:56,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2024-11-07 16:30:57,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:57,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-07 16:30:57,191 INFO L349 Elim1Store]: treesize reduction 60, result has 48.7 percent of original size [2024-11-07 16:30:57,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 73 [2024-11-07 16:30:57,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:57,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-07 16:30:57,399 INFO L349 Elim1Store]: treesize reduction 60, result has 48.7 percent of original size [2024-11-07 16:30:57,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 73 [2024-11-07 16:30:57,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:57,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-07 16:30:57,602 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2024-11-07 16:30:57,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2024-11-07 16:30:57,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2024-11-07 16:30:57,917 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 31 treesize of output 23 [2024-11-07 16:30:57,954 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-07 16:30:57,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 54 [2024-11-07 16:30:58,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:58,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 39 [2024-11-07 16:30:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 30 proven. 141 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-07 16:30:58,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:58,262 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6775 (Array Int Int)) (v_append_~node~0.base_141 Int)) (let ((.cse0 (store |c_#valid| v_append_~node~0.base_141 1))) (or (= (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6775) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1) (not (= (select .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base|) (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) 1))))) is different from false [2024-11-07 16:30:58,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572964601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:58,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:30:58,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 35 [2024-11-07 16:30:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202367084] [2024-11-07 16:30:58,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:58,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-07 16:30:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:58,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-07 16:30:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1145, Unknown=1, NotChecked=68, Total=1332 [2024-11-07 16:30:58,268 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand has 36 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:30:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:59,789 INFO L93 Difference]: Finished difference Result 274 states and 307 transitions. [2024-11-07 16:30:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 16:30:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 150 [2024-11-07 16:30:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:59,794 INFO L225 Difference]: With dead ends: 274 [2024-11-07 16:30:59,794 INFO L226 Difference]: Without dead ends: 274 [2024-11-07 16:30:59,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=445, Invalid=3340, Unknown=1, NotChecked=120, Total=3906 [2024-11-07 16:30:59,795 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 384 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:59,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 988 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 16:30:59,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-07 16:30:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 179. [2024-11-07 16:30:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 167 states have internal predecessors, (187), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:30:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2024-11-07 16:30:59,804 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 150 [2024-11-07 16:30:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:59,804 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2024-11-07 16:30:59,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:30:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2024-11-07 16:30:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 16:30:59,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:59,805 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:59,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-07 16:31:00,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-07 16:31:00,010 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:31:00,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:31:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1384744404, now seen corresponding path program 1 times [2024-11-07 16:31:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:31:00,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256387258] [2024-11-07 16:31:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:31:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:31:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:31:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:31:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:02,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:31:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:31:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 16:31:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 16:31:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:02,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 16:31:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-07 16:31:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:31:02,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256387258] [2024-11-07 16:31:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256387258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:31:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337884185] [2024-11-07 16:31:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:31:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:31:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:31:02,751 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:31:02,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-07 16:31:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:03,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 196 conjuncts are in the unsatisfiable core [2024-11-07 16:31:03,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:31:03,222 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:31:03,229 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:31:03,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:31:03,241 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:31:03,245 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:31:03,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:31:03,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:31:03,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-07 16:31:03,348 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 21 treesize of output 20 [2024-11-07 16:31:03,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2024-11-07 16:31:03,727 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 25 treesize of output 18 [2024-11-07 16:31:03,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:03,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:31:03,765 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2024-11-07 16:31:03,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2024-11-07 16:31:03,773 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 54 treesize of output 41 [2024-11-07 16:31:04,313 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 25 treesize of output 18 [2024-11-07 16:31:04,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2024-11-07 16:31:04,331 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 22 treesize of output 14 [2024-11-07 16:31:04,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:04,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-07 16:31:04,346 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-07 16:31:04,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-07 16:31:04,736 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-07 16:31:04,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2024-11-07 16:31:04,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:04,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 35 [2024-11-07 16:31:04,757 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 25 treesize of output 18 [2024-11-07 16:31:04,840 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:31:05,094 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 25 treesize of output 18 [2024-11-07 16:31:05,144 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2024-11-07 16:31:05,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 75 [2024-11-07 16:31:05,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 58 [2024-11-07 16:31:05,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:05,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-07 16:31:05,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:31:05,560 INFO L349 Elim1Store]: treesize reduction 51, result has 31.1 percent of original size [2024-11-07 16:31:05,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2024-11-07 16:31:05,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 45 [2024-11-07 16:31:05,573 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-07 16:31:05,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-07 16:31:06,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 57 [2024-11-07 16:31:06,125 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 47 treesize of output 35 [2024-11-07 16:31:06,150 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-11-07 16:31:06,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 53 [2024-11-07 16:31:06,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2024-11-07 16:31:06,172 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 19 treesize of output 11 [2024-11-07 16:31:06,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-07 16:31:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 52 proven. 262 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:31:06,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:31:06,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse3)) (.cse1 (+ 9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse3)))) (and (or (forall ((v_ArrVal_7546 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_7546) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 5))) (forall ((v_append_~node~0.base_147 Int) (v_ArrVal_7545 Int)) (or (< (select (store |c_#length| v_append_~node~0.base_147 v_ArrVal_7545) .cse0) .cse1) (< v_ArrVal_7545 9)))) (forall ((v_ArrVal_7545 Int)) (or (forall ((v_append_~node~0.base_147 Int)) (let ((.cse2 (store |c_#length| v_append_~node~0.base_147 v_ArrVal_7545))) (or (< (select .cse2 .cse0) .cse1) (forall ((v_ArrVal_7547 (Array Int Int)) (v_ArrVal_7546 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_7546) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 9) (select .cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_7547) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (< v_ArrVal_7545 9)))))) is different from false [2024-11-07 16:31:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337884185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:31:06,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:31:06,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 56 [2024-11-07 16:31:06,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806171207] [2024-11-07 16:31:06,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:31:06,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-07 16:31:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:31:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-07 16:31:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3280, Unknown=1, NotChecked=116, Total=3660 [2024-11-07 16:31:06,840 INFO L87 Difference]: Start difference. First operand 179 states and 203 transitions. Second operand has 57 states, 56 states have (on average 3.875) internal successors, (217), 54 states have internal predecessors, (217), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-07 16:31:11,717 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:31:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:31:18,306 INFO L93 Difference]: Finished difference Result 333 states and 383 transitions. [2024-11-07 16:31:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-07 16:31:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.875) internal successors, (217), 54 states have internal predecessors, (217), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) Word has length 150 [2024-11-07 16:31:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:31:18,308 INFO L225 Difference]: With dead ends: 333 [2024-11-07 16:31:18,308 INFO L226 Difference]: Without dead ends: 333 [2024-11-07 16:31:18,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2388 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=799, Invalid=7035, Unknown=2, NotChecked=174, Total=8010 [2024-11-07 16:31:18,309 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 722 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:31:18,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1231 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1493 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2024-11-07 16:31:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-07 16:31:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 180. [2024-11-07 16:31:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 152 states have (on average 1.230263157894737) internal successors, (187), 168 states have internal predecessors, (187), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:31:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2024-11-07 16:31:18,313 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 150 [2024-11-07 16:31:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:31:18,313 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2024-11-07 16:31:18,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.875) internal successors, (217), 54 states have internal predecessors, (217), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-07 16:31:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2024-11-07 16:31:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 16:31:18,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:31:18,314 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:31:18,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-07 16:31:18,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:31:18,519 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:31:18,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:31:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash 959334360, now seen corresponding path program 1 times [2024-11-07 16:31:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:31:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557228233] [2024-11-07 16:31:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:31:18,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:31:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:18,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:31:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:18,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:31:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:18,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:31:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:31:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:19,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 16:31:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 16:31:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:19,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 16:31:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-07 16:31:19,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:31:19,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557228233] [2024-11-07 16:31:19,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557228233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:31:19,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:31:19,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:31:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650323605] [2024-11-07 16:31:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:31:19,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:31:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:31:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:31:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:31:19,076 INFO L87 Difference]: Start difference. First operand 180 states and 203 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:31:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:31:19,180 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2024-11-07 16:31:19,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:31:19,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-07 16:31:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:31:19,181 INFO L225 Difference]: With dead ends: 179 [2024-11-07 16:31:19,181 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 16:31:19,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:31:19,182 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 84 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:31:19,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 122 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:31:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 16:31:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-07 16:31:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 151 states have (on average 1.2251655629139073) internal successors, (185), 167 states have internal predecessors, (185), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:31:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 201 transitions. [2024-11-07 16:31:19,185 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 201 transitions. Word has length 155 [2024-11-07 16:31:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:31:19,185 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 201 transitions. [2024-11-07 16:31:19,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:31:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 201 transitions. [2024-11-07 16:31:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 16:31:19,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:31:19,186 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:31:19,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 16:31:19,186 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:31:19,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:31:19,187 INFO L85 PathProgramCache]: Analyzing trace with hash -323958977, now seen corresponding path program 1 times [2024-11-07 16:31:19,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:31:19,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051458470] [2024-11-07 16:31:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:31:19,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:31:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:19,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 16:31:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:20,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 16:31:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 16:31:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:31:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:20,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 16:31:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:20,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 16:31:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 16:31:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-07 16:31:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:31:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051458470] [2024-11-07 16:31:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051458470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:31:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426448738] [2024-11-07 16:31:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:31:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:31:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:31:20,254 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:31:20,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-07 16:31:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:31:20,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-07 16:31:20,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:31:20,723 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:31:20,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:31:20,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:31:20,768 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 15 treesize of output 1 [2024-11-07 16:31:20,793 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 33 treesize of output 17 [2024-11-07 16:31:20,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:20,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-07 16:31:24,967 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select .cse1 .cse3)) (.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (<= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse2) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2024-11-07 16:31:24,969 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select .cse1 .cse3)) (.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (<= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse2) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2024-11-07 16:31:24,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:24,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-07 16:31:25,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:25,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-07 16:31:25,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:25,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-07 16:31:25,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:25,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-07 16:31:25,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:25,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-07 16:31:25,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:31:25,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-07 16:31:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 246 trivial. 5 not checked. [2024-11-07 16:31:25,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:31:25,405 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8765 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_8765) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-07 16:31:25,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426448738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:31:25,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:31:25,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2024-11-07 16:31:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289362159] [2024-11-07 16:31:25,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:31:25,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 16:31:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:31:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 16:31:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=360, Unknown=3, NotChecked=78, Total=506 [2024-11-07 16:31:25,408 INFO L87 Difference]: Start difference. First operand 179 states and 201 transitions. Second operand has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 19 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 16:31:25,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse7 (select .cse6 .cse4))) (let ((.cse0 (<= (+ .cse7 1) |c_#StackHeapBarrier|)) (.cse5 (<= (select .cse6 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse7))) (and .cse0 (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse3 (select .cse2 .cse4)) (.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (<= (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse3) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1))))) (and .cse0 .cse5)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) .cse5)))) is different from false [2024-11-07 16:31:25,721 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse7 (select .cse6 .cse4))) (let ((.cse0 (<= (+ .cse7 1) |c_#StackHeapBarrier|)) (.cse5 (<= (select .cse6 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse7))) (and .cse0 (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse3 (select .cse2 .cse4)) (.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_72| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (<= (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse3) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1))))) (and .cse0 .cse5)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) .cse5)))) is different from true [2024-11-07 16:31:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:31:26,033 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2024-11-07 16:31:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 16:31:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 19 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 156 [2024-11-07 16:31:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:31:26,035 INFO L225 Difference]: With dead ends: 300 [2024-11-07 16:31:26,035 INFO L226 Difference]: Without dead ends: 300 [2024-11-07 16:31:26,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=202, Invalid=1137, Unknown=5, NotChecked=216, Total=1560 [2024-11-07 16:31:26,036 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 300 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:31:26,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 636 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 640 Invalid, 0 Unknown, 207 Unchecked, 0.4s Time] [2024-11-07 16:31:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-07 16:31:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 180. [2024-11-07 16:31:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 168 states have internal predecessors, (186), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:31:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 202 transitions. [2024-11-07 16:31:26,041 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 202 transitions. Word has length 156 [2024-11-07 16:31:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:31:26,041 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 202 transitions. [2024-11-07 16:31:26,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 19 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 16:31:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 202 transitions. [2024-11-07 16:31:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 16:31:26,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:31:26,042 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:31:26,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-07 16:31:26,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:31:26,243 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-07 16:31:26,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:31:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash -270265747, now seen corresponding path program 1 times [2024-11-07 16:31:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:31:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634978514] [2024-11-07 16:31:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:31:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:31:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat